./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN --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 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 --- 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-6b4ec56 [2022-11-20 12:25:27,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:25:27,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:25:27,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:25:27,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:25:27,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:25:27,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:25:27,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:25:27,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:25:27,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:25:27,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:25:27,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:25:27,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:25:27,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:25:27,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:25:27,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:25:27,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:25:27,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:25:27,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:25:27,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:25:27,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:25:27,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:25:27,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:25:27,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:25:27,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:25:27,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:25:27,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:25:27,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:25:27,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:25:27,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:25:27,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:25:27,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:25:27,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:25:27,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:25:27,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:25:27,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:25:27,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:25:27,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:25:27,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:25:27,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:25:27,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:25:27,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:25:27,919 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:25:27,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:25:27,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:25:27,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:25:27,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:25:27,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:25:27,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:25:27,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:25:27,927 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:25:27,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:25:27,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:25:27,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:25:27,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:25:27,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:25:27,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:25:27,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:25:27,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:25:27,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:25:27,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:25:27,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:25:27,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:25:27,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:25:27,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:25:27,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:25:27,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:25:27,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:25:27,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:25:27,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:25:27,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:25:27,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:25:27,936 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:25:27,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:25:27,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:25:27,937 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_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/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_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN 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 -> 503513a726b63dcf7252b591818901fbaab844b1443a8550e123aa98a06238f6 [2022-11-20 12:25:28,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:25:28,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:25:28,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:25:28,410 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:25:28,410 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:25:28,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-fpi/sina5.c [2022-11-20 12:25:32,115 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:25:32,389 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:25:32,390 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/sv-benchmarks/c/array-fpi/sina5.c [2022-11-20 12:25:32,397 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/data/b3a614458/d8e18a447a4741dd905e0f04dd8e14db/FLAG5bfb96c0a [2022-11-20 12:25:32,415 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/data/b3a614458/d8e18a447a4741dd905e0f04dd8e14db [2022-11-20 12:25:32,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:25:32,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:25:32,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:25:32,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:25:32,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:25:32,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450ef5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32, skipping insertion in model container [2022-11-20 12:25:32,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:25:32,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:25:32,626 WARN L237 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_fac4e049-dc44-4115-9e45-2ada88e45b56/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2022-11-20 12:25:32,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:25:32,667 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:25:32,682 WARN L237 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_fac4e049-dc44-4115-9e45-2ada88e45b56/sv-benchmarks/c/array-fpi/sina5.c[588,601] [2022-11-20 12:25:32,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:25:32,713 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:25:32,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32 WrapperNode [2022-11-20 12:25:32,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:25:32,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:25:32,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:25:32,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:25:32,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,755 INFO L138 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-11-20 12:25:32,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:25:32,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:25:32,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:25:32,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:25:32,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:25:32,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:25:32,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:25:32,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:25:32,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (1/1) ... [2022-11-20 12:25:32,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:25:32,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:25:32,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:25:32,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:25:32,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:25:32,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:25:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:25:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:25:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:25:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:25:32,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:25:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:25:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:25:32,991 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:25:32,994 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:25:33,226 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:25:33,236 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:25:33,236 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 12:25:33,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:25:33 BoogieIcfgContainer [2022-11-20 12:25:33,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:25:33,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:25:33,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:25:33,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:25:33,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:25:32" (1/3) ... [2022-11-20 12:25:33,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d97bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:25:33, skipping insertion in model container [2022-11-20 12:25:33,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:25:32" (2/3) ... [2022-11-20 12:25:33,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d97bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:25:33, skipping insertion in model container [2022-11-20 12:25:33,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:25:33" (3/3) ... [2022-11-20 12:25:33,250 INFO L112 eAbstractionObserver]: Analyzing ICFG sina5.c [2022-11-20 12:25:33,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:25:33,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:25:33,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:25:33,403 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;@555c9d19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:25:33,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:25:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 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-20 12:25:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:25:33,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:33,418 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-20 12:25:33,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:25:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash -635308358, now seen corresponding path program 1 times [2022-11-20 12:25:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:33,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946454925] [2022-11-20 12:25:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:33,679 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-20 12:25:33,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:33,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946454925] [2022-11-20 12:25:33,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946454925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:33,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:33,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:25:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569834077] [2022-11-20 12:25:33,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:33,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:25:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:33,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:25:33,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:25:33,751 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 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) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 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-20 12:25:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:33,797 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2022-11-20 12:25:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:25:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 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-20 12:25:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:33,809 INFO L225 Difference]: With dead ends: 56 [2022-11-20 12:25:33,810 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 12:25:33,818 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-20 12:25:33,824 INFO L413 NwaCegarLoop]: 36 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, 36 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-20 12:25:33,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:25:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 12:25:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-20 12:25:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-20 12:25:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-20 12:25:33,857 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-11-20 12:25:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:33,858 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-20 12:25:33,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 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-20 12:25:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-20 12:25:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:25:33,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:33,860 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-20 12:25:33,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:25:33,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:25:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1344199344, now seen corresponding path program 1 times [2022-11-20 12:25:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:33,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823344876] [2022-11-20 12:25:33,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:33,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:34,132 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-20 12:25:34,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:34,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823344876] [2022-11-20 12:25:34,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823344876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:25:34,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:25:34,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:25:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127863757] [2022-11-20 12:25:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:25:34,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:25:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:25:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:25:34,137 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-20 12:25:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:34,259 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-11-20 12:25:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:25:34,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-20 12:25:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:34,261 INFO L225 Difference]: With dead ends: 61 [2022-11-20 12:25:34,261 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 12:25:34,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:25:34,263 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:34,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 18 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:25:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 12:25:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-20 12:25:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-20 12:25:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-20 12:25:34,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2022-11-20 12:25:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:34,286 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-20 12:25:34,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-20 12:25:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-20 12:25:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 12:25:34,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:34,288 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] [2022-11-20 12:25:34,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:25:34,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:25:34,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:34,290 INFO L85 PathProgramCache]: Analyzing trace with hash -933126362, now seen corresponding path program 1 times [2022-11-20 12:25:34,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:34,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316983497] [2022-11-20 12:25:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:34,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:37,547 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-20 12:25:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:37,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316983497] [2022-11-20 12:25:37,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316983497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:25:37,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519260119] [2022-11-20 12:25:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:37,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:25:37,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:25:37,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:25:37,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:25:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:37,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 12:25:37,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:37,951 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-20 12:25:37,974 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:25:37,975 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 23 treesize of output 19 [2022-11-20 12:25:38,107 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 23 treesize of output 22 [2022-11-20 12:25:38,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-20 12:25:38,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-20 12:25:38,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-20 12:25:39,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-11-20 12:25:39,607 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-20 12:25:39,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:25:40,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:40,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:40,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:40,856 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-20 12:25:40,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519260119] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:25:40,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:25:40,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 44 [2022-11-20 12:25:40,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432200743] [2022-11-20 12:25:40,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:25:40,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-20 12:25:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-20 12:25:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1623, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 12:25:40,861 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 44 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 44 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-20 12:25:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:43,013 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-11-20 12:25:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 12:25:43,014 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 44 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) Word has length 28 [2022-11-20 12:25:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:43,016 INFO L225 Difference]: With dead ends: 64 [2022-11-20 12:25:43,016 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 12:25:43,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=478, Invalid=2714, Unknown=0, NotChecked=0, Total=3192 [2022-11-20 12:25:43,019 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 103 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:43,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 119 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 426 Invalid, 0 Unknown, 44 Unchecked, 0.7s Time] [2022-11-20 12:25:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 12:25:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-11-20 12:25:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 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-20 12:25:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-11-20 12:25:43,035 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 28 [2022-11-20 12:25:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:43,035 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-11-20 12:25:43,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 44 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-20 12:25:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-11-20 12:25:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 12:25:43,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:43,038 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] [2022-11-20 12:25:43,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:25:43,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:25:43,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:25:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1642466588, now seen corresponding path program 2 times [2022-11-20 12:25:43,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:43,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201417096] [2022-11-20 12:25:43,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:43,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:25:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201417096] [2022-11-20 12:25:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201417096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:25:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745960095] [2022-11-20 12:25:43,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:25:43,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:25:43,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:25:43,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:25:43,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:25:43,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:25:43,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:43,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:25:43,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:25:43,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:25:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:25:43,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745960095] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:25:43,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:25:43,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 12:25:43,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158643602] [2022-11-20 12:25:43,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:25:43,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:25:43,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:25:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:25:43,702 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-20 12:25:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:43,979 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2022-11-20 12:25:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:25:43,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-20 12:25:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:43,981 INFO L225 Difference]: With dead ends: 134 [2022-11-20 12:25:43,982 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 12:25:43,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:25:43,984 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 84 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:43,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:25:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 12:25:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-11-20 12:25:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 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-20 12:25:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-20 12:25:43,999 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 30 [2022-11-20 12:25:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:43,999 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-20 12:25:44,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-20 12:25:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-20 12:25:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 12:25:44,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:44,002 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] [2022-11-20 12:25:44,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:25:44,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:25:44,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:25:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -396360796, now seen corresponding path program 3 times [2022-11-20 12:25:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:44,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120694799] [2022-11-20 12:25:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:25:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:44,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120694799] [2022-11-20 12:25:44,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120694799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:25:44,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005766549] [2022-11-20 12:25:44,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:25:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:25:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:25:44,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:25:44,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:25:44,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 12:25:44,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:44,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:25:44,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:25:44,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:25:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:25:44,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005766549] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:25:44,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:25:44,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 12:25:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180938188] [2022-11-20 12:25:44,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:25:44,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:25:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:25:44,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:25:44,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:25:44,637 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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-20 12:25:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:25:44,906 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-11-20 12:25:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:25:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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-20 12:25:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:25:44,908 INFO L225 Difference]: With dead ends: 74 [2022-11-20 12:25:44,908 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 12:25:44,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:25:44,909 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 108 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:25:44,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 48 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:25:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 12:25:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2022-11-20 12:25:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 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-20 12:25:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-11-20 12:25:44,932 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2022-11-20 12:25:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:25:44,932 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-11-20 12:25:44,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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-20 12:25:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-11-20 12:25:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 12:25:44,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:25:44,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:25:44,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:25:45,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:25:45,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:25:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:25:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 389318684, now seen corresponding path program 4 times [2022-11-20 12:25:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:25:45,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23431516] [2022-11-20 12:25:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:25:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:25:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:25:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:25:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:25:49,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23431516] [2022-11-20 12:25:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23431516] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:25:49,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214487893] [2022-11-20 12:25:49,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:25:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:25:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:25:49,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:25:49,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:25:50,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:25:50,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:25:50,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 12:25:50,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:25:50,141 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 10 treesize of output 8 [2022-11-20 12:25:50,159 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-20 12:25:50,266 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 23 treesize of output 22 [2022-11-20 12:25:50,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 12:25:51,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:51,204 INFO L321 Elim1Store]: treesize reduction 91, result has 20.9 percent of original size [2022-11-20 12:25:51,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2022-11-20 12:25:51,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:51,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:51,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:51,607 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-20 12:25:51,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 66 [2022-11-20 12:25:52,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:52,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:52,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:52,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:52,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:52,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:52,540 INFO L321 Elim1Store]: treesize reduction 92, result has 17.9 percent of original size [2022-11-20 12:25:52,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 72 treesize of output 71 [2022-11-20 12:25:53,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:53,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:53,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:53,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:53,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:53,017 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-20 12:25:53,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 64 [2022-11-20 12:25:53,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:53,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:53,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:53,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:53,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:53,627 INFO L321 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2022-11-20 12:25:53,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 70 [2022-11-20 12:25:54,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:54,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:54,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:54,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:54,086 INFO L321 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2022-11-20 12:25:54,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 68 [2022-11-20 12:25:54,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:54,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:54,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:54,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:54,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:54,682 INFO L321 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2022-11-20 12:25:54,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 94 treesize of output 85 [2022-11-20 12:25:55,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:25:55,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:25:55,837 INFO L321 Elim1Store]: treesize reduction 370, result has 26.0 percent of original size [2022-11-20 12:25:55,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 155 treesize of output 225 [2022-11-20 12:26:06,828 INFO L321 Elim1Store]: treesize reduction 42, result has 63.5 percent of original size [2022-11-20 12:26:06,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 135 treesize of output 151 [2022-11-20 12:26:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:26:07,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:26:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:26:17,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214487893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:26:17,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:26:17,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 79 [2022-11-20 12:26:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790442216] [2022-11-20 12:26:17,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:26:17,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-20 12:26:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:26:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-20 12:26:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=5568, Unknown=0, NotChecked=0, Total=6162 [2022-11-20 12:26:17,309 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 79 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 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-20 12:27:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:27:04,663 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2022-11-20 12:27:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-20 12:27:04,665 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 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 38 [2022-11-20 12:27:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:27:04,667 INFO L225 Difference]: With dead ends: 114 [2022-11-20 12:27:04,668 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 12:27:04,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3618 ImplicationChecksByTransitivity, 60.9s TimeCoverageRelationStatistics Valid=1140, Invalid=9990, Unknown=0, NotChecked=0, Total=11130 [2022-11-20 12:27:04,674 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:27:04,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 349 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 457 Invalid, 0 Unknown, 212 Unchecked, 3.4s Time] [2022-11-20 12:27:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 12:27:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-11-20 12:27:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1818181818181819) internal successors, (117), 99 states have internal predecessors, (117), 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-20 12:27:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2022-11-20 12:27:04,709 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 38 [2022-11-20 12:27:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:27:04,710 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2022-11-20 12:27:04,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 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-20 12:27:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2022-11-20 12:27:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:27:04,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:27:04,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:27:04,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:27:04,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:27:04,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:27:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:27:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1666934362, now seen corresponding path program 5 times [2022-11-20 12:27:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:27:04,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153426944] [2022-11-20 12:27:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:27:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:27:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:27:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:27:05,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:27:05,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153426944] [2022-11-20 12:27:05,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153426944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:27:05,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822076464] [2022-11-20 12:27:05,129 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 12:27:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:27:05,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:27:05,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:27:05,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:27:05,425 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 12:27:05,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:27:05,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:27:05,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:27:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:27:05,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:27:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:27:05,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822076464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:27:05,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:27:05,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-20 12:27:05,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990932037] [2022-11-20 12:27:05,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:27:05,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 12:27:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:27:05,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 12:27:05,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:27:05,687 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 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-20 12:27:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:27:06,506 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2022-11-20 12:27:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:27:06,507 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 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) Word has length 40 [2022-11-20 12:27:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:27:06,508 INFO L225 Difference]: With dead ends: 171 [2022-11-20 12:27:06,508 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 12:27:06,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 12:27:06,509 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 357 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:27:06,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 162 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:27:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 12:27:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 82. [2022-11-20 12:27:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 81 states have internal predecessors, (88), 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-20 12:27:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-20 12:27:06,553 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 40 [2022-11-20 12:27:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:27:06,556 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-20 12:27:06,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 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-20 12:27:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-20 12:27:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:27:06,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:27:06,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:27:06,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 12:27:06,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:27:06,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:27:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:27:06,770 INFO L85 PathProgramCache]: Analyzing trace with hash -465930606, now seen corresponding path program 1 times [2022-11-20 12:27:06,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:27:06,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918840823] [2022-11-20 12:27:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:27:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:27:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:27:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:27:13,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:27:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918840823] [2022-11-20 12:27:13,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918840823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:27:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298583501] [2022-11-20 12:27:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:27:13,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:27:13,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:27:13,606 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:27:13,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:27:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:27:13,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 12:27:13,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:27:13,908 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:27:13,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 54 treesize of output 50 [2022-11-20 12:27:14,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 12:27:14,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:27:14,224 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 21 treesize of output 20 [2022-11-20 12:27:14,389 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 23 treesize of output 23 [2022-11-20 12:27:14,434 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 23 treesize of output 23 [2022-11-20 12:27:14,599 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 23 treesize of output 23 [2022-11-20 12:27:14,638 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 23 treesize of output 23 [2022-11-20 12:27:14,714 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 23 treesize of output 23 [2022-11-20 12:27:14,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:27:14,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 12:27:14,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:27:14,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:27:14,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-20 12:27:15,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:27:15,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-11-20 12:27:16,022 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 0 case distinctions, treesize of input 77 treesize of output 49 [2022-11-20 12:27:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 12:27:16,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:28:04,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:28:04,415 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 78 treesize of output 69 [2022-11-20 12:28:04,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* c_~N~0 2) 1))) (or (= (+ (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2) (not (= (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2)))))) is different from false [2022-11-20 12:28:04,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* c_~N~0 2) 1))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2) (not (= (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2)))))) is different from false [2022-11-20 12:28:04,647 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* c_~N~0 2) 1))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2) (not (= (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2)))))) is different from false [2022-11-20 12:28:05,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_394 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ (* c_~N~0 2) 1))) (or (= .cse0 (+ (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (not (= (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse0)))))) is different from false [2022-11-20 12:28:05,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:28:05,152 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 152 treesize of output 97 [2022-11-20 12:28:05,172 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 669 treesize of output 649 [2022-11-20 12:28:05,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:28:05,207 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 426 treesize of output 412 [2022-11-20 12:28:05,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:28:05,240 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 656 treesize of output 578 [2022-11-20 12:28:05,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:28:05,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 601 treesize of output 641 [2022-11-20 12:28:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 9 not checked. [2022-11-20 12:28:06,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298583501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:28:06,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:28:06,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 18, 18] total 65 [2022-11-20 12:28:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845980276] [2022-11-20 12:28:06,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:28:06,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 12:28:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:28:06,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 12:28:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=3176, Unknown=18, NotChecked=484, Total=4160 [2022-11-20 12:28:06,781 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 65 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 65 states have internal predecessors, (111), 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-20 12:28:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:28:37,635 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-11-20 12:28:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-20 12:28:37,636 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 65 states have internal predecessors, (111), 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 42 [2022-11-20 12:28:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:28:37,637 INFO L225 Difference]: With dead ends: 127 [2022-11-20 12:28:37,637 INFO L226 Difference]: Without dead ends: 94 [2022-11-20 12:28:37,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3334 ImplicationChecksByTransitivity, 81.1s TimeCoverageRelationStatistics Valid=1443, Invalid=9896, Unknown=19, NotChecked=852, Total=12210 [2022-11-20 12:28:37,641 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 239 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:28:37,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 137 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 952 Invalid, 0 Unknown, 409 Unchecked, 1.4s Time] [2022-11-20 12:28:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-20 12:28:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-11-20 12:28:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.1318681318681318) internal successors, (103), 91 states have internal predecessors, (103), 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-20 12:28:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-11-20 12:28:37,668 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 42 [2022-11-20 12:28:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:28:37,669 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-11-20 12:28:37,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 65 states have internal predecessors, (111), 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-20 12:28:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-11-20 12:28:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 12:28:37,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:28:37,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:28:37,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:28:37,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:28:37,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:28:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:28:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash 383514002, now seen corresponding path program 6 times [2022-11-20 12:28:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:28:37,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443562641] [2022-11-20 12:28:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:28:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:28:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:28:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:28:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:28:43,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443562641] [2022-11-20 12:28:43,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443562641] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:28:43,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495650301] [2022-11-20 12:28:43,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 12:28:43,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:28:43,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:28:43,840 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:28:43,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:28:44,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-20 12:28:44,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:28:44,010 WARN L261 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-20 12:28:44,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:28:44,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:44,173 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 18 treesize of output 16 [2022-11-20 12:28:44,196 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-20 12:28:44,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:44,329 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 23 treesize of output 22 [2022-11-20 12:28:44,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:44,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:44,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 12:28:44,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:44,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:44,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:44,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-11-20 12:28:45,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-11-20 12:28:45,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:45,938 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-20 12:28:45,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 66 [2022-11-20 12:28:46,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:46,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:46,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:46,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:46,363 INFO L321 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-11-20 12:28:46,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 81 [2022-11-20 12:28:47,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2022-11-20 12:28:47,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:47,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:47,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 93 [2022-11-20 12:28:48,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:48,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:48,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:48,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:48,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:48,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:48,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2022-11-20 12:28:49,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2022-11-20 12:28:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:49,583 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 12:28:49,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 99 [2022-11-20 12:28:50,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:50,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:50,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:50,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:50,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:50,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:50,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:50,225 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-20 12:28:50,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 108 [2022-11-20 12:28:51,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:51,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:51,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:51,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:51,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 94 [2022-11-20 12:28:52,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:52,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:52,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:52,223 INFO L321 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-11-20 12:28:52,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 87 [2022-11-20 12:28:52,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:52,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:52,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:28:52,805 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-20 12:28:52,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 75 [2022-11-20 12:28:53,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:53,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:53,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:53,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:28:53,876 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:28:53,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 44 [2022-11-20 12:28:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:28:53,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:29:42,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:29:42,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:29:42,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:29:42,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:29:42,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:29:42,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:29:42,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:29:42,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:29:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:29:42,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495650301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:29:42,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:29:42,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42, 40] total 114 [2022-11-20 12:29:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940355648] [2022-11-20 12:29:42,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:29:42,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2022-11-20 12:29:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:29:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2022-11-20 12:29:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=11622, Unknown=0, NotChecked=0, Total=12882 [2022-11-20 12:29:42,493 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 114 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 114 states have internal predecessors, (135), 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-20 12:29:58,709 WARN L233 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:30:00,963 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse11 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse0 (+ (* c_~N~0 2) 1)) (.cse17 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse19 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse18 (< 3 c_~N~0))) (and (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_157|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) c_~N~0)) (= .cse0 (let ((.cse5 (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse15 (+ .cse16 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse14 (* 8 |v_ULTIMATE.start_main_~i~0#1_157|))) (store (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ .cse14 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse14 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (* 8 |v_ULTIMATE.start_main_~i~0#1_148|))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse10 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ .cse1 .cse2 .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse7 .cse8 .cse9)))))))))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_148|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_157| 1) c_~N~0)))) (not .cse17) .cse18) (or .cse19 (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (= (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse30 (* 8 |v_ULTIMATE.start_main_~i~0#1_157|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ .cse30 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse30 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse27 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse23 .cse28))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse29 (* 8 |v_ULTIMATE.start_main_~i~0#1_148|))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse23 .cse27 .cse28))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse29 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23 .cse27 .cse28))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse29 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ .cse20 .cse21 .cse22 .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23 .cse26 .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse26 .cse27 .cse28))))))))) .cse0) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_157|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_148|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_157| 1) c_~N~0)))) .cse18) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_157|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) c_~N~0)) (= (let ((.cse31 (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (store .cse41 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse42 (* 8 |v_ULTIMATE.start_main_~i~0#1_157|))) (store (store (store (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ .cse42 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse42 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse38 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse34 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse37 .cse38))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse40 (* 8 |v_ULTIMATE.start_main_~i~0#1_148|))) (let ((.cse33 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse36 .cse37 .cse38))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse39 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36 .cse37 .cse38))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse40 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39))))))))) .cse0) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_148|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_157| 1) c_~N~0)))) .cse17 (not .cse19) .cse18)))) is different from true [2022-11-20 12:30:42,968 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:31:00,673 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:31:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:31:17,572 INFO L93 Difference]: Finished difference Result 170 states and 195 transitions. [2022-11-20 12:31:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-11-20 12:31:17,573 INFO L78 Accepts]: Start accepts. Automaton has has 114 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 114 states have internal predecessors, (135), 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 48 [2022-11-20 12:31:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:31:17,574 INFO L225 Difference]: With dead ends: 170 [2022-11-20 12:31:17,574 INFO L226 Difference]: Without dead ends: 168 [2022-11-20 12:31:17,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8434 ImplicationChecksByTransitivity, 148.0s TimeCoverageRelationStatistics Valid=2290, Invalid=21262, Unknown=14, NotChecked=304, Total=23870 [2022-11-20 12:31:17,579 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 964 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:31:17,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 278 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 413 Invalid, 0 Unknown, 964 Unchecked, 0.6s Time] [2022-11-20 12:31:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-20 12:31:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2022-11-20 12:31:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.1548387096774193) internal successors, (179), 155 states have internal predecessors, (179), 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-20 12:31:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2022-11-20 12:31:17,643 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 48 [2022-11-20 12:31:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:31:17,643 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2022-11-20 12:31:17,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 114 states have internal predecessors, (135), 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-20 12:31:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2022-11-20 12:31:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 12:31:17,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:31:17,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:31:17,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:31:17,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:31:17,857 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:31:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash 686177872, now seen corresponding path program 7 times [2022-11-20 12:31:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:17,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134256217] [2022-11-20 12:31:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:31:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:18,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134256217] [2022-11-20 12:31:18,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134256217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:31:18,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427454127] [2022-11-20 12:31:18,060 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 12:31:18,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:31:18,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:31:18,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:31:18,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:31:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:18,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 12:31:18,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:31:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:31:18,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:31:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 12:31:18,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427454127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:31:18,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:31:18,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 12:31:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103651544] [2022-11-20 12:31:18,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:31:18,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 12:31:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 12:31:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:31:18,496 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-20 12:31:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:31:18,995 INFO L93 Difference]: Finished difference Result 302 states and 340 transitions. [2022-11-20 12:31:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:31:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 50 [2022-11-20 12:31:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:31:18,997 INFO L225 Difference]: With dead ends: 302 [2022-11-20 12:31:18,997 INFO L226 Difference]: Without dead ends: 213 [2022-11-20 12:31:18,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-20 12:31:18,999 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 179 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:31:18,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 104 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:31:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-20 12:31:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2022-11-20 12:31:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.0971428571428572) internal successors, (192), 175 states have internal predecessors, (192), 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-20 12:31:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2022-11-20 12:31:19,087 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 50 [2022-11-20 12:31:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:31:19,087 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2022-11-20 12:31:19,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-20 12:31:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2022-11-20 12:31:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 12:31:19,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:31:19,088 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:31:19,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 12:31:19,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:31:19,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:31:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash -921964338, now seen corresponding path program 8 times [2022-11-20 12:31:19,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:19,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384569862] [2022-11-20 12:31:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 12:31:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:19,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384569862] [2022-11-20 12:31:19,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384569862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:31:19,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288993051] [2022-11-20 12:31:19,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:31:19,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:31:19,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:31:19,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:31:19,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:31:19,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:31:19,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:31:19,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 12:31:19,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:31:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 12:31:19,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:31:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 12:31:19,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288993051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:31:19,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:31:19,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 12:31:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641665545] [2022-11-20 12:31:19,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:31:19,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 12:31:19,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 12:31:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:31:19,971 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-20 12:31:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:31:20,745 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2022-11-20 12:31:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:31:20,746 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 52 [2022-11-20 12:31:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:31:20,747 INFO L225 Difference]: With dead ends: 212 [2022-11-20 12:31:20,747 INFO L226 Difference]: Without dead ends: 148 [2022-11-20 12:31:20,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-20 12:31:20,748 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:31:20,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 188 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:31:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-20 12:31:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 104. [2022-11-20 12:31:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.0679611650485437) internal successors, (110), 103 states have internal predecessors, (110), 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-20 12:31:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2022-11-20 12:31:20,786 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 52 [2022-11-20 12:31:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:31:20,786 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2022-11-20 12:31:20,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-20 12:31:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-11-20 12:31:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 12:31:20,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:31:20,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:31:20,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:31:20,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 12:31:20,994 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:31:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1433546370, now seen corresponding path program 2 times [2022-11-20 12:31:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:20,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327038981] [2022-11-20 12:31:20,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:31:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:27,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327038981] [2022-11-20 12:31:27,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327038981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:31:27,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578687307] [2022-11-20 12:31:27,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:31:27,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:31:27,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:31:27,696 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:31:27,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:31:27,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:31:27,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:31:27,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 12:31:27,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:31:28,004 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:31:28,004 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 108 treesize of output 102 [2022-11-20 12:31:28,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 12:31:28,292 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 28 treesize of output 27 [2022-11-20 12:31:28,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:28,404 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 21 treesize of output 20 [2022-11-20 12:31:28,575 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 23 treesize of output 23 [2022-11-20 12:31:28,610 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 23 treesize of output 23 [2022-11-20 12:31:28,657 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 23 treesize of output 23 [2022-11-20 12:31:28,809 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 23 treesize of output 23 [2022-11-20 12:31:28,842 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 23 treesize of output 23 [2022-11-20 12:31:28,902 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 23 treesize of output 23 [2022-11-20 12:31:28,975 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 23 treesize of output 23 [2022-11-20 12:31:29,021 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 23 treesize of output 23 [2022-11-20 12:31:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:29,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 12:31:29,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:29,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:31:29,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-20 12:31:29,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:29,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:29,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:29,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-20 12:31:29,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:29,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-11-20 12:31:30,778 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 0 case distinctions, treesize of input 77 treesize of output 49 [2022-11-20 12:31:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:31:30,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:31:34,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_795)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ v_ArrVal_795 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (+ (* c_~N~0 2) 1))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3) (not (= .cse2 .cse3))))))) is different from false [2022-11-20 12:31:34,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:34,448 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 83 treesize of output 74 [2022-11-20 12:31:34,470 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse3 (+ (* c_~N~0 2) 1))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse3) (not (= .cse2 .cse3))))))) is different from false [2022-11-20 12:31:34,670 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse1 (+ (* c_~N~0 2) 1))) (or (not (= .cse0 .cse1)) (= (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse1)))))) is different from false [2022-11-20 12:31:34,803 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse1 (+ (* c_~N~0 2) 1))) (or (not (= .cse0 .cse1)) (= (+ (select .cse2 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse1)))))) is different from false [2022-11-20 12:31:34,824 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (+ (* c_~N~0 2) 1)) (.cse2 (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (= (+ (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse3) (not (= .cse3 .cse2))))))) is different from false [2022-11-20 12:31:34,847 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 Int) (v_ArrVal_789 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_783) (+ .cse4 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (+ (* c_~N~0 2) 1))) (or (= (+ (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) .cse3) (not (= .cse2 .cse3))))))) is different from false [2022-11-20 12:31:35,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:35,468 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 3 case distinctions, treesize of input 227 treesize of output 125 [2022-11-20 12:31:35,480 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 729 treesize of output 705 [2022-11-20 12:31:35,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:35,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1047 treesize of output 1027 [2022-11-20 12:31:35,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:35,643 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 1206 treesize of output 1068 [2022-11-20 12:31:35,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:35,709 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 695 treesize of output 661 [2022-11-20 12:31:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 22 not checked. [2022-11-20 12:31:59,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578687307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:31:59,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:31:59,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21, 23] total 72 [2022-11-20 12:31:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905749826] [2022-11-20 12:31:59,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:31:59,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 12:31:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:59,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 12:31:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3969, Unknown=52, NotChecked=798, Total=5112 [2022-11-20 12:31:59,013 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 72 states have internal predecessors, (143), 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-20 12:32:07,778 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 130 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:32:14,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~N~0 2))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ .cse6 1))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse4)) .cse5) (not (= .cse2 .cse5))))))) (or (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (+ (select .cse9 .cse3) 6)) (.cse7 (+ (select .cse9 .cse4) .cse6))) (and (= .cse6 6) (<= .cse7 .cse8) (<= .cse8 .cse7) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_789 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (not (= .cse10 .cse5)) (= (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 .cse4)) .cse5))))))))) is different from false [2022-11-20 12:32:19,646 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ (* c_~N~0 2) 1))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse4)) .cse5) (not (= .cse2 .cse5))))))) (forall ((v_ArrVal_789 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (not (= .cse6 .cse5)) (= (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse4)) .cse5)))))))) is different from false [2022-11-20 12:32:25,924 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 110 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:32:32,391 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 105 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:32:35,933 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (* c_~N~0 2)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse5 (+ .cse6 1))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse4)) .cse5) (not (= .cse2 .cse5))))))) (or (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (+ (select .cse9 .cse3) 6)) (.cse7 (+ (select .cse9 .cse4) .cse6))) (and (= .cse6 6) (<= .cse7 .cse8) (<= .cse8 .cse7) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) is different from false [2022-11-20 12:32:37,211 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~N~0 2))) (let ((.cse5 (+ .cse9 1)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse4)) .cse5) (not (= .cse2 .cse5))))))) (forall ((v_ArrVal_795 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_795)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (+ v_ArrVal_795 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)) .cse5) (not (= .cse8 .cse5))))))) (or (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (+ (select .cse12 .cse3) 6)) (.cse10 (+ (select .cse12 .cse4) .cse9))) (and (= .cse9 6) (<= .cse10 .cse11) (<= .cse11 .cse10) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))))) is different from false [2022-11-20 12:32:37,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ (* c_~N~0 2) 1))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse4)) .cse5) (not (= .cse2 .cse5))))))) (forall ((v_ArrVal_795 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_795)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (+ v_ArrVal_795 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)) .cse5) (not (= .cse8 .cse5))))))))) is different from false [2022-11-20 12:32:39,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (* c_~N~0 2))) (let ((.cse5 (+ .cse10 1)) (.cse13 (select .cse14 .cse4)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse4)) .cse5) (not (= .cse2 .cse5))))))) (forall ((v_ArrVal_795 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_795)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (+ v_ArrVal_795 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)) .cse5) (not (= .cse8 .cse5))))))) (or (let ((.cse12 (+ (select .cse14 .cse3) 6)) (.cse11 (+ .cse13 .cse10))) (and (= .cse10 6) (<= .cse11 .cse12) (<= .cse12 .cse11) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (let ((.cse15 (+ (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse5 .cse15)) (forall ((v_ArrVal_799 Int)) (= .cse5 (+ .cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| .cse15) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))) is different from false [2022-11-20 12:32:40,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* c_~N~0 2) 1)) (.cse4 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (or (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse4)) .cse5) (not (= .cse2 .cse5))))))) (forall ((v_ArrVal_795 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_795)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (+ v_ArrVal_795 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (= (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)) .cse5) (not (= .cse8 .cse5))))))) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (+ (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= .cse5 .cse10)) (forall ((v_ArrVal_799 Int)) (= .cse5 (+ (select .cse11 .cse4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse3 v_ArrVal_799)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))) is different from false [2022-11-20 12:32:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:32:43,067 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2022-11-20 12:32:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-20 12:32:43,068 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 72 states have internal predecessors, (143), 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 56 [2022-11-20 12:32:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:32:43,069 INFO L225 Difference]: With dead ends: 149 [2022-11-20 12:32:43,069 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 12:32:43,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 87 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 50.3s TimeCoverageRelationStatistics Valid=924, Invalid=8763, Unknown=67, NotChecked=2678, Total=12432 [2022-11-20 12:32:43,072 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 138 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 925 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:32:43,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 256 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1110 Invalid, 0 Unknown, 925 Unchecked, 1.5s Time] [2022-11-20 12:32:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 12:32:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 61. [2022-11-20 12:32:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 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-20 12:32:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-20 12:32:43,102 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 56 [2022-11-20 12:32:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:32:43,103 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-20 12:32:43,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 72 states have internal predecessors, (143), 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-20 12:32:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-20 12:32:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 12:32:43,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:32:43,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:32:43,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:32:43,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 12:32:43,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:32:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1839482760, now seen corresponding path program 9 times [2022-11-20 12:32:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:43,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079932153] [2022-11-20 12:32:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:32:53,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:53,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079932153] [2022-11-20 12:32:53,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079932153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:32:53,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499487937] [2022-11-20 12:32:53,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:32:53,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:32:53,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:32:53,735 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:32:53,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac4e049-dc44-4115-9e45-2ada88e45b56/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 12:32:54,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 12:32:54,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:32:54,020 WARN L261 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-20 12:32:54,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:32:54,051 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-20 12:32:54,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:54,071 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 18 treesize of output 16 [2022-11-20 12:32:54,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:54,243 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 23 treesize of output 22 [2022-11-20 12:32:54,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:54,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:54,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 12:32:54,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:54,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:54,818 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-20 12:32:54,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-11-20 12:32:55,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:55,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:55,259 INFO L321 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-11-20 12:32:55,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 59 [2022-11-20 12:32:56,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,295 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-20 12:32:56,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 73 [2022-11-20 12:32:56,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,881 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-20 12:32:56,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 81 [2022-11-20 12:32:57,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,315 INFO L321 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2022-11-20 12:32:57,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 95 [2022-11-20 12:32:57,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:57,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:58,007 INFO L321 Elim1Store]: treesize reduction 92, result has 15.6 percent of original size [2022-11-20 12:32:58,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 90 treesize of output 110 [2022-11-20 12:32:59,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:59,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:59,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:59,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:32:59,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:59,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:59,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:59,603 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-11-20 12:32:59,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 119 [2022-11-20 12:33:00,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,424 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-11-20 12:33:00,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 115 [2022-11-20 12:33:00,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:00,929 INFO L321 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-11-20 12:33:00,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 128 [2022-11-20 12:33:01,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:01,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:01,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:01,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:01,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:01,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:01,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:01,811 INFO L321 Elim1Store]: treesize reduction 138, result has 0.7 percent of original size [2022-11-20 12:33:01,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 11 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 122 treesize of output 140 [2022-11-20 12:33:03,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:03,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:03,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:03,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:03,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:03,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:03,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:03,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:03,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:03,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:03,727 INFO L321 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-11-20 12:33:03,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 9 disjoint index pairs (out of 66 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 122 [2022-11-20 12:33:04,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:04,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:04,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:04,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:04,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:04,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:04,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:04,735 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-11-20 12:33:04,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 120 [2022-11-20 12:33:05,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:05,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:05,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:05,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:05,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:05,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:05,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:05,332 INFO L321 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-11-20 12:33:05,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 128 [2022-11-20 12:33:06,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:06,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:06,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:06,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:06,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:06,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:06,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:06,457 INFO L321 Elim1Store]: treesize reduction 138, result has 0.7 percent of original size [2022-11-20 12:33:06,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 11 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 13 case distinctions, treesize of input 119 treesize of output 133 [2022-11-20 12:33:08,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:08,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:08,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:08,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:08,692 INFO L321 Elim1Store]: treesize reduction 90, result has 19.6 percent of original size [2022-11-20 12:33:08,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 9 disjoint index pairs (out of 66 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 127 treesize of output 127 [2022-11-20 12:33:09,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:09,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:09,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:09,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:09,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:09,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:09,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:09,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:09,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:09,872 INFO L321 Elim1Store]: treesize reduction 368, result has 18.4 percent of original size [2022-11-20 12:33:09,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 155 [2022-11-20 12:33:10,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:10,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:10,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:10,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:10,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:11,018 INFO L321 Elim1Store]: treesize reduction 336, result has 18.4 percent of original size [2022-11-20 12:33:11,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 113 treesize of output 165 [2022-11-20 12:33:12,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:12,705 INFO L321 Elim1Store]: treesize reduction 403, result has 21.0 percent of original size [2022-11-20 12:33:12,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 139 treesize of output 206 [2022-11-20 12:33:15,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:15,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:15,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:15,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:15,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:15,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:15,666 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:33:15,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 47 [2022-11-20 12:33:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:33:15,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:36,308 WARN L233 SmtUtils]: Spent 22.90s on a formula simplification. DAG size of input: 105 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:39:11,455 WARN L233 SmtUtils]: Spent 12.40s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:39:14,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_286| Int) (|v_ULTIMATE.start_main_~i~0#1_274| Int) (|v_ULTIMATE.start_main_~i~0#1_280| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_286| 2) (< (let ((.cse0 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (* |ULTIMATE.start_main_~i~0#1| 8))) (store (store .cse17 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse18 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse16 (* 8 |v_ULTIMATE.start_main_~i~0#1_286|))) (store (store (store (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse12 1) (+ .cse16 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse16 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (.cse13 (* 8 |v_ULTIMATE.start_main_~i~0#1_280|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse6 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse12)) (.cse11 (* 8 |v_ULTIMATE.start_main_~i~0#1_274|))) (let ((.cse10 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse7 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse11 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))))))))) (+ (* 2 |v_ULTIMATE.start_main_~i~0#1_274|) 6)) (< 2 |v_ULTIMATE.start_main_~i~0#1_280|) (< |v_ULTIMATE.start_main_~i~0#1_274| |v_ULTIMATE.start_main_~i~0#1_286|) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_274|) (< |v_ULTIMATE.start_main_~i~0#1_280| |v_ULTIMATE.start_main_~i~0#1_286|))) (< 2 |ULTIMATE.start_main_~i~0#1|))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_286| Int) (|v_ULTIMATE.start_main_~i~0#1_274| Int) (|v_ULTIMATE.start_main_~i~0#1_280| Int)) (or (< (+ (* 2 |v_ULTIMATE.start_main_~i~0#1_286|) 4) (let ((.cse19 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse34 (* |ULTIMATE.start_main_~i~0#1| 8))) (store (store .cse17 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse34 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (store .cse32 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse33 (* 8 |v_ULTIMATE.start_main_~i~0#1_286|))) (store (store (store (store (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse12 1) (+ .cse33 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse33 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (.cse31 (* 8 |v_ULTIMATE.start_main_~i~0#1_280|))) (let ((.cse21 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse27 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse31 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse28 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse27))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse25 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse27 .cse28))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse12)) (.cse30 (* 8 |v_ULTIMATE.start_main_~i~0#1_274|))) (let ((.cse29 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse30 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse26 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse30 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29)))))))))))) (< |v_ULTIMATE.start_main_~i~0#1_286| 2) (< 2 |v_ULTIMATE.start_main_~i~0#1_280|) (< |v_ULTIMATE.start_main_~i~0#1_274| |v_ULTIMATE.start_main_~i~0#1_286|) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_274|) (< |v_ULTIMATE.start_main_~i~0#1_280| |v_ULTIMATE.start_main_~i~0#1_286|))) (< 2 |ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-11-20 12:39:20,808 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (and (forall ((v_subst_2 Int)) (or (< 2 v_subst_2) (forall ((|v_ULTIMATE.start_main_~i~0#1_286| Int) (|v_ULTIMATE.start_main_~i~0#1_274| Int) (|v_ULTIMATE.start_main_~i~0#1_280| Int)) (or (< (let ((.cse9 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (* 8 v_subst_2))) (store (store .cse17 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse18 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse16 (* 8 |v_ULTIMATE.start_main_~i~0#1_286|))) (store (store (store (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse12 1) (+ .cse16 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse16 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (.cse13 (* 8 |v_ULTIMATE.start_main_~i~0#1_280|))) (let ((.cse5 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6 .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse0 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse12)) (.cse11 (* 8 |v_ULTIMATE.start_main_~i~0#1_274|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse1 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse11 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (+ (* 2 |v_ULTIMATE.start_main_~i~0#1_274|) 6)) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_274|) (< |v_ULTIMATE.start_main_~i~0#1_286| 2) (< 2 |v_ULTIMATE.start_main_~i~0#1_280|) (< |v_ULTIMATE.start_main_~i~0#1_274| |v_ULTIMATE.start_main_~i~0#1_286|) (< |v_ULTIMATE.start_main_~i~0#1_280| |v_ULTIMATE.start_main_~i~0#1_286|))))) (forall ((v_subst_1 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_286| Int) (|v_ULTIMATE.start_main_~i~0#1_274| Int) (|v_ULTIMATE.start_main_~i~0#1_280| Int)) (or (< (+ (* 2 |v_ULTIMATE.start_main_~i~0#1_286|) 4) (let ((.cse26 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse34 (* 8 v_subst_1))) (store (store .cse17 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse34 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (store .cse32 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse33 (* 8 |v_ULTIMATE.start_main_~i~0#1_286|))) (store (store (store (store (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse12 1) (+ .cse33 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse33 8 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (.cse31 (* 8 |v_ULTIMATE.start_main_~i~0#1_280|))) (let ((.cse28 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse22 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse31 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse28 .cse29))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse24 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse25 .cse28 .cse29))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse12)) (.cse30 (* 8 |v_ULTIMATE.start_main_~i~0#1_274|))) (let ((.cse23 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse24 .cse25 .cse28 .cse29))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse30 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse19 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse28 .cse29))) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse30 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse28 .cse29)))))))))))) (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_274|) (< |v_ULTIMATE.start_main_~i~0#1_286| 2) (< 2 |v_ULTIMATE.start_main_~i~0#1_280|) (< |v_ULTIMATE.start_main_~i~0#1_274| |v_ULTIMATE.start_main_~i~0#1_286|) (< |v_ULTIMATE.start_main_~i~0#1_280| |v_ULTIMATE.start_main_~i~0#1_286|))) (< 2 v_subst_1))))) is different from false