./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:35:04,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:35:04,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:35:04,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:35:04,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:35:04,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:35:04,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:35:04,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:35:04,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:35:04,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:35:04,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:35:04,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:35:04,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:35:04,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:35:04,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:35:04,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:35:04,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:35:04,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:35:04,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:35:04,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:35:04,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:35:04,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:35:04,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:35:04,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:35:04,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:35:04,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:35:04,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:35:04,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:35:04,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:35:04,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:35:04,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:35:04,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:35:04,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:35:04,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:35:04,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:35:04,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:35:04,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:35:04,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:35:04,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:35:04,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:35:04,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:35:04,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:35:04,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:35:04,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:35:04,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:35:04,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:35:04,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:35:04,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:35:04,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:35:04,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:35:04,792 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:35:04,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:35:04,794 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:35:04,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:35:04,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:35:04,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:35:04,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:35:04,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:35:04,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:35:04,795 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:35:04,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:35:04,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:35:04,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:35:04,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:35:04,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:35:04,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:35:04,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:35:04,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:35:04,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:35:04,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:35:04,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:35:04,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:35:04,798 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:35:04,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:35:04,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:35:04,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 [2022-11-16 12:35:05,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:35:05,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:35:05,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:35:05,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:35:05,146 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:35:05,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2022-11-16 12:35:05,231 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/2eadbb5c8/c1831a5eb5424189b81740ecd9422a7c/FLAGcdb4ec0c9 [2022-11-16 12:35:05,761 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:35:05,762 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2022-11-16 12:35:05,779 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/2eadbb5c8/c1831a5eb5424189b81740ecd9422a7c/FLAGcdb4ec0c9 [2022-11-16 12:35:06,080 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/2eadbb5c8/c1831a5eb5424189b81740ecd9422a7c [2022-11-16 12:35:06,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:35:06,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:35:06,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:35:06,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:35:06,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:35:06,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ddbadde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06, skipping insertion in model container [2022-11-16 12:35:06,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:35:06,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:35:06,585 WARN L229 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_c7a7d249-cb8b-42ec-af43-2603e85293ac/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-11-16 12:35:06,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:35:06,597 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:35:06,669 WARN L229 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_c7a7d249-cb8b-42ec-af43-2603e85293ac/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-11-16 12:35:06,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:35:06,706 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:35:06,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06 WrapperNode [2022-11-16 12:35:06,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:35:06,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:35:06,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:35:06,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:35:06,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,791 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 205 [2022-11-16 12:35:06,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:35:06,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:35:06,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:35:06,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:35:06,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,846 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:35:06,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:35:06,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:35:06,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:35:06,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (1/1) ... [2022-11-16 12:35:06,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:35:06,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:06,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:35:06,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:35:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-16 12:35:06,958 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-16 12:35:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:35:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:35:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:35:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:35:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:35:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:35:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:35:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:35:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:35:06,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:35:07,121 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:35:07,123 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:35:07,192 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-16 12:35:07,540 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:35:07,546 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:35:07,547 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-16 12:35:07,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:07 BoogieIcfgContainer [2022-11-16 12:35:07,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:35:07,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:35:07,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:35:07,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:35:07,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:35:06" (1/3) ... [2022-11-16 12:35:07,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a985111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:35:07, skipping insertion in model container [2022-11-16 12:35:07,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:06" (2/3) ... [2022-11-16 12:35:07,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a985111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:35:07, skipping insertion in model container [2022-11-16 12:35:07,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:07" (3/3) ... [2022-11-16 12:35:07,562 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2022-11-16 12:35:07,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:35:07,582 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:35:07,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:35:07,669 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7cf2d4b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:35:07,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:35:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 50 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:35:07,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:07,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:07,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash -146872147, now seen corresponding path program 1 times [2022-11-16 12:35:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321071576] [2022-11-16 12:35:07,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:07,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321071576] [2022-11-16 12:35:07,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321071576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:07,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:07,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:35:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226282535] [2022-11-16 12:35:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:07,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:35:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:07,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:35:07,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:35:07,994 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 50 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:08,034 INFO L93 Difference]: Finished difference Result 102 states and 160 transitions. [2022-11-16 12:35:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:35:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 12:35:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:08,044 INFO L225 Difference]: With dead ends: 102 [2022-11-16 12:35:08,044 INFO L226 Difference]: Without dead ends: 43 [2022-11-16 12:35:08,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:35:08,052 INFO L413 NwaCegarLoop]: 72 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, 72 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 [2022-11-16 12:35:08,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:35:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-16 12:35:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-16 12:35:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-11-16 12:35:08,095 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2022-11-16 12:35:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:08,095 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-11-16 12:35:08,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-11-16 12:35:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 12:35:08,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:08,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:08,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:35:08,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1237728308, now seen corresponding path program 1 times [2022-11-16 12:35:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:08,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978803290] [2022-11-16 12:35:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:08,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978803290] [2022-11-16 12:35:08,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978803290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:08,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:08,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:35:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761646273] [2022-11-16 12:35:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:08,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:35:08,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:35:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:35:08,296 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:08,315 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2022-11-16 12:35:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:35:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 12:35:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:08,320 INFO L225 Difference]: With dead ends: 71 [2022-11-16 12:35:08,320 INFO L226 Difference]: Without dead ends: 51 [2022-11-16 12:35:08,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:35:08,322 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:08,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:35:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-16 12:35:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-16 12:35:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2022-11-16 12:35:08,330 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2022-11-16 12:35:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:08,331 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2022-11-16 12:35:08,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2022-11-16 12:35:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:35:08,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:08,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:08,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:35:08,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1368149959, now seen corresponding path program 1 times [2022-11-16 12:35:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:08,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969728413] [2022-11-16 12:35:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:08,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969728413] [2022-11-16 12:35:08,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969728413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:08,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:08,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:35:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333117037] [2022-11-16 12:35:08,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:08,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:35:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:35:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:35:08,826 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:09,214 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2022-11-16 12:35:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:35:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 12:35:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:09,216 INFO L225 Difference]: With dead ends: 142 [2022-11-16 12:35:09,216 INFO L226 Difference]: Without dead ends: 106 [2022-11-16 12:35:09,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:35:09,218 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:09,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 168 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:35:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-16 12:35:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2022-11-16 12:35:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2022-11-16 12:35:09,232 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 27 [2022-11-16 12:35:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:09,233 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2022-11-16 12:35:09,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2022-11-16 12:35:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:35:09,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:09,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:09,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:35:09,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2109168887, now seen corresponding path program 1 times [2022-11-16 12:35:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:09,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458830139] [2022-11-16 12:35:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:09,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458830139] [2022-11-16 12:35:09,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458830139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:09,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:09,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:35:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948072958] [2022-11-16 12:35:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:09,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:35:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:09,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:35:09,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:35:09,484 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:09,617 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2022-11-16 12:35:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:35:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 12:35:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:09,625 INFO L225 Difference]: With dead ends: 99 [2022-11-16 12:35:09,625 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 12:35:09,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:35:09,633 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:09,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:35:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 12:35:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-11-16 12:35:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2022-11-16 12:35:09,657 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 27 [2022-11-16 12:35:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:09,658 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2022-11-16 12:35:09,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2022-11-16 12:35:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:35:09,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:09,663 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:09,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:35:09,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -264583150, now seen corresponding path program 1 times [2022-11-16 12:35:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:09,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818198601] [2022-11-16 12:35:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818198601] [2022-11-16 12:35:09,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818198601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:09,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:09,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:35:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001500243] [2022-11-16 12:35:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:09,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:35:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:35:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:35:09,898 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:10,021 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2022-11-16 12:35:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:35:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 12:35:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:10,023 INFO L225 Difference]: With dead ends: 101 [2022-11-16 12:35:10,023 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 12:35:10,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:35:10,030 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:10,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 198 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:35:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 12:35:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-16 12:35:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.475) internal successors, (118), 80 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2022-11-16 12:35:10,054 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 29 [2022-11-16 12:35:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:10,056 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2022-11-16 12:35:10,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2022-11-16 12:35:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:35:10,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:10,068 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:10,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:35:10,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 760119826, now seen corresponding path program 1 times [2022-11-16 12:35:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:10,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589375666] [2022-11-16 12:35:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589375666] [2022-11-16 12:35:10,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589375666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:10,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:10,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:35:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985283737] [2022-11-16 12:35:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:10,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:35:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:35:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:35:10,231 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:10,338 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2022-11-16 12:35:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:35:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 12:35:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:10,340 INFO L225 Difference]: With dead ends: 101 [2022-11-16 12:35:10,340 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 12:35:10,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:35:10,341 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:10,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 187 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:35:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 12:35:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2022-11-16 12:35:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 77 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2022-11-16 12:35:10,350 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 29 [2022-11-16 12:35:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:10,350 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2022-11-16 12:35:10,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2022-11-16 12:35:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:35:10,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:10,352 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:35:10,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -219954082, now seen corresponding path program 1 times [2022-11-16 12:35:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:10,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884504174] [2022-11-16 12:35:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:10,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884504174] [2022-11-16 12:35:10,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884504174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595349258] [2022-11-16 12:35:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:10,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:10,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:10,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:35:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:10,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:35:10,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:10,968 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:11,101 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:11,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:11,109 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:11,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:11,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:35:11,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:11,311 INFO L350 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 15 treesize of output 7 [2022-11-16 12:35:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:11,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:11,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:11,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-16 12:35:11,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:11,503 INFO L350 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 30 treesize of output 33 [2022-11-16 12:35:11,511 INFO L350 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 9 treesize of output 7 [2022-11-16 12:35:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:11,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595349258] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:11,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:11,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-16 12:35:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327230402] [2022-11-16 12:35:11,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:11,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:35:11,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:35:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=214, Unknown=5, NotChecked=0, Total=272 [2022-11-16 12:35:11,703 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:11,961 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2022-11-16 12:35:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:35:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 12:35:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:11,963 INFO L225 Difference]: With dead ends: 101 [2022-11-16 12:35:11,963 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 12:35:11,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=351, Unknown=5, NotChecked=0, Total=462 [2022-11-16 12:35:11,964 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 156 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:11,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 259 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2022-11-16 12:35:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 12:35:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2022-11-16 12:35:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2022-11-16 12:35:11,973 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 31 [2022-11-16 12:35:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:11,974 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2022-11-16 12:35:11,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2022-11-16 12:35:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:35:11,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:11,975 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:11,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:12,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:12,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 643447582, now seen corresponding path program 1 times [2022-11-16 12:35:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:12,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055745216] [2022-11-16 12:35:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:12,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055745216] [2022-11-16 12:35:12,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055745216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:12,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022386313] [2022-11-16 12:35:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:12,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:12,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:12,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:35:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:12,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:35:12,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:12,658 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:12,743 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:12,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:12,753 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:12,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:12,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:35:12,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:12,888 INFO L350 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 15 treesize of output 7 [2022-11-16 12:35:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:12,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:12,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-16 12:35:12,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:12,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-16 12:35:13,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:13,004 INFO L350 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 30 treesize of output 33 [2022-11-16 12:35:13,012 INFO L350 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 9 treesize of output 7 [2022-11-16 12:35:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 12:35:13,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022386313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:13,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:13,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-16 12:35:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490934063] [2022-11-16 12:35:13,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:13,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:35:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:35:13,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=191, Unknown=2, NotChecked=28, Total=272 [2022-11-16 12:35:13,130 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:13,449 INFO L93 Difference]: Finished difference Result 123 states and 167 transitions. [2022-11-16 12:35:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:35:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 12:35:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:13,451 INFO L225 Difference]: With dead ends: 123 [2022-11-16 12:35:13,451 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 12:35:13,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=288, Unknown=2, NotChecked=36, Total=420 [2022-11-16 12:35:13,452 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 63 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:13,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 545 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2022-11-16 12:35:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 12:35:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2022-11-16 12:35:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2022-11-16 12:35:13,467 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 31 [2022-11-16 12:35:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:13,468 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2022-11-16 12:35:13,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-11-16 12:35:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 12:35:13,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:13,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:13,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:13,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:13,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:13,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash -873795143, now seen corresponding path program 1 times [2022-11-16 12:35:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:13,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048881890] [2022-11-16 12:35:13,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:14,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:14,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048881890] [2022-11-16 12:35:14,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048881890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:14,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35173223] [2022-11-16 12:35:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:14,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:14,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:14,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:14,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:35:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:14,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 12:35:14,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:14,455 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:14,522 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:14,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:14,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:35:14,591 INFO L350 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 [2022-11-16 12:35:14,659 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:35:14,659 INFO L350 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 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-16 12:35:14,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 12:35:14,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-16 12:35:14,721 INFO L350 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 39 treesize of output 21 [2022-11-16 12:35:14,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 11 [2022-11-16 12:35:14,735 INFO L350 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 15 treesize of output 7 [2022-11-16 12:35:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:14,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:14,782 INFO L350 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 79 treesize of output 57 [2022-11-16 12:35:14,792 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_358 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_357 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 12:35:14,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:14,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 12:35:14,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:14,834 INFO L350 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 38 treesize of output 31 [2022-11-16 12:35:14,839 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:14,863 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:14,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-16 12:35:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 12:35:14,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35173223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:14,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:14,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-11-16 12:35:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976893980] [2022-11-16 12:35:14,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:14,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:35:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:14,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:35:14,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2022-11-16 12:35:14,997 INFO L87 Difference]: Start difference. First operand 96 states and 136 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:15,533 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2022-11-16 12:35:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:35:15,533 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-16 12:35:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:15,534 INFO L225 Difference]: With dead ends: 116 [2022-11-16 12:35:15,534 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 12:35:15,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=476, Unknown=1, NotChecked=46, Total=650 [2022-11-16 12:35:15,535 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:15,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 456 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 262 Invalid, 0 Unknown, 131 Unchecked, 0.3s Time] [2022-11-16 12:35:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 12:35:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-11-16 12:35:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 99 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2022-11-16 12:35:15,551 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 33 [2022-11-16 12:35:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:15,553 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2022-11-16 12:35:15,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2022-11-16 12:35:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:35:15,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:15,556 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:15,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:35:15,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:15,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1557127099, now seen corresponding path program 2 times [2022-11-16 12:35:15,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:15,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645592054] [2022-11-16 12:35:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:16,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:16,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645592054] [2022-11-16 12:35:16,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645592054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:16,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79399728] [2022-11-16 12:35:16,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:35:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:16,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:16,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:35:16,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:35:16,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:35:16,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 12:35:16,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:16,472 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:16,555 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:16,578 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:35:16,579 INFO L350 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:35:16,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:16,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:35:16,688 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:16,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:16,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:16,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:16,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:16,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:17,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:17,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-16 12:35:17,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:17,076 INFO L350 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 122 treesize of output 121 [2022-11-16 12:35:17,087 INFO L350 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 53 treesize of output 49 [2022-11-16 12:35:17,095 INFO L350 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 102 treesize of output 94 [2022-11-16 12:35:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:17,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79399728] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:17,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:17,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-11-16 12:35:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215820984] [2022-11-16 12:35:17,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:17,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:35:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:17,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:35:17,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=440, Unknown=8, NotChecked=0, Total=552 [2022-11-16 12:35:17,442 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:17,837 INFO L93 Difference]: Finished difference Result 121 states and 165 transitions. [2022-11-16 12:35:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:35:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 12:35:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:17,839 INFO L225 Difference]: With dead ends: 121 [2022-11-16 12:35:17,839 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 12:35:17,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=588, Unknown=8, NotChecked=0, Total=756 [2022-11-16 12:35:17,840 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 92 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:17,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 616 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 201 Invalid, 0 Unknown, 124 Unchecked, 0.2s Time] [2022-11-16 12:35:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 12:35:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2022-11-16 12:35:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4134615384615385) internal successors, (147), 104 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2022-11-16 12:35:17,851 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 35 [2022-11-16 12:35:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:17,851 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2022-11-16 12:35:17,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2022-11-16 12:35:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:35:17,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:17,852 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:17,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:18,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:35:18,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2145137748, now seen corresponding path program 2 times [2022-11-16 12:35:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:18,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427989512] [2022-11-16 12:35:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:18,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:18,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:18,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427989512] [2022-11-16 12:35:18,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427989512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:18,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811624367] [2022-11-16 12:35:18,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:35:18,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:18,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:18,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:18,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:35:18,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:35:18,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:35:18,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 12:35:18,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:19,032 INFO L350 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 [2022-11-16 12:35:19,038 INFO L350 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 [2022-11-16 12:35:19,102 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:35:19,102 INFO L350 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 1 case distinctions, treesize of input 44 treesize of output 47 [2022-11-16 12:35:19,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-11-16 12:35:19,122 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:35:19,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2022-11-16 12:35:19,131 INFO L350 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 17 treesize of output 13 [2022-11-16 12:35:19,144 INFO L350 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 43 treesize of output 35 [2022-11-16 12:35:19,274 INFO L350 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 15 [2022-11-16 12:35:19,278 INFO L350 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 26 treesize of output 14 [2022-11-16 12:35:19,322 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:19,323 INFO L350 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 22 treesize of output 14 [2022-11-16 12:35:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:19,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:19,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:19,466 INFO L350 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 76 treesize of output 79 [2022-11-16 12:35:19,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:19,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-16 12:35:19,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:19,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-16 12:35:19,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:19,588 INFO L350 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 83 treesize of output 52 [2022-11-16 12:35:19,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:19,603 INFO L350 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 58 treesize of output 57 [2022-11-16 12:35:19,610 INFO L350 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 41 treesize of output 37 [2022-11-16 12:35:19,615 INFO L350 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 37 treesize of output 33 [2022-11-16 12:35:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:19,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811624367] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:19,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:19,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-11-16 12:35:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116646367] [2022-11-16 12:35:19,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:19,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:35:19,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:19,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:35:19,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-11-16 12:35:19,721 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:20,367 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2022-11-16 12:35:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:35:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 12:35:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:20,369 INFO L225 Difference]: With dead ends: 126 [2022-11-16 12:35:20,369 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 12:35:20,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2022-11-16 12:35:20,370 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 112 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:20,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 399 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 257 Invalid, 0 Unknown, 41 Unchecked, 0.3s Time] [2022-11-16 12:35:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 12:35:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2022-11-16 12:35:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2022-11-16 12:35:20,381 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 35 [2022-11-16 12:35:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:20,382 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2022-11-16 12:35:20,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2022-11-16 12:35:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:35:20,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:20,383 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:20,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:20,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:20,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 66922580, now seen corresponding path program 1 times [2022-11-16 12:35:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786601496] [2022-11-16 12:35:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:35:20,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786601496] [2022-11-16 12:35:20,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786601496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975398140] [2022-11-16 12:35:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:20,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:20,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:20,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:20,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:35:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:20,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 12:35:20,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:21,003 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:21,044 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:21,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:21,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:35:21,092 INFO L350 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 [2022-11-16 12:35:21,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:35:21,145 INFO L350 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 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-16 12:35:21,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 12:35:21,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-16 12:35:21,191 INFO L350 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 39 treesize of output 21 [2022-11-16 12:35:21,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 11 [2022-11-16 12:35:21,213 INFO L350 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 15 treesize of output 7 [2022-11-16 12:35:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:21,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:21,284 INFO L350 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 52 treesize of output 30 [2022-11-16 12:35:21,292 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_624 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_626 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 12:35:21,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:21,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 12:35:21,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:21,320 INFO L350 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 36 treesize of output 35 [2022-11-16 12:35:21,324 INFO L350 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 7 treesize of output 3 [2022-11-16 12:35:21,342 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:21,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-16 12:35:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 12:35:21,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975398140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:21,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:21,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-11-16 12:35:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354440810] [2022-11-16 12:35:21,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:21,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:35:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:21,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:35:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2022-11-16 12:35:21,461 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:21,898 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2022-11-16 12:35:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:35:21,899 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 12:35:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:21,900 INFO L225 Difference]: With dead ends: 122 [2022-11-16 12:35:21,900 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 12:35:21,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=504, Unknown=1, NotChecked=46, Total=650 [2022-11-16 12:35:21,901 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:21,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 486 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2022-11-16 12:35:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 12:35:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2022-11-16 12:35:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2022-11-16 12:35:21,912 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 35 [2022-11-16 12:35:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:21,912 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2022-11-16 12:35:21,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2022-11-16 12:35:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:35:21,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:21,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:21,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:22,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:22,120 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1257425147, now seen corresponding path program 1 times [2022-11-16 12:35:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:22,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536528449] [2022-11-16 12:35:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:22,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536528449] [2022-11-16 12:35:22,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536528449] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816016144] [2022-11-16 12:35:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:22,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:22,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:22,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:22,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:35:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:22,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 12:35:22,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:22,812 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:22,841 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:22,855 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:22,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:22,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:22,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:35:22,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:22,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:23,001 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:35:23,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:35:23,133 INFO L350 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 15 treesize of output 7 [2022-11-16 12:35:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:23,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:23,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_734 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_62| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_62|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-11-16 12:35:23,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_734 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_734))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_62| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_62|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-11-16 12:35:23,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:23,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-16 12:35:23,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:23,391 INFO L350 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 267 treesize of output 273 [2022-11-16 12:35:23,406 INFO L350 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 257 treesize of output 241 [2022-11-16 12:35:23,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:35:23,589 INFO L350 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 133 treesize of output 125 [2022-11-16 12:35:23,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:23,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-11-16 12:35:24,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:24,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 274 [2022-11-16 12:35:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-16 12:35:24,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816016144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:24,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:24,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-11-16 12:35:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668681028] [2022-11-16 12:35:24,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:24,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:35:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:35:24,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=336, Unknown=18, NotChecked=78, Total=506 [2022-11-16 12:35:24,722 INFO L87 Difference]: Start difference. First operand 102 states and 142 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:25,531 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2022-11-16 12:35:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:35:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 12:35:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:25,532 INFO L225 Difference]: With dead ends: 133 [2022-11-16 12:35:25,533 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 12:35:25,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=245, Invalid=929, Unknown=24, NotChecked=134, Total=1332 [2022-11-16 12:35:25,534 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 113 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:25,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 619 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 249 Invalid, 0 Unknown, 264 Unchecked, 0.3s Time] [2022-11-16 12:35:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 12:35:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2022-11-16 12:35:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 109 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2022-11-16 12:35:25,544 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 35 [2022-11-16 12:35:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:25,545 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2022-11-16 12:35:25,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2022-11-16 12:35:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:35:25,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:25,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:25,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:25,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:35:25,752 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash -658078444, now seen corresponding path program 1 times [2022-11-16 12:35:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:25,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340942568] [2022-11-16 12:35:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:25,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:26,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340942568] [2022-11-16 12:35:26,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340942568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:26,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124979264] [2022-11-16 12:35:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:26,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:26,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:26,287 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:26,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:35:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:26,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 12:35:26,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:26,452 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:26,491 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:26,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:26,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:35:26,524 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:26,583 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:35:26,583 INFO L350 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 1 case distinctions, treesize of input 52 treesize of output 49 [2022-11-16 12:35:26,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 12:35:26,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-16 12:35:26,626 INFO L350 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 31 treesize of output 19 [2022-11-16 12:35:26,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:35:26,642 INFO L350 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 15 treesize of output 7 [2022-11-16 12:35:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:26,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:26,699 INFO L350 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 52 treesize of output 30 [2022-11-16 12:35:26,705 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_817 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_814 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 12:35:26,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:26,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 12:35:26,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:26,754 INFO L350 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 38 treesize of output 31 [2022-11-16 12:35:26,760 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:26,778 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:26,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-16 12:35:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 12:35:26,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124979264] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:26,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:26,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-11-16 12:35:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986973095] [2022-11-16 12:35:26,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:26,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:35:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:35:26,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2022-11-16 12:35:26,890 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:27,361 INFO L93 Difference]: Finished difference Result 129 states and 173 transitions. [2022-11-16 12:35:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:35:27,362 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 12:35:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:27,362 INFO L225 Difference]: With dead ends: 129 [2022-11-16 12:35:27,363 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 12:35:27,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=452, Unknown=2, NotChecked=44, Total=600 [2022-11-16 12:35:27,364 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 100 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:27,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 456 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 252 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2022-11-16 12:35:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 12:35:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2022-11-16 12:35:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2022-11-16 12:35:27,389 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 35 [2022-11-16 12:35:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:27,389 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2022-11-16 12:35:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2022-11-16 12:35:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:35:27,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:27,390 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:27,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 12:35:27,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:27,596 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:27,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842976, now seen corresponding path program 3 times [2022-11-16 12:35:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:27,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245010196] [2022-11-16 12:35:27,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:28,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245010196] [2022-11-16 12:35:28,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245010196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:28,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208499279] [2022-11-16 12:35:28,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:35:28,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:28,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:28,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:28,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:35:28,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:35:28,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:35:28,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 12:35:28,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:28,766 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:28,836 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:28,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:28,888 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:28,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:35:28,955 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:35:28,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 12:35:28,961 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:28,985 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:35:28,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-16 12:35:28,996 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:29,095 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:35:29,095 INFO L350 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 1 case distinctions, treesize of input 101 treesize of output 92 [2022-11-16 12:35:29,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:29,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-16 12:35:29,109 INFO L350 Elim1Store]: Elim1 eliminated variable 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 65 treesize of output 51 [2022-11-16 12:35:29,213 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:35:29,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2022-11-16 12:35:29,233 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:35:29,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-16 12:35:29,268 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-16 12:35:29,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 47 [2022-11-16 12:35:29,289 INFO L350 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 15 treesize of output 11 [2022-11-16 12:35:29,325 INFO L350 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 59 treesize of output 47 [2022-11-16 12:35:29,816 INFO L350 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 109 treesize of output 85 [2022-11-16 12:35:29,837 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-16 12:35:29,837 INFO L350 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 89 treesize of output 77 [2022-11-16 12:35:30,155 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:30,155 INFO L350 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 22 treesize of output 14 [2022-11-16 12:35:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:30,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:30,757 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-16 12:35:30,758 INFO L350 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 1404 treesize of output 1358 [2022-11-16 12:35:30,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:30,799 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 823 treesize of output 726 [2022-11-16 12:35:32,733 INFO L350 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 8 treesize of output 4 [2022-11-16 12:35:32,771 INFO L350 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 8 treesize of output 4 [2022-11-16 12:35:33,117 INFO L350 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 8 treesize of output 4 [2022-11-16 12:35:33,362 INFO L350 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 8 treesize of output 4 [2022-11-16 12:35:33,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse49 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4)) (.cse48 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse61 0) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_13 .cse4) 0))))) (.cse3 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse60 0) (= .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse7 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse59 0) (= .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse59 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse8 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse58 0) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~a~0#1.base|))))))) (.cse22 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse56 0) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse57 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse57 |c_ULTIMATE.start_main_~a~0#1.base|))))))))) (.cse29 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse54 0) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse55 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))))))))) (.cse9 (and .cse49 .cse48)) (.cse41 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |v_ULTIMATE.start_main_~p~0#1.base_79|)))) (not (= (select v_arrayElimArr_13 .cse4) 0))))) (.cse43 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse52 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))))))))) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse44 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |v_ULTIMATE.start_main_~p~0#1.base_79|)) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse45 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse50 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse50 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (not (= (select v_arrayElimArr_13 .cse4) 0))))) (.cse0 (not .cse49)) (.cse1 (not .cse48))) (and (or .cse0 .cse1 (and (or (and .cse2 .cse3 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 0))))))) .cse6) .cse7 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse8)) (or .cse9 (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse11 0) (not (= .cse11 .cse4))))))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) (or .cse6 (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse12 0) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse12 .cse4))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse13 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_932 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse4))))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse14 .cse4))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse15 |v_ULTIMATE.start_main_~p~0#1.base_79|) (not (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse17 0) (not (= .cse17 .cse4))))))) (not (= (select v_arrayElimArr_13 .cse4) 0)))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse18 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_932 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse4))))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse19 0) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse19 .cse4))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse20 .cse4))))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse21 |v_ULTIMATE.start_main_~p~0#1.base_79|) (not (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= (select v_arrayElimArr_13 .cse4) 0)))))) (or .cse9 (and (or .cse6 (and .cse22 .cse2 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse23 .cse4) (= .cse23 0) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse3 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse24 0) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 0)))) (not (= (select v_arrayElimArr_13 .cse4) 0)))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse26 .cse4) (= .cse26 0) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse28 0) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) .cse7 .cse29 .cse8)) (or (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse30 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |v_ULTIMATE.start_main_~p~0#1.base_79|)) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse31 0) (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) (forall ((v_ArrVal_930 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_79| Int) (v_ArrVal_927 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse32 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse33 .cse4) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |v_ULTIMATE.start_main_~p~0#1.base_79|)) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse34 .cse4) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse35 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (or (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse36 .cse4) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |v_ULTIMATE.start_main_~p~0#1.base_79|)))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse37 .cse4) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse38 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |v_ULTIMATE.start_main_~p~0#1.base_79|)) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse39 0) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (not (= (select v_arrayElimArr_13 .cse4) 0)))) (forall ((v_ArrVal_930 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_79| Int) (v_ArrVal_927 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse40 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse22 .cse41 (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_79| Int)) (or (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse42 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) .cse43) .cse6) .cse44 .cse29 .cse45) .cse9) (or (and (forall ((v_ArrVal_930 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_79| Int) (v_ArrVal_927 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse46 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_79| |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (and .cse41 (forall ((v_ArrVal_930 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_79| Int) (v_ArrVal_927 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_927) |v_ULTIMATE.start_main_~p~0#1.base_79| v_ArrVal_930) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse47 |v_ULTIMATE.start_main_~p~0#1.base_79|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse43) .cse6) .cse44 .cse45) .cse0 .cse1))))) is different from false [2022-11-16 12:35:36,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 12:35:36,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 12:35:36,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:35:36,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,366 INFO L350 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-16 12:35:36,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:35:36,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,379 INFO L350 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-16 12:35:36,384 INFO L350 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 23 treesize of output 15 [2022-11-16 12:35:36,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2022-11-16 12:35:36,439 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-16 12:35:36,448 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-16 12:35:36,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 12:35:36,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 12:35:36,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,490 INFO L350 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 129 treesize of output 122 [2022-11-16 12:35:36,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,511 INFO L350 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 70 treesize of output 69 [2022-11-16 12:35:36,523 INFO L350 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 57 treesize of output 49 [2022-11-16 12:35:36,532 INFO L350 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 54 treesize of output 46 [2022-11-16 12:35:36,544 INFO L350 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 99 treesize of output 83 [2022-11-16 12:35:36,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 12:35:36,764 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:35:36,776 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:35:36,789 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-16 12:35:36,810 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-11-16 12:35:36,822 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-11-16 12:35:36,835 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 1 [2022-11-16 12:35:36,851 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:36,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-11-16 12:35:36,862 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:35:36,869 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:35:36,876 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:35:36,883 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:35:36,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 12:35:36,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 12:35:36,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:36,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-16 12:35:36,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:36,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-16 12:35:36,936 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:36,943 INFO L350 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 12 treesize of output 8 [2022-11-16 12:35:36,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:35:36,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 13 [2022-11-16 12:35:36,959 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:36,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:36,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-11-16 12:35:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:36,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:35:36,987 INFO L350 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 32 treesize of output 26 [2022-11-16 12:35:36,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:35:36,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2022-11-16 12:35:37,018 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:37,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-16 12:35:37,031 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:37,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-16 12:35:37,050 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:37,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:35:37,067 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:37,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-16 12:35:37,082 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:37,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-16 12:35:37,094 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:37,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-16 12:35:37,107 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:35:37,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:35:37,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:37,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-11-16 12:35:37,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:35:37,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:37,132 INFO L350 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 1 case distinctions, treesize of input 86 treesize of output 73 [2022-11-16 12:35:37,168 INFO L350 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 34 treesize of output 22 [2022-11-16 12:35:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-16 12:35:37,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208499279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:37,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:37,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 34 [2022-11-16 12:35:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631533981] [2022-11-16 12:35:37,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:37,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 12:35:37,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 12:35:37,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=4, NotChecked=62, Total=1122 [2022-11-16 12:35:37,468 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:39,684 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2022-11-16 12:35:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:35:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 12:35:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:39,686 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:35:39,686 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 12:35:39,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=269, Invalid=2083, Unknown=4, NotChecked=94, Total=2450 [2022-11-16 12:35:39,690 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 127 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:39,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 710 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 430 Invalid, 0 Unknown, 230 Unchecked, 0.5s Time] [2022-11-16 12:35:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 12:35:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2022-11-16 12:35:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2022-11-16 12:35:39,710 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 37 [2022-11-16 12:35:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:39,711 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2022-11-16 12:35:39,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2022-11-16 12:35:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:35:39,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:39,712 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:39,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 12:35:39,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:35:39,918 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash -677140000, now seen corresponding path program 2 times [2022-11-16 12:35:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:39,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777005093] [2022-11-16 12:35:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:40,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777005093] [2022-11-16 12:35:40,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777005093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:40,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54313949] [2022-11-16 12:35:40,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:35:40,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:40,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:40,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:40,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:35:40,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:35:40,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:35:40,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 12:35:40,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:40,545 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:40,603 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:40,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:40,611 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:40,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:40,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:35:40,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:40,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:40,746 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:35:40,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:35:40,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:40,804 INFO L350 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 31 treesize of output 23 [2022-11-16 12:35:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:40,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:40,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_1042 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1042))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_87|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-16 12:35:40,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_1042 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1042))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_87|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-16 12:35:40,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:40,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2022-11-16 12:35:41,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:41,020 INFO L350 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 223 treesize of output 231 [2022-11-16 12:35:41,028 INFO L350 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 200 treesize of output 190 [2022-11-16 12:35:41,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:35:41,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:35:41,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:35:41,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:41,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-11-16 12:35:41,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:41,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-11-16 12:35:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 12:35:41,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54313949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:41,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:41,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-11-16 12:35:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077290285] [2022-11-16 12:35:41,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:41,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:35:41,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:41,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:35:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=8, NotChecked=66, Total=380 [2022-11-16 12:35:41,352 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:41,692 INFO L93 Difference]: Finished difference Result 128 states and 174 transitions. [2022-11-16 12:35:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:35:41,692 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-16 12:35:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:41,693 INFO L225 Difference]: With dead ends: 128 [2022-11-16 12:35:41,693 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 12:35:41,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=8, NotChecked=90, Total=650 [2022-11-16 12:35:41,695 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 48 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:41,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 518 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2022-11-16 12:35:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 12:35:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-11-16 12:35:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.38135593220339) internal successors, (163), 118 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2022-11-16 12:35:41,707 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 37 [2022-11-16 12:35:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:41,707 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2022-11-16 12:35:41,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2022-11-16 12:35:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:35:41,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:41,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:41,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:41,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:35:41,914 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:35:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash -426372960, now seen corresponding path program 1 times [2022-11-16 12:35:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:41,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158069342] [2022-11-16 12:35:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158069342] [2022-11-16 12:35:42,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158069342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917639503] [2022-11-16 12:35:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:42,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:42,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:35:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:43,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-16 12:35:43,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:43,020 INFO L350 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 6 treesize of output 5 [2022-11-16 12:35:43,067 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:35:43,068 INFO L350 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:35:43,143 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:43,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:35:43,253 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:35:43,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-16 12:35:43,273 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 12:35:43,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 12:35:43,285 INFO L350 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 11 treesize of output 7 [2022-11-16 12:35:43,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:43,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:35:43,375 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 12:35:43,376 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 141 treesize of output 103 [2022-11-16 12:35:43,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-16 12:35:43,387 INFO L350 Elim1Store]: Elim1 eliminated variable 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 115 treesize of output 93 [2022-11-16 12:35:43,530 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:35:43,531 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 145 [2022-11-16 12:35:43,557 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 12:35:43,557 INFO L350 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 2 case distinctions, treesize of input 146 treesize of output 134 [2022-11-16 12:35:43,569 INFO L350 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 69 treesize of output 54 [2022-11-16 12:35:43,700 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 12:35:43,700 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 60 [2022-11-16 12:35:43,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2022-11-16 12:35:43,869 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:43,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-11-16 12:35:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:43,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:44,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:44,164 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2022-11-16 12:35:44,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:44,182 INFO L350 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 1428 treesize of output 1403 [2022-11-16 12:35:44,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:35:44,240 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 541 treesize of output 494 [2022-11-16 12:35:45,081 INFO L350 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 8 treesize of output 4 [2022-11-16 12:35:45,176 INFO L350 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 8 treesize of output 4 [2022-11-16 12:35:45,195 INFO L350 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 8 treesize of output 4 [2022-11-16 12:35:45,351 INFO L350 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 51 treesize of output 39 [2022-11-16 12:35:45,370 INFO L350 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 49 treesize of output 37 [2022-11-16 12:35:45,572 INFO L350 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 58 treesize of output 42 [2022-11-16 12:35:45,682 INFO L350 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 56 treesize of output 40 [2022-11-16 12:35:45,877 INFO L350 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 37 treesize of output 25 [2022-11-16 12:35:45,915 INFO L350 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 30 treesize of output 22 [2022-11-16 12:36:47,094 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 189 DAG size of output: 162 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:36:48,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:48,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1094 treesize of output 975 [2022-11-16 12:36:48,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:48,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 964 treesize of output 815 [2022-11-16 12:36:48,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:48,822 INFO L350 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 3277 treesize of output 2280 [2022-11-16 12:36:48,900 INFO L350 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 2056 treesize of output 2048 [2022-11-16 12:36:48,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:48,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2048 treesize of output 2049 [2022-11-16 12:36:49,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:49,042 INFO L350 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 3351 treesize of output 3242 [2022-11-16 12:36:49,125 INFO L350 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 3226 treesize of output 3194 [2022-11-16 12:36:49,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:49,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3194 treesize of output 3087 [2022-11-16 12:36:49,248 INFO L350 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 3078 treesize of output 3046 [2022-11-16 12:36:49,297 INFO L350 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 3046 treesize of output 3014 [2022-11-16 12:36:49,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:49,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3014 treesize of output 3003 [2022-11-16 12:36:49,428 INFO L350 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 2994 treesize of output 2986 [2022-11-16 12:36:49,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:49,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2986 treesize of output 2907 [2022-11-16 12:36:49,553 INFO L350 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 2898 treesize of output 2866 [2022-11-16 12:36:49,607 INFO L350 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 2866 treesize of output 2858 [2022-11-16 12:36:49,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:49,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2858 treesize of output 2859 [2022-11-16 12:36:49,727 INFO L350 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 2850 treesize of output 2818 [2022-11-16 12:36:49,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:49,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2818 treesize of output 2787 [2022-11-16 12:36:49,868 INFO L350 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 2778 treesize of output 2770 [2022-11-16 12:36:49,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:49,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2770 treesize of output 2711 [2022-11-16 12:36:50,027 INFO L350 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 2702 treesize of output 2694 [2022-11-16 12:36:50,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2694 treesize of output 2695 [2022-11-16 12:36:50,137 INFO L350 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 2686 treesize of output 2670 [2022-11-16 12:36:50,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2670 treesize of output 2627 [2022-11-16 12:36:50,251 INFO L350 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 2618 treesize of output 2610 [2022-11-16 12:36:50,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2610 treesize of output 2595 [2022-11-16 12:36:50,363 INFO L350 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 2586 treesize of output 2570 [2022-11-16 12:36:50,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2570 treesize of output 2567 [2022-11-16 12:36:50,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2558 treesize of output 2475 [2022-11-16 12:36:50,569 INFO L350 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 2466 treesize of output 2450 [2022-11-16 12:36:50,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2450 treesize of output 2439 [2022-11-16 12:36:50,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2430 treesize of output 2419 [2022-11-16 12:36:50,816 INFO L350 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 2410 treesize of output 2394 [2022-11-16 12:36:50,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:50,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2394 treesize of output 2359 [2022-11-16 12:36:50,960 INFO L350 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 2350 treesize of output 2342 [2022-11-16 12:36:51,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:51,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2342 treesize of output 2343 [2022-11-16 12:36:51,106 INFO L350 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 2334 treesize of output 2326 [2022-11-16 12:36:51,190 INFO L350 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 2326 treesize of output 2310 [2022-11-16 12:36:51,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:51,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2310 treesize of output 2307 [2022-11-16 12:36:51,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:51,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2298 treesize of output 2295 [2022-11-16 12:36:51,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:51,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2286 treesize of output 2283 [2022-11-16 12:36:51,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:51,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2274 treesize of output 2199 [2022-11-16 12:36:51,606 INFO L350 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 2190 treesize of output 2174 [2022-11-16 12:36:51,670 INFO L350 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 2174 treesize of output 2166 [2022-11-16 12:36:51,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:36:51,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2166 treesize of output 2147 [2022-11-16 12:39:21,553 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-16 12:39:21,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:21,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 12:39:21,754 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Maybe an infinite loop at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-16 12:39:21,759 INFO L158 Benchmark]: Toolchain (without parser) took 255672.29ms. Allocated memory was 123.7MB in the beginning and 564.1MB in the end (delta: 440.4MB). Free memory was 88.3MB in the beginning and 233.3MB in the end (delta: -145.0MB). Peak memory consumption was 338.9MB. Max. memory is 16.1GB. [2022-11-16 12:39:21,759 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:39:21,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.28ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 92.6MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:39:21,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.36ms. Allocated memory is still 123.7MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:21,765 INFO L158 Benchmark]: Boogie Preprocessor took 65.87ms. Allocated memory is still 123.7MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:21,767 INFO L158 Benchmark]: RCFGBuilder took 688.27ms. Allocated memory is still 123.7MB. Free memory was 88.4MB in the beginning and 65.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:21,767 INFO L158 Benchmark]: TraceAbstraction took 254206.50ms. Allocated memory was 123.7MB in the beginning and 564.1MB in the end (delta: 440.4MB). Free memory was 64.6MB in the beginning and 233.3MB in the end (delta: -168.6MB). Peak memory consumption was 318.4MB. Max. memory is 16.1GB. [2022-11-16 12:39:21,769 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.28ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 92.6MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.36ms. Allocated memory is still 123.7MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.87ms. Allocated memory is still 123.7MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.27ms. Allocated memory is still 123.7MB. Free memory was 88.4MB in the beginning and 65.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 254206.50ms. Allocated memory was 123.7MB in the beginning and 564.1MB in the end (delta: 440.4MB). Free memory was 64.6MB in the beginning and 233.3MB in the end (delta: -168.6MB). Peak memory consumption was 318.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Maybe an infinite loop de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Maybe an infinite loop: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-16 12:39:21,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:39:24,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:39:24,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:39:24,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:39:24,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:39:24,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:39:24,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:39:24,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:39:24,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:39:24,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:39:24,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:39:24,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:39:24,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:39:24,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:39:24,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:39:24,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:39:24,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:39:24,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:39:24,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:39:24,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:39:24,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:39:24,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:39:24,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:39:24,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:39:24,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:39:24,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:39:24,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:39:24,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:39:24,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:39:24,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:39:24,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:39:24,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:39:24,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:39:24,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:39:24,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:39:24,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:39:24,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:39:24,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:39:24,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:39:24,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:39:24,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:39:24,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 12:39:24,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:39:24,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:39:24,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:39:24,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:39:24,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:39:24,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:39:24,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:39:24,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:39:24,239 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:39:24,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:39:24,241 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:39:24,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:39:24,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:39:24,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:39:24,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:39:24,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:39:24,242 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:39:24,244 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:39:24,245 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:39:24,245 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:39:24,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:39:24,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:39:24,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:39:24,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:39:24,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:39:24,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:39:24,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:24,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:39:24,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:39:24,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:39:24,248 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:39:24,248 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:39:24,249 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:39:24,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:39:24,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:39:24,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:39:24,251 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 [2022-11-16 12:39:24,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:39:24,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:39:24,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:39:24,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:39:24,694 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:39:24,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2022-11-16 12:39:24,771 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/dd83434b0/de9ff208c73f48dba2c5b46c1f75b58b/FLAGf72c4d5e2 [2022-11-16 12:39:25,328 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:39:25,329 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2022-11-16 12:39:25,341 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/dd83434b0/de9ff208c73f48dba2c5b46c1f75b58b/FLAGf72c4d5e2 [2022-11-16 12:39:25,608 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/data/dd83434b0/de9ff208c73f48dba2c5b46c1f75b58b [2022-11-16 12:39:25,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:39:25,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:39:25,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:25,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:39:25,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:39:25,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:25" (1/1) ... [2022-11-16 12:39:25,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4786bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:25, skipping insertion in model container [2022-11-16 12:39:25,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:25" (1/1) ... [2022-11-16 12:39:25,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:39:25,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:39:26,060 WARN L229 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_c7a7d249-cb8b-42ec-af43-2603e85293ac/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-11-16 12:39:26,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:26,088 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:39:26,150 WARN L229 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_c7a7d249-cb8b-42ec-af43-2603e85293ac/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-11-16 12:39:26,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:26,201 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:39:26,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26 WrapperNode [2022-11-16 12:39:26,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:26,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:26,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:39:26,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:39:26,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,293 INFO L138 Inliner]: procedures = 125, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 190 [2022-11-16 12:39:26,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:26,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:39:26,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:39:26,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:39:26,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:39:26,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:39:26,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:39:26,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:39:26,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (1/1) ... [2022-11-16 12:39:26,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:26,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:26,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:39:26,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:39:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-16 12:39:26,501 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-16 12:39:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:39:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:39:26,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:39:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:39:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:39:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:39:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:39:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:39:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:39:26,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:39:26,659 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:39:26,661 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:39:26,720 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-16 12:39:27,435 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:39:27,441 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:39:27,442 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-16 12:39:27,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:27 BoogieIcfgContainer [2022-11-16 12:39:27,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:39:27,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:39:27,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:39:27,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:39:27,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:39:25" (1/3) ... [2022-11-16 12:39:27,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a050f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:27, skipping insertion in model container [2022-11-16 12:39:27,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:26" (2/3) ... [2022-11-16 12:39:27,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a050f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:27, skipping insertion in model container [2022-11-16 12:39:27,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:27" (3/3) ... [2022-11-16 12:39:27,466 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2022-11-16 12:39:27,482 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:39:27,482 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:39:27,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:39:27,552 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@59bd4ea4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:39:27,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:39:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 45 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:39:27,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:27,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:27,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -548632438, now seen corresponding path program 1 times [2022-11-16 12:39:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:27,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502096921] [2022-11-16 12:39:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:27,586 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 [2022-11-16 12:39:27,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:27,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:27,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:27,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:39:27,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:27,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:27,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:27,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502096921] [2022-11-16 12:39:27,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502096921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:27,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:27,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:39:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189308015] [2022-11-16 12:39:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:27,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:39:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:27,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:39:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:39:27,890 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 45 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:27,926 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2022-11-16 12:39:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:39:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 12:39:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:27,947 INFO L225 Difference]: With dead ends: 92 [2022-11-16 12:39:27,955 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 12:39:27,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:39:27,961 INFO L413 NwaCegarLoop]: 65 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, 65 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 [2022-11-16 12:39:27,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:39:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 12:39:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 12:39:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2022-11-16 12:39:27,996 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 16 [2022-11-16 12:39:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:27,996 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2022-11-16 12:39:27,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-11-16 12:39:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:39:27,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:27,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:28,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:28,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:28,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1497296167, now seen corresponding path program 1 times [2022-11-16 12:39:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:28,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552421635] [2022-11-16 12:39:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:28,215 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 [2022-11-16 12:39:28,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:28,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:28,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:28,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:39:28,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:28,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:28,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:28,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552421635] [2022-11-16 12:39:28,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552421635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:28,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:28,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362270359] [2022-11-16 12:39:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:28,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:39:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:39:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:39:28,347 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:28,369 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2022-11-16 12:39:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:39:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:39:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:28,372 INFO L225 Difference]: With dead ends: 64 [2022-11-16 12:39:28,373 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 12:39:28,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:39:28,375 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:28,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:39:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 12:39:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-16 12:39:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2022-11-16 12:39:28,385 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 18 [2022-11-16 12:39:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:28,385 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2022-11-16 12:39:28,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-11-16 12:39:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 12:39:28,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:28,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:28,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:28,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:28,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:28,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1695920500, now seen corresponding path program 1 times [2022-11-16 12:39:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:28,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800714037] [2022-11-16 12:39:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:28,608 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 [2022-11-16 12:39:28,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:28,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:28,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:28,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:39:28,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:28,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:28,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800714037] [2022-11-16 12:39:28,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800714037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:28,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:28,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994072488] [2022-11-16 12:39:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:39:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:28,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:39:28,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:39:28,729 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:28,767 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2022-11-16 12:39:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:39:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 12:39:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:28,769 INFO L225 Difference]: With dead ends: 82 [2022-11-16 12:39:28,769 INFO L226 Difference]: Without dead ends: 48 [2022-11-16 12:39:28,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:39:28,771 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:28,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:39:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-16 12:39:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-16 12:39:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2022-11-16 12:39:28,779 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 24 [2022-11-16 12:39:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:28,780 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2022-11-16 12:39:28,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-11-16 12:39:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 12:39:28,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:28,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:28,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:28,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:28,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash -298224206, now seen corresponding path program 1 times [2022-11-16 12:39:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:28,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382825001] [2022-11-16 12:39:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:28,989 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 [2022-11-16 12:39:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:28,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:28,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:29,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:39:29,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:29,212 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:29,262 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:29,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:29,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382825001] [2022-11-16 12:39:29,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382825001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:29,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:29,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:39:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936126664] [2022-11-16 12:39:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:29,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:29,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:29,278 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:29,707 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-11-16 12:39:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:29,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 12:39:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:29,709 INFO L225 Difference]: With dead ends: 71 [2022-11-16 12:39:29,709 INFO L226 Difference]: Without dead ends: 67 [2022-11-16 12:39:29,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:39:29,711 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:29,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 166 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:39:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-16 12:39:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-16 12:39:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2022-11-16 12:39:29,720 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 24 [2022-11-16 12:39:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:29,720 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2022-11-16 12:39:29,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-11-16 12:39:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:39:29,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:29,722 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:29,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:29,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:29,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1218026541, now seen corresponding path program 1 times [2022-11-16 12:39:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:29,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597723745] [2022-11-16 12:39:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:29,924 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 [2022-11-16 12:39:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:29,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:29,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:30,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:39:30,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:30,117 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:30,148 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:30,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:30,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:30,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597723745] [2022-11-16 12:39:30,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597723745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:30,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:30,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:39:30,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94841983] [2022-11-16 12:39:30,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:30,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:30,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:30,170 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:30,635 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-11-16 12:39:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:30,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 12:39:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:30,637 INFO L225 Difference]: With dead ends: 73 [2022-11-16 12:39:30,637 INFO L226 Difference]: Without dead ends: 65 [2022-11-16 12:39:30,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:39:30,638 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 171 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:30,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 171 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:39:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-16 12:39:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-11-16 12:39:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2022-11-16 12:39:30,645 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 26 [2022-11-16 12:39:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:30,646 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2022-11-16 12:39:30,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-11-16 12:39:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:39:30,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:30,647 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:30,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:30,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:30,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2052237779, now seen corresponding path program 1 times [2022-11-16 12:39:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:30,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553660458] [2022-11-16 12:39:30,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:30,862 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 [2022-11-16 12:39:30,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:30,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:30,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:39:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:30,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:39:30,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:31,024 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:31,044 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:31,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:31,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:31,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553660458] [2022-11-16 12:39:31,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553660458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:31,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:31,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:39:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090043316] [2022-11-16 12:39:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:31,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:31,060 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:31,506 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-11-16 12:39:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 12:39:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:31,510 INFO L225 Difference]: With dead ends: 73 [2022-11-16 12:39:31,510 INFO L226 Difference]: Without dead ends: 62 [2022-11-16 12:39:31,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:39:31,511 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:31,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 159 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:39:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-16 12:39:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-11-16 12:39:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2022-11-16 12:39:31,518 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 26 [2022-11-16 12:39:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:31,518 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2022-11-16 12:39:31,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2022-11-16 12:39:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:39:31,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:31,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:31,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:31,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:31,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1889276858, now seen corresponding path program 1 times [2022-11-16 12:39:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:31,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680655922] [2022-11-16 12:39:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:31,741 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 [2022-11-16 12:39:31,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:31,742 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:31,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:39:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:31,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:39:31,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:31,911 INFO L350 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 6 treesize of output 7 [2022-11-16 12:39:32,001 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:32,026 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:39:32,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:39:32,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 20 [2022-11-16 12:39:32,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:39:32,171 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:32,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:32,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:32,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-16 12:39:32,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:32,424 INFO L350 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 30 treesize of output 33 [2022-11-16 12:39:32,434 INFO L350 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 9 treesize of output 7 [2022-11-16 12:39:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:34,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:34,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680655922] [2022-11-16 12:39:34,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680655922] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:34,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:34,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-16 12:39:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899507453] [2022-11-16 12:39:34,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:34,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:39:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:39:34,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=77, Unknown=8, NotChecked=0, Total=110 [2022-11-16 12:39:34,606 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:35,918 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-11-16 12:39:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:39:35,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 12:39:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:35,920 INFO L225 Difference]: With dead ends: 72 [2022-11-16 12:39:35,920 INFO L226 Difference]: Without dead ends: 68 [2022-11-16 12:39:35,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=170, Unknown=10, NotChecked=0, Total=240 [2022-11-16 12:39:35,921 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:35,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 280 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 81 Unchecked, 1.1s Time] [2022-11-16 12:39:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-16 12:39:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-16 12:39:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2022-11-16 12:39:35,931 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 27 [2022-11-16 12:39:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:35,931 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-11-16 12:39:35,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2022-11-16 12:39:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:39:35,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:35,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:35,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:36,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:36,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2028135457, now seen corresponding path program 1 times [2022-11-16 12:39:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:36,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782353398] [2022-11-16 12:39:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:36,154 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 [2022-11-16 12:39:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:36,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:36,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:36,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:39:36,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:36,321 INFO L350 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 6 treesize of output 7 [2022-11-16 12:39:36,367 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:36,392 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:39:36,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:39:36,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 20 [2022-11-16 12:39:36,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:39:36,542 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:36,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:36,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-11-16 12:39:36,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:36,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-16 12:39:36,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:36,722 INFO L350 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 30 treesize of output 33 [2022-11-16 12:39:36,733 INFO L350 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 9 treesize of output 7 [2022-11-16 12:39:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-16 12:39:37,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:37,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782353398] [2022-11-16 12:39:37,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782353398] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:37,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:37,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-16 12:39:37,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025761932] [2022-11-16 12:39:37,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:37,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:39:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:39:37,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=67, Unknown=3, NotChecked=16, Total=110 [2022-11-16 12:39:37,117 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:38,079 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2022-11-16 12:39:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:39:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 12:39:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:38,081 INFO L225 Difference]: With dead ends: 91 [2022-11-16 12:39:38,081 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 12:39:38,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=132, Unknown=3, NotChecked=24, Total=210 [2022-11-16 12:39:38,082 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:38,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 309 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 90 Unchecked, 0.8s Time] [2022-11-16 12:39:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 12:39:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2022-11-16 12:39:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-11-16 12:39:38,103 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 27 [2022-11-16 12:39:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:38,103 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-11-16 12:39:38,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-11-16 12:39:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:39:38,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:38,105 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:38,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:38,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:38,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1224785345, now seen corresponding path program 1 times [2022-11-16 12:39:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:38,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308861516] [2022-11-16 12:39:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:38,320 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 [2022-11-16 12:39:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:38,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:38,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:39:38,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:38,509 INFO L350 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 6 treesize of output 7 [2022-11-16 12:39:38,600 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:39:38,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:39:38,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:39:38,761 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:39:38,761 INFO L350 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 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-16 12:39:38,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 12:39:38,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-16 12:39:38,868 INFO L350 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 31 treesize of output 19 [2022-11-16 12:39:38,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:39:38,913 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:38,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:39,010 INFO L350 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 79 treesize of output 57 [2022-11-16 12:39:39,027 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_258) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-11-16 12:39:39,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:39,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 12:39:39,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:39,074 INFO L350 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 36 treesize of output 35 [2022-11-16 12:39:39,083 INFO L350 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 7 treesize of output 3 [2022-11-16 12:39:39,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:39:39,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:39,132 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 12:39:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-16 12:39:39,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:39,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308861516] [2022-11-16 12:39:39,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308861516] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:39,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:39,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-11-16 12:39:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825238663] [2022-11-16 12:39:39,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:39,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:39:39,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:39:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2022-11-16 12:39:39,312 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:40,910 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2022-11-16 12:39:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:39:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 12:39:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:40,914 INFO L225 Difference]: With dead ends: 85 [2022-11-16 12:39:40,914 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 12:39:40,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=240, Unknown=1, NotChecked=32, Total=342 [2022-11-16 12:39:40,915 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 97 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:40,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 294 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 196 Invalid, 0 Unknown, 99 Unchecked, 1.3s Time] [2022-11-16 12:39:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 12:39:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-11-16 12:39:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2022-11-16 12:39:40,932 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 29 [2022-11-16 12:39:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:40,933 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2022-11-16 12:39:40,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-11-16 12:39:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 12:39:40,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:40,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:40,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:41,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:41,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1679753934, now seen corresponding path program 2 times [2022-11-16 12:39:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:41,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470585216] [2022-11-16 12:39:41,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:39:41,156 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 [2022-11-16 12:39:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:41,158 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:41,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:39:41,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:39:41,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:41,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:39:41,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:41,405 INFO L350 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 6 treesize of output 7 [2022-11-16 12:39:41,499 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:39:41,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:39:41,513 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:41,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:41,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:39:41,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:39:41,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:39:41,762 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:39:41,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:39:41,979 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:42,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:42,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_42| (_ BitVec 32)) (v_ArrVal_316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_316))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_42|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv2 32) .cse0) (= (_ bv3 32) .cse0)))) is different from false [2022-11-16 12:39:42,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_42| (_ BitVec 32)) (v_ArrVal_316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_316))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_42|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= (_ bv2 32) .cse0)))) is different from false [2022-11-16 12:39:42,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_42| (_ BitVec 32)) (v_ArrVal_316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_313)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_316))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_42| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_42|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv2 32) .cse0) (= (_ bv3 32) .cse0)))) is different from false [2022-11-16 12:39:42,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:42,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-16 12:39:42,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:42,467 INFO L350 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 267 treesize of output 273 [2022-11-16 12:39:42,492 INFO L350 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 257 treesize of output 241 [2022-11-16 12:39:42,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:39:42,822 INFO L350 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 133 treesize of output 125 [2022-11-16 12:39:43,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:43,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-11-16 12:39:43,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:43,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 263 [2022-11-16 12:39:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-16 12:39:44,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:44,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470585216] [2022-11-16 12:39:44,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470585216] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:44,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:44,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-16 12:39:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514839772] [2022-11-16 12:39:44,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 12:39:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:44,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 12:39:44,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=254, Unknown=3, NotChecked=102, Total=420 [2022-11-16 12:39:44,583 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:47,710 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2022-11-16 12:39:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:39:47,711 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 12:39:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:47,712 INFO L225 Difference]: With dead ends: 89 [2022-11-16 12:39:47,712 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 12:39:47,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=568, Unknown=3, NotChecked=156, Total=870 [2022-11-16 12:39:47,713 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:47,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 545 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 163 Invalid, 0 Unknown, 212 Unchecked, 2.1s Time] [2022-11-16 12:39:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 12:39:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2022-11-16 12:39:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2022-11-16 12:39:47,726 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 30 [2022-11-16 12:39:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:47,726 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2022-11-16 12:39:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-11-16 12:39:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 12:39:47,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:47,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:47,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:47,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:47,941 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash -900844681, now seen corresponding path program 1 times [2022-11-16 12:39:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:47,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776535889] [2022-11-16 12:39:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:47,942 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 [2022-11-16 12:39:47,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:47,944 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:47,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:48,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:39:48,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:48,168 INFO L350 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 6 treesize of output 7 [2022-11-16 12:39:48,243 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:39:48,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:39:48,258 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:48,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:39:48,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:39:48,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:39:48,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-11-16 12:39:48,502 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:39:48,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:39:48,668 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:48,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:48,884 INFO L350 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 67 treesize of output 43 [2022-11-16 12:39:48,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_378 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_378))) (store .cse1 v_arrayElimCell_57 (store (select .cse1 v_arrayElimCell_57) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= .cse0 (_ bv1 32))))) is different from false [2022-11-16 12:39:48,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_378 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_378))) (store .cse1 v_arrayElimCell_57 (store (select .cse1 v_arrayElimCell_57) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv3 32)) (= .cse0 (_ bv1 32))))) is different from false [2022-11-16 12:39:48,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_378 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_375)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_378))) (store .cse1 v_arrayElimCell_57 (store (select .cse1 v_arrayElimCell_57) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv3 32)) (= .cse0 (_ bv1 32))))) is different from false [2022-11-16 12:39:49,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:49,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-16 12:39:49,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:49,105 INFO L350 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 267 treesize of output 273 [2022-11-16 12:39:49,121 INFO L350 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 257 treesize of output 241 [2022-11-16 12:39:49,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:39:49,240 INFO L350 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 133 treesize of output 125 [2022-11-16 12:39:49,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:49,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 137 [2022-11-16 12:39:50,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:50,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 372 treesize of output 348 [2022-11-16 12:39:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 12:39:53,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:53,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776535889] [2022-11-16 12:39:53,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776535889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:53,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:53,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-16 12:39:53,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528857489] [2022-11-16 12:39:53,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:53,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 12:39:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:53,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 12:39:53,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=252, Unknown=4, NotChecked=102, Total=420 [2022-11-16 12:39:53,078 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:55,697 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2022-11-16 12:39:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:39:55,698 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 12:39:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:55,699 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:39:55,699 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 12:39:55,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=117, Invalid=491, Unknown=4, NotChecked=144, Total=756 [2022-11-16 12:39:55,700 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 58 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:55,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 587 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 257 Invalid, 0 Unknown, 254 Unchecked, 2.1s Time] [2022-11-16 12:39:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 12:39:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2022-11-16 12:39:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-11-16 12:39:55,714 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 30 [2022-11-16 12:39:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:55,714 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-11-16 12:39:55,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-11-16 12:39:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:39:55,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:55,716 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:55,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:55,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:55,930 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash 246357116, now seen corresponding path program 2 times [2022-11-16 12:39:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:55,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436253459] [2022-11-16 12:39:55,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:39:55,931 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 [2022-11-16 12:39:55,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:55,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:55,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:39:56,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:39:56,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:56,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:39:56,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:56,089 INFO L350 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 6 treesize of output 7 [2022-11-16 12:39:56,163 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:39:56,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:39:56,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:39:56,296 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:39:56,297 INFO L350 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 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-16 12:39:56,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 44 [2022-11-16 12:39:56,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 12:39:56,405 INFO L350 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 31 treesize of output 19 [2022-11-16 12:39:56,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:39:56,432 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:56,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:56,546 INFO L350 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 52 treesize of output 30 [2022-11-16 12:39:56,559 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-16 12:39:56,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:56,591 INFO L350 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 38 treesize of output 31 [2022-11-16 12:39:56,596 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:56,619 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:39:56,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-16 12:39:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-16 12:39:56,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436253459] [2022-11-16 12:39:56,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436253459] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:56,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-16 12:39:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840543956] [2022-11-16 12:39:56,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:56,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:39:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:56,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:39:56,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2022-11-16 12:39:56,811 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:58,998 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-11-16 12:39:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:39:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 12:39:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:59,000 INFO L225 Difference]: With dead ends: 94 [2022-11-16 12:39:59,000 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 12:39:59,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=403, Unknown=1, NotChecked=42, Total=552 [2022-11-16 12:39:59,001 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 115 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:59,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 409 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 268 Invalid, 0 Unknown, 97 Unchecked, 1.8s Time] [2022-11-16 12:39:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 12:39:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2022-11-16 12:39:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2022-11-16 12:39:59,021 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 31 [2022-11-16 12:39:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:59,021 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2022-11-16 12:39:59,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-11-16 12:39:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:39:59,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:59,022 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:59,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:59,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:39:59,223 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1831858052, now seen corresponding path program 1 times [2022-11-16 12:39:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:59,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223698453] [2022-11-16 12:39:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:59,224 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 [2022-11-16 12:39:59,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:59,225 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:39:59,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:39:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:59,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:39:59,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:59,393 INFO L350 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 6 treesize of output 7 [2022-11-16 12:39:59,471 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:39:59,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:39:59,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:39:59,600 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:39:59,601 INFO L350 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 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-16 12:39:59,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 44 [2022-11-16 12:39:59,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-16 12:39:59,667 INFO L350 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 31 treesize of output 19 [2022-11-16 12:39:59,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:39:59,699 INFO L350 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 15 treesize of output 7 [2022-11-16 12:39:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:59,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:59,813 INFO L350 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 52 treesize of output 30 [2022-11-16 12:39:59,827 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-16 12:39:59,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:59,860 INFO L350 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 38 treesize of output 31 [2022-11-16 12:39:59,865 INFO L350 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 11 treesize of output 7 [2022-11-16 12:39:59,887 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:39:59,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-16 12:40:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-16 12:40:00,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:40:00,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223698453] [2022-11-16 12:40:00,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223698453] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:40:00,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:40:00,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-16 12:40:00,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411138690] [2022-11-16 12:40:00,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:40:00,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:40:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:40:00,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:40:00,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2022-11-16 12:40:00,069 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:40:01,042 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2022-11-16 12:40:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:40:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-16 12:40:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:40:01,044 INFO L225 Difference]: With dead ends: 80 [2022-11-16 12:40:01,044 INFO L226 Difference]: Without dead ends: 67 [2022-11-16 12:40:01,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2022-11-16 12:40:01,045 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:40:01,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 298 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 70 Unchecked, 0.8s Time] [2022-11-16 12:40:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-16 12:40:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-16 12:40:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2022-11-16 12:40:01,054 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 31 [2022-11-16 12:40:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:40:01,054 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2022-11-16 12:40:01,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-11-16 12:40:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:40:01,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:40:01,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:40:01,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:40:01,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:40:01,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:40:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 712852397, now seen corresponding path program 3 times [2022-11-16 12:40:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:40:01,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064186847] [2022-11-16 12:40:01,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:40:01,270 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 [2022-11-16 12:40:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:40:01,271 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:40:01,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 12:40:01,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:40:01,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:40:01,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 12:40:01,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:40:01,503 INFO L350 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 6 treesize of output 7 [2022-11-16 12:40:01,585 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:40:01,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:40:01,648 INFO L350 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 [2022-11-16 12:40:01,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:40:01,728 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:40:01,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-16 12:40:01,740 INFO L350 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 15 treesize of output 7 [2022-11-16 12:40:01,756 INFO L350 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 11 treesize of output 7 [2022-11-16 12:40:01,780 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:40:01,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-16 12:40:01,949 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:40:01,950 INFO L350 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 1 case distinctions, treesize of input 125 treesize of output 116 [2022-11-16 12:40:01,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:40:01,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-16 12:40:01,968 INFO L350 Elim1Store]: Elim1 eliminated variable 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 81 treesize of output 59 [2022-11-16 12:40:02,129 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:40:02,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 86 [2022-11-16 12:40:02,194 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-16 12:40:02,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 84 [2022-11-16 12:40:02,234 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-16 12:40:02,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-11-16 12:40:02,257 INFO L350 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 27 treesize of output 11 [2022-11-16 12:40:02,279 INFO L350 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 86 treesize of output 70 [2022-11-16 12:40:02,407 INFO L350 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 46 treesize of output 30 [2022-11-16 12:40:02,990 INFO L350 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 126 treesize of output 98 [2022-11-16 12:40:03,053 INFO L321 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-16 12:40:03,054 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 83 [2022-11-16 12:40:03,439 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:40:03,440 INFO L350 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 22 treesize of output 14 [2022-11-16 12:40:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:40:03,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:40:04,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (_ BitVec 32)) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_525)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_74| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_74|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= (_ bv3 32) .cse0) (= (_ bv2 32) .cse0) (not (= (_ bv2 32) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) is different from false [2022-11-16 12:40:04,941 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-16 12:40:04,942 INFO L350 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 1963 treesize of output 1863 [2022-11-16 12:40:04,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:04,987 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1294 treesize of output 1137 [2022-11-16 12:40:08,014 INFO L350 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 8 treesize of output 4 [2022-11-16 12:40:08,127 INFO L350 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 8 treesize of output 4 [2022-11-16 12:40:08,275 INFO L350 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 8 treesize of output 4 [2022-11-16 12:40:08,399 INFO L350 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 8 treesize of output 4 [2022-11-16 12:40:08,669 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse13 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (let ((.cse1 (or .cse19 (and (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse26 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse26) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse26)))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse27 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse27)))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse28) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse28)))) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse29) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse29)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))) (.cse3 (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse25 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse25) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse25))))) (.cse4 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse24) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse24)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse5 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse23 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse23))))))))) (.cse6 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse22) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse22)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))) (.cse7 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (.cse0 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse21) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse21) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse21)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse2 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse20) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse20)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse8 (or (and (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse15 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse15)))) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse16) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse16)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse17)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) |v_ULTIMATE.start_main_~p~0#1.base_74|)))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse18) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse18))))))) .cse19)) (.cse9 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse10 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse11)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) |v_ULTIMATE.start_main_~p~0#1.base_74|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and .cse1 .cse3 .cse4 .cse5 .cse6) .cse7) .cse5 .cse6 .cse8 .cse9 .cse10 (or .cse7 (and .cse0 .cse2 .cse8 .cse9 .cse10))))) is different from false [2022-11-16 12:40:10,680 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse13 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (let ((.cse1 (or .cse19 (and (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse26 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse26) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse26)))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse27 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse27)))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse28) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse28)))) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse29) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse29)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))) (.cse3 (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse25 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse25) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse25))))) (.cse4 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse24) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse24)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse5 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse23 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse23))))))))) (.cse6 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse22) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse22)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))) (.cse7 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (.cse0 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse21) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse21) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse21)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse2 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse20) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse20)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse8 (or (and (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse15 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse15)))) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse16) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse16)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse17)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) |v_ULTIMATE.start_main_~p~0#1.base_74|)))))) (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= (_ bv0 32) .cse18) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse18))))))) .cse19)) (.cse9 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_74|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|) (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13)))))) (.cse10 (forall ((v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_74| (_ BitVec 32))) (or (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_533) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse11)))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |v_ULTIMATE.start_main_~p~0#1.base_74| v_ArrVal_532) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) |v_ULTIMATE.start_main_~p~0#1.base_74|)) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~p~0#1.base_74|))) (not (= (_ bv0 32) (select v_arrayElimArr_8 .cse13))))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and .cse1 .cse3 .cse4 .cse5 .cse6) .cse7) .cse5 .cse6 .cse8 .cse9 .cse10 (or .cse7 (and .cse0 .cse2 .cse8 .cse9 .cse10))))) is different from true [2022-11-16 12:40:11,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:11,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 12:40:11,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:11,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 12:40:11,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:11,225 INFO L350 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 269 treesize of output 250 [2022-11-16 12:40:11,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:11,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 231 [2022-11-16 12:40:11,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:11,370 INFO L350 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 70 treesize of output 69 [2022-11-16 12:40:11,390 INFO L350 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 219 treesize of output 187 [2022-11-16 12:40:11,405 INFO L350 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 54 treesize of output 46 [2022-11-16 12:40:11,421 INFO L350 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 24 treesize of output 20 [2022-11-16 12:40:11,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:11,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 12:40:11,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:11,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-16 12:40:11,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:40:12,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:12,005 INFO L350 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 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 12:40:12,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:40:12,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:12,067 INFO L350 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-16 12:40:12,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:12,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2022-11-16 12:40:12,140 INFO L350 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 7 treesize of output 3 [2022-11-16 12:40:12,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:12,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-11-16 12:40:12,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:40:12,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:12,207 INFO L350 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 1 case distinctions, treesize of input 86 treesize of output 73 [2022-11-16 12:40:12,219 INFO L350 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 34 treesize of output 22 [2022-11-16 12:40:12,262 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:40:12,272 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:40:12,291 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-16 12:40:12,310 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-16 12:40:12,324 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-16 12:40:12,333 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:40:12,345 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:40:12,359 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-11-16 12:40:12,369 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:40:12,399 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:40:12,417 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:40:12,427 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 12:40:12,446 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-11-16 12:40:12,466 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:40:12,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-16 12:40:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-16 12:40:16,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:40:16,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064186847] [2022-11-16 12:40:16,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064186847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:40:16,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:40:16,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-11-16 12:40:16,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499606878] [2022-11-16 12:40:16,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:40:16,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:40:16,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:40:16,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:40:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=436, Unknown=5, NotChecked=86, Total=600 [2022-11-16 12:40:16,902 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:40:20,496 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2022-11-16 12:40:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:40:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-16 12:40:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:40:20,498 INFO L225 Difference]: With dead ends: 81 [2022-11-16 12:40:20,499 INFO L226 Difference]: Without dead ends: 77 [2022-11-16 12:40:20,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=93, Invalid=612, Unknown=5, NotChecked=102, Total=812 [2022-11-16 12:40:20,500 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:40:20,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 464 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 224 Invalid, 0 Unknown, 260 Unchecked, 2.1s Time] [2022-11-16 12:40:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-16 12:40:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-16 12:40:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2022-11-16 12:40:20,513 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 32 [2022-11-16 12:40:20,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:40:20,514 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2022-11-16 12:40:20,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-11-16 12:40:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:40:20,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:40:20,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:40:20,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:40:20,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:40:20,729 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:40:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1737555373, now seen corresponding path program 2 times [2022-11-16 12:40:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:40:20,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805279888] [2022-11-16 12:40:20,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:40:20,730 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 [2022-11-16 12:40:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:40:20,731 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:40:20,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:40:20,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:40:20,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:40:20,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:40:20,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:40:20,920 INFO L350 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 6 treesize of output 7 [2022-11-16 12:40:21,012 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:40:21,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:40:21,032 INFO L350 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 11 treesize of output 7 [2022-11-16 12:40:21,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:40:21,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:40:21,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:40:21,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:40:21,298 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:40:21,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:40:21,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:21,374 INFO L350 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 31 treesize of output 23 [2022-11-16 12:40:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:40:21,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:40:21,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_82| (_ BitVec 32)) (v_ArrVal_591 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_82| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_82|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))) is different from false [2022-11-16 12:40:21,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_82| (_ BitVec 32)) (v_ArrVal_591 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_82| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_82|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-16 12:40:21,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_82| (_ BitVec 32)) (v_ArrVal_591 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_589)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_82| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_82|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-16 12:40:21,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:21,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2022-11-16 12:40:21,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:21,807 INFO L350 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 147 treesize of output 161 [2022-11-16 12:40:21,818 INFO L350 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 130 treesize of output 122 [2022-11-16 12:40:21,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:40:22,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:22,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-11-16 12:40:22,046 INFO L350 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 29 treesize of output 27 [2022-11-16 12:40:22,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-16 12:40:22,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:22,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2022-11-16 12:40:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-16 12:40:24,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:40:24,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805279888] [2022-11-16 12:40:24,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805279888] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:40:24,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:40:24,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-16 12:40:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588684383] [2022-11-16 12:40:24,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:40:24,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:40:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:40:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:40:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=171, Unknown=4, NotChecked=84, Total=306 [2022-11-16 12:40:24,330 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:40:26,157 INFO L93 Difference]: Finished difference Result 91 states and 121 transitions. [2022-11-16 12:40:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:40:26,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-16 12:40:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:40:26,158 INFO L225 Difference]: With dead ends: 91 [2022-11-16 12:40:26,158 INFO L226 Difference]: Without dead ends: 83 [2022-11-16 12:40:26,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=103, Invalid=367, Unknown=4, NotChecked=126, Total=600 [2022-11-16 12:40:26,159 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:40:26,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 423 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 108 Invalid, 0 Unknown, 136 Unchecked, 1.3s Time] [2022-11-16 12:40:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-16 12:40:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-11-16 12:40:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2022-11-16 12:40:26,172 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 32 [2022-11-16 12:40:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:40:26,173 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2022-11-16 12:40:26,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-11-16 12:40:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:40:26,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:40:26,174 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:40:26,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:40:26,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:40:26,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:40:26,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1349929294, now seen corresponding path program 1 times [2022-11-16 12:40:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:40:26,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134591368] [2022-11-16 12:40:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:26,380 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 [2022-11-16 12:40:26,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:40:26,382 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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) [2022-11-16 12:40:26,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7a7d249-cb8b-42ec-af43-2603e85293ac/bin/uautomizer-tPACEb0tL8/mathsat -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 [2022-11-16 12:40:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:26,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 12:40:26,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:40:26,583 INFO L350 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 6 treesize of output 7 [2022-11-16 12:40:26,704 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:40:26,704 INFO L350 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 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:40:26,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:40:26,939 INFO L350 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 11 treesize of output 7 [2022-11-16 12:40:26,984 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:40:26,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-16 12:40:27,002 INFO L350 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 7 treesize of output 3 [2022-11-16 12:40:27,043 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:40:27,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-11-16 12:40:27,094 INFO L321 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2022-11-16 12:40:27,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 12:40:27,340 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-16 12:40:27,341 INFO L350 Elim1Store]: Elim1 eliminated variable 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 1 case distinctions, treesize of input 175 treesize of output 117 [2022-11-16 12:40:27,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-16 12:40:27,363 INFO L350 Elim1Store]: Elim1 eliminated variable 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 143 treesize of output 109 [2022-11-16 12:40:27,610 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:40:27,610 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 175 [2022-11-16 12:40:27,669 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-16 12:40:27,669 INFO L350 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 2 case distinctions, treesize of input 180 treesize of output 166 [2022-11-16 12:40:27,703 INFO L350 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 85 treesize of output 66 [2022-11-16 12:40:27,991 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 12:40:27,992 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 60 [2022-11-16 12:40:28,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2022-11-16 12:40:28,270 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:40:28,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-11-16 12:40:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:40:28,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:40:29,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:29,366 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2022-11-16 12:40:29,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:29,448 INFO L350 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 629 treesize of output 632 [2022-11-16 12:40:29,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:29,482 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 541 treesize of output 494 [2022-11-16 12:40:32,013 INFO L350 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 8 treesize of output 4 [2022-11-16 12:40:32,232 INFO L350 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 8 treesize of output 4 [2022-11-16 12:40:32,469 INFO L350 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 8 treesize of output 4 [2022-11-16 12:40:32,544 INFO L350 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 30 treesize of output 22 [2022-11-16 12:40:32,611 INFO L350 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 37 treesize of output 25 [2022-11-16 12:40:34,175 INFO L350 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 49 treesize of output 37 [2022-11-16 12:40:34,258 INFO L350 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 56 treesize of output 40 [2022-11-16 12:40:34,622 INFO L350 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 62 treesize of output 46 [2022-11-16 12:40:37,630 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) .cse0) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse68 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (let ((.cse21 (and .cse68 .cse0)) (.cse29 (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select v_arrayElimArr_24 .cse1))) (let ((.cse75 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse76 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse75) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse76 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)))))) (not (= .cse76 .cse75)) (not (= (_ bv0 1) (select |c_#valid| .cse76)))))))) (.cse49 (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select v_arrayElimArr_24 .cse1))) (let ((.cse72 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse73 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse72) (not (= .cse73 .cse72)) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse73 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse74 (_ bv0 32))) (= .cse1 .cse74)))))) (not (= (_ bv0 1) (select |c_#valid| .cse73)))))))) (.cse20 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse25 (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse71 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse71 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse71 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse71)))))))) (and (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse2 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse2 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse2) (not (= (_ bv0 1) (select |c_#valid| .cse2)))))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_24 .cse1))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse5 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse5) (not (= (_ bv0 1) (select |c_#valid| .cse5))))))) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse6 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse6 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse7 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse7)))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse6) (not (= (_ bv0 1) (select |c_#valid| .cse6)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_24 .cse1))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse8 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse8 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse9) (not (= .cse8 .cse9)) (not (= (_ bv0 1) (select |c_#valid| .cse8))))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_24 .cse1))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse12 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse12 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse10 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse11) (not (= .cse12 .cse11)) (= .cse1 .cse10) (not (= (_ bv0 1) (select |c_#valid| .cse12))))))) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse13 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse13) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse13 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse13)))))) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_24 .cse1))) (or (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse14 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse14 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse14) (not (= (_ bv0 1) (select |c_#valid| .cse14)))))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_24 .cse1))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse17 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse17 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse15 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= .cse1 .cse15)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse16) (not (= .cse17 .cse16)) (not (= (_ bv0 1) (select |c_#valid| .cse17))))))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_24 .cse1))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse19 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse18) (not (= (_ bv0 1) (select |c_#valid| .cse19))))))) .cse20) (or .cse21 (and (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse22 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse22 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse22) (not (= (_ bv0 1) (select |c_#valid| .cse22)))))) (or .cse20 (and (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse23 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse23 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse23)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_185 (_ BitVec 32))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) v_arrayElimCell_185 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= (select |c_#valid| v_arrayElimCell_185) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse24)))) .cse25)) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse26 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse26 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse27) (not (= .cse27 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse26) (not (= (_ bv0 1) (select |c_#valid| .cse26)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_186 (_ BitVec 32))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) v_arrayElimCell_186 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) (= v_arrayElimCell_186 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_186)))))))) .cse29 (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select v_arrayElimArr_24 .cse1))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse32 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse32 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse30 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse31) (not (= .cse32 .cse31)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse30) (not (= (_ bv0 1) (select |c_#valid| .cse32))))))) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse34 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= .cse1 .cse33) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse33)))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse34 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse34) (not (= (_ bv0 1) (select |c_#valid| .cse34)))))) (or (and (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (select v_arrayElimArr_24 .cse1))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse35 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse35 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse36) (not (= .cse35 .cse36)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse35) (not (= (_ bv0 1) (select |c_#valid| .cse35))))))))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_24 .cse1))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse37 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse37 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse38) (not (= .cse37 .cse38)) (not (= (_ bv0 1) (select |c_#valid| .cse37))))))) .cse20) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_24 .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse39 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse39) (not (= (_ bv0 1) (select |c_#valid| .cse39)))))) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) v_arrayElimCell_187 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse40 .cse1) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_187))) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|) (= v_arrayElimCell_187 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select v_arrayElimArr_24 .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse41 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| .cse41)))))) .cse20) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_24 .cse1))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse43 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse42 (_ bv0 32))) (not (= .cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse43 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse43) (= .cse1 .cse42) (not (= (_ bv0 1) (select |c_#valid| .cse43))))))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select v_arrayElimArr_24 .cse1))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse45 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse44 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= .cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse45 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= .cse1 .cse44) (not (= (_ bv0 1) (select |c_#valid| .cse45))))))) .cse20) (or .cse20 (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_187 (_ BitVec 32))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) v_arrayElimCell_187 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= .cse46 .cse1) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_187))) (= .cse46 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse21) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select v_arrayElimArr_24 .cse1))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse47 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse47 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= .cse1 .cse48) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse48) (not (= (_ bv0 1) (select |c_#valid| .cse47))))))) .cse20) .cse49 (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_24 .cse1))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse50 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse50 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| .cse50)))))) .cse20) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_24 .cse1))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse51 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse51 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse51) (= .cse1 .cse52) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse52) (not (= (_ bv0 1) (select |c_#valid| .cse51))))))))) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select v_arrayElimArr_24 .cse1))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse53 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse53) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse53 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| .cse53)))))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select v_arrayElimArr_24 .cse1))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse54 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse54 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| .cse54)))))) .cse20) (or .cse20 (and (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse56 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse55 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse55)))) (not (= (_ bv0 1) (select |c_#valid| .cse56))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse56 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse57) (not (= .cse56 .cse57)))))))) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse58 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse58 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (_ bv0 1) (select |c_#valid| .cse58)))))) .cse29 (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse60 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse59 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= .cse1 .cse59))))) (not (= (_ bv0 1) (select |c_#valid| .cse60))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse60 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse61) (not (= .cse60 .cse61)))))))) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse63 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= .cse1 .cse62) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse62)))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse63 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (_ bv0 1) (select |c_#valid| .cse63)))))) .cse49 (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse64 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse64 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (_ bv0 1) (select |c_#valid| .cse64)))))))) (or (and (or .cse20 (and .cse25 (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse65 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (_ bv0 1) (select |c_#valid| .cse65)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_183 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) v_arrayElimCell_183 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select |c_#valid| v_arrayElimCell_183) (_ bv0 1))))))) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse66 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse66) (not (= (_ bv0 1) (select |c_#valid| .cse66)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_184 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (= v_arrayElimCell_184 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) v_arrayElimCell_184 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_184))))) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse67 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse67 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse67) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse67 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse67))))))) (not .cse0) (not .cse68)) (forall ((v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select v_arrayElimArr_24 .cse1))) (or (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse70 v_ArrVal_662) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse69 (_ bv0 32))) (not (= (select v_arrayElimArr_25 .cse1) (_ bv0 32))) (not (= .cse1 .cse69))))) (forall ((v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse70 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse70 v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse70) (not (= (_ bv0 1) (select |c_#valid| .cse70)))))))))))) is different from true [2022-11-16 12:40:46,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:40:46,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 5374 treesize of output 4845 [2022-11-16 12:41:03,525 WARN L233 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 12:41:03,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:03,530 INFO L350 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 12718 treesize of output 8493 [2022-11-16 12:41:03,894 INFO L350 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 7876 treesize of output 7860 [2022-11-16 12:41:16,270 WARN L233 SmtUtils]: Spent 12.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 12:41:16,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:16,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7860 treesize of output 7849 [2022-11-16 12:41:16,413 INFO L350 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 7840 treesize of output 7808 [2022-11-16 12:41:17,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:17,237 INFO L350 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 12903 treesize of output 12464 [2022-11-16 12:41:18,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:18,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11960 treesize of output 11821 [2022-11-16 12:41:18,230 INFO L350 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 11812 treesize of output 11780 [2022-11-16 12:41:18,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:18,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11780 treesize of output 11697 [2022-11-16 12:41:18,874 INFO L350 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 11688 treesize of output 11672 [2022-11-16 12:41:19,005 INFO L350 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 11672 treesize of output 11656 [2022-11-16 12:41:19,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:19,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11656 treesize of output 11653 [2022-11-16 12:41:19,806 INFO L350 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 11644 treesize of output 11636 [2022-11-16 12:41:20,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:20,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11636 treesize of output 11633 [2022-11-16 12:41:20,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:20,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11624 treesize of output 11625 [2022-11-16 12:41:21,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:21,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11616 treesize of output 11585 [2022-11-16 12:41:21,485 INFO L350 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 11576 treesize of output 11568 [2022-11-16 12:41:21,631 INFO L350 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 11568 treesize of output 11560 [2022-11-16 12:41:22,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:22,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11560 treesize of output 11529 [2022-11-16 12:41:22,309 INFO L350 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 11520 treesize of output 11512 [2022-11-16 12:41:22,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:22,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11512 treesize of output 11513 [2022-11-16 12:41:23,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:23,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11504 treesize of output 11501 [2022-11-16 12:41:23,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:23,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11492 treesize of output 11377 [2022-11-16 12:41:24,103 INFO L350 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 11368 treesize of output 11336 [2022-11-16 12:41:24,280 INFO L350 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 11336 treesize of output 11320 [2022-11-16 12:41:24,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:24,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11320 treesize of output 11317 [2022-11-16 12:41:24,959 INFO L350 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 11308 treesize of output 11292 [2022-11-16 12:41:25,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:25,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11292 treesize of output 11233 [2022-11-16 12:41:26,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:26,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11224 treesize of output 11141 [2022-11-16 12:41:26,252 INFO L350 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 11132 treesize of output 11116 [2022-11-16 12:41:26,468 INFO L350 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 11116 treesize of output 11100 [2022-11-16 12:41:26,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:26,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11100 treesize of output 11049 [2022-11-16 12:41:27,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:27,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11040 treesize of output 11029 [2022-11-16 12:41:28,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:28,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11020 treesize of output 10897 [2022-11-16 12:41:28,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:28,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10888 treesize of output 10885 [2022-11-16 12:41:29,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:29,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10876 treesize of output 10857 [2022-11-16 12:41:29,550 INFO L350 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 10848 treesize of output 10816 [2022-11-16 12:41:30,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:30,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10816 treesize of output 10805 [2022-11-16 12:41:30,455 INFO L350 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 10796 treesize of output 10780 [2022-11-16 12:41:30,717 INFO L350 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 10780 treesize of output 10772 [2022-11-16 12:41:31,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:31,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10772 treesize of output 10769 [2022-11-16 12:41:31,588 INFO L350 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 10760 treesize of output 10728 [2022-11-16 12:41:32,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:32,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10728 treesize of output 10661 [2022-11-16 12:41:32,562 INFO L350 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 10652 treesize of output 10644 [2022-11-16 12:41:32,797 INFO L350 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 10644 treesize of output 10612 [2022-11-16 12:41:33,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:33,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10612 treesize of output 10601 [2022-11-16 12:41:33,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:33,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10592 treesize of output 10493 [2022-11-16 12:41:34,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:34,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10484 treesize of output 10417 [2022-11-16 12:41:35,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:35,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10408 treesize of output 10373 [2022-11-16 12:41:35,742 INFO L350 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 10364 treesize of output 10348 [2022-11-16 12:41:36,099 INFO L350 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 10348 treesize of output 10332 [2022-11-16 12:41:36,418 INFO L350 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 10332 treesize of output 10324 [2022-11-16 12:41:36,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:36,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10324 treesize of output 10249 [2022-11-16 12:41:37,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:37,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10240 treesize of output 10157 [2022-11-16 12:41:37,997 INFO L350 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 10148 treesize of output 10140 [2022-11-16 12:41:38,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:38,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10140 treesize of output 10141 [2022-11-16 12:41:39,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:39,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10132 treesize of output 10113 [2022-11-16 12:41:39,651 INFO L350 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 10104 treesize of output 10096 [2022-11-16 12:41:40,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:40,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10096 treesize of output 10097 [2022-11-16 12:41:41,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:41,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10088 treesize of output 10037 [2022-11-16 12:41:41,397 INFO L350 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 10028 treesize of output 10012 [2022-11-16 12:41:42,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:42,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10012 treesize of output 10009 [2022-11-16 12:41:42,484 INFO L350 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 10000 treesize of output 9992 [2022-11-16 12:41:43,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:43,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9992 treesize of output 9957 [2022-11-16 12:41:43,683 INFO L350 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 9948 treesize of output 9940 [2022-11-16 12:41:44,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:44,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9940 treesize of output 9941 [2022-11-16 12:41:44,711 INFO L350 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 9932 treesize of output 9924 [2022-11-16 12:41:45,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:45,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9924 treesize of output 9921 [2022-11-16 12:41:45,695 INFO L350 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 9912 treesize of output 9896 [2022-11-16 12:41:46,089 INFO L350 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 9896 treesize of output 9888 [2022-11-16 12:41:46,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:46,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9888 treesize of output 9841 [2022-11-16 12:41:47,346 INFO L350 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 9832 treesize of output 9824 [2022-11-16 12:41:47,654 INFO L350 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 9824 treesize of output 9816 [2022-11-16 12:41:47,976 INFO L350 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 9816 treesize of output 9800 [2022-11-16 12:41:48,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:48,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9800 treesize of output 9801 [2022-11-16 12:41:49,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:49,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9792 treesize of output 9789 [2022-11-16 12:41:49,802 INFO L350 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 9780 treesize of output 9764 [2022-11-16 12:41:50,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:50,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9764 treesize of output 9725 [2022-11-16 12:41:50,795 INFO L350 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 9716 treesize of output 9708 [2022-11-16 12:41:51,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:51,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9708 treesize of output 9669 [2022-11-16 12:41:52,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:52,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9660 treesize of output 9577 [2022-11-16 12:41:52,652 INFO L350 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 9568 treesize of output 9552 [2022-11-16 12:41:53,017 INFO L350 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 9552 treesize of output 9536 [2022-11-16 12:41:53,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:53,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9536 treesize of output 9533 [2022-11-16 12:41:54,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:54,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9524 treesize of output 9521 [2022-11-16 12:41:54,856 INFO L350 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 9512 treesize of output 9496 [2022-11-16 12:41:55,244 INFO L350 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 9496 treesize of output 9488 [2022-11-16 12:41:55,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:55,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9488 treesize of output 9489 [2022-11-16 12:41:56,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:56,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9480 treesize of output 9461 [2022-11-16 12:41:57,263 INFO L350 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 9452 treesize of output 9420 [2022-11-16 12:41:57,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:57,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9420 treesize of output 9357 [2022-11-16 12:41:58,439 INFO L350 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 9348 treesize of output 9340 [2022-11-16 12:41:58,802 INFO L350 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 9340 treesize of output 9324 [2022-11-16 12:41:59,191 INFO L350 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 9324 treesize of output 9316 [2022-11-16 12:41:59,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:59,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9316 treesize of output 9317 [2022-11-16 12:42:00,354 INFO L350 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 9308 treesize of output 9300 [2022-11-16 12:42:01,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:01,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9300 treesize of output 9285 [2022-11-16 12:42:01,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:01,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9276 treesize of output 9273 [2022-11-16 12:42:02,268 INFO L350 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 9264 treesize of output 9248 [2022-11-16 12:42:02,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:02,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9248 treesize of output 9245 [2022-11-16 12:42:03,321 INFO L350 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 9236 treesize of output 9220 [2022-11-16 12:42:03,703 INFO L350 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 9220 treesize of output 9188 [2022-11-16 12:42:04,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:04,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9188 treesize of output 9185 [2022-11-16 12:42:05,001 INFO L350 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 9176 treesize of output 9160 [2022-11-16 12:42:05,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:05,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9160 treesize of output 9109 [2022-11-16 12:42:06,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:06,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9100 treesize of output 9097 [2022-11-16 12:42:07,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:07,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9088 treesize of output 9089 [2022-11-16 12:42:07,773 INFO L350 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 9080 treesize of output 9064 [2022-11-16 12:42:08,189 INFO L350 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 9064 treesize of output 9056 [2022-11-16 12:42:09,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:09,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9056 treesize of output 9017 [2022-11-16 12:42:09,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:09,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9008 treesize of output 8997 [2022-11-16 12:42:10,221 INFO L350 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 8988 treesize of output 8956 [2022-11-16 12:42:11,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:11,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8956 treesize of output 8817 [2022-11-16 12:42:11,607 INFO L350 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 8808 treesize of output 8776 [2022-11-16 12:42:12,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:12,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8776 treesize of output 8777 [2022-11-16 12:42:12,995 INFO L350 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 8768 treesize of output 8752 [2022-11-16 12:42:13,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:13,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8752 treesize of output 8749 [2022-11-16 12:42:14,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:14,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8740 treesize of output 8701 [2022-11-16 12:42:15,347 INFO L350 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 8692 treesize of output 8684 [2022-11-16 12:42:15,970 INFO L350 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 8684 treesize of output 8652 [2022-11-16 12:42:16,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:16,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8652 treesize of output 8641 [2022-11-16 12:42:17,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:17,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8632 treesize of output 8629 [2022-11-16 12:42:18,557 INFO L350 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 8620 treesize of output 8604 [2022-11-16 12:42:19,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:19,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8604 treesize of output 8601 [2022-11-16 12:42:20,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:20,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8592 treesize of output 8593 [2022-11-16 12:42:21,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:21,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8584 treesize of output 8577 [2022-11-16 12:42:22,292 INFO L350 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 8568 treesize of output 8552 [2022-11-16 12:42:23,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:23,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8552 treesize of output 8465 [2022-11-16 12:42:23,953 INFO L350 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 8456 treesize of output 8440 [2022-11-16 12:42:24,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:24,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8440 treesize of output 8325 [2022-11-16 12:42:25,642 INFO L350 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 8316 treesize of output 8284 [2022-11-16 12:42:26,306 INFO L350 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 8284 treesize of output 8276 [2022-11-16 12:42:27,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:27,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8276 treesize of output 8269 [2022-11-16 12:42:28,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:28,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8260 treesize of output 8189 [2022-11-16 12:42:29,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:29,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8180 treesize of output 8181 [2022-11-16 12:42:29,752 INFO L350 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 8172 treesize of output 8164 [2022-11-16 12:42:30,450 INFO L350 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 8164 treesize of output 8148 [2022-11-16 12:42:31,037 INFO L350 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 8148 treesize of output 8140 [2022-11-16 12:42:31,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:31,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8140 treesize of output 8121 [2022-11-16 12:42:32,549 INFO L350 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 8112 treesize of output 8096 [2022-11-16 12:42:33,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:33,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8096 treesize of output 8093 [2022-11-16 12:42:34,081 INFO L350 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 8084 treesize of output 8068 [2022-11-16 12:42:35,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:35,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8068 treesize of output 8057 [2022-11-16 12:42:36,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:36,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8048 treesize of output 7969 [2022-11-16 12:42:36,805 INFO L350 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 7960 treesize of output 7952 [2022-11-16 12:42:37,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:37,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7952 treesize of output 7937 [2022-11-16 12:42:38,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:38,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7928 treesize of output 7925 [2022-11-16 12:42:39,388 INFO L350 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 7916 treesize of output 7900 [2022-11-16 12:42:39,918 INFO L350 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 7900 treesize of output 7884 [2022-11-16 12:42:40,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:40,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7884 treesize of output 7797 [2022-11-16 12:42:41,466 INFO L350 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 7788 treesize of output 7772 [2022-11-16 12:42:42,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:42,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7772 treesize of output 7657 [2022-11-16 12:42:43,293 INFO L350 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 7648 treesize of output 7616 [2022-11-16 12:42:43,890 INFO L350 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 7616 treesize of output 7608 [2022-11-16 12:42:44,517 INFO L350 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 7608 treesize of output 7600 [2022-11-16 12:42:45,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:42:45,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7600 treesize of output 7601