./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:38:58,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:38:58,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:38:58,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:38:58,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:38:58,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:38:58,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:38:58,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:38:58,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:38:58,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:38:58,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:38:58,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:38:58,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:38:58,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:38:58,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:38:58,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:38:58,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:38:58,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:38:58,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:38:58,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:38:58,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:38:58,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:38:58,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:38:58,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:38:58,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:38:58,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:38:58,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:38:58,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:38:58,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:38:58,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:38:58,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:38:58,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:38:58,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:38:58,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:38:58,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:38:58,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:38:58,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:38:58,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:38:58,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:38:58,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:38:58,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:38:58,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-06 22:38:58,975 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:38:58,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:38:58,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:38:58,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:38:58,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:38:58,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:38:58,977 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:38:58,977 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-06 22:38:58,977 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-06 22:38:58,978 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-06 22:38:58,978 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-06 22:38:58,978 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-06 22:38:58,978 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-06 22:38:58,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:38:58,978 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 22:38:58,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:38:58,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:38:58,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-06 22:38:58,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-06 22:38:58,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-06 22:38:58,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:38:58,980 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-06 22:38:58,980 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:38:58,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-06 22:38:58,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:38:58,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:38:58,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:38:58,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:38:58,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:38:58,982 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-06 22:38:58,982 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/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_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2021-12-06 22:38:59,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:38:59,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:38:59,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:38:59,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:38:59,180 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:38:59,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-12-06 22:38:59,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/data/a3f8446ff/96b6bbe234f34b00917ed3e8ed2bbbeb/FLAG44ea1c2d9 [2021-12-06 22:38:59,703 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:38:59,703 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-12-06 22:38:59,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/data/a3f8446ff/96b6bbe234f34b00917ed3e8ed2bbbeb/FLAG44ea1c2d9 [2021-12-06 22:38:59,727 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/data/a3f8446ff/96b6bbe234f34b00917ed3e8ed2bbbeb [2021-12-06 22:38:59,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:38:59,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:38:59,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:38:59,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:38:59,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:38:59,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:38:59,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcc5917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59, skipping insertion in model container [2021-12-06 22:38:59,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:38:59,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:38:59,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:38:59,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:38:59,937 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:38:59,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:38:59,981 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:38:59,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59 WrapperNode [2021-12-06 22:38:59,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:38:59,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:38:59,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:38:59,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:38:59,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,020 INFO L137 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2021-12-06 22:39:00,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:39:00,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:39:00,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:39:00,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:39:00,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:39:00,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:39:00,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:39:00,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:39:00,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (1/1) ... [2021-12-06 22:39:00,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 22:39:00,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:39:00,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 22:39:00,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-06 22:39:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 22:39:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 22:39:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 22:39:00,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:39:00,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:39:00,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:39:00,182 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:39:00,183 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:39:00,311 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:39:00,316 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:39:00,317 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-06 22:39:00,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:39:00 BoogieIcfgContainer [2021-12-06 22:39:00,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:39:00,319 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-06 22:39:00,319 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-06 22:39:00,323 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-06 22:39:00,323 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 22:39:00,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.12 10:38:59" (1/3) ... [2021-12-06 22:39:00,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64eabe5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.12 10:39:00, skipping insertion in model container [2021-12-06 22:39:00,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 22:39:00,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:38:59" (2/3) ... [2021-12-06 22:39:00,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64eabe5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.12 10:39:00, skipping insertion in model container [2021-12-06 22:39:00,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 22:39:00,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:39:00" (3/3) ... [2021-12-06 22:39:00,326 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2021-12-06 22:39:00,364 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-06 22:39:00,364 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-06 22:39:00,364 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-06 22:39:00,364 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-06 22:39:00,364 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-06 22:39:00,365 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-06 22:39:00,365 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-06 22:39:00,365 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-06 22:39:00,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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) [2021-12-06 22:39:00,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-06 22:39:00,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:39:00,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:39:00,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:39:00,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-06 22:39:00,391 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-06 22:39:00,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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) [2021-12-06 22:39:00,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-06 22:39:00,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:39:00,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:39:00,393 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:39:00,393 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-06 22:39:00,398 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 6#L552-4true [2021-12-06 22:39:00,398 INFO L793 eck$LassoCheckResult]: Loop: 6#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13#L552-1true assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 12#L553-4true assume !true; 5#L552-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 6#L552-4true [2021-12-06 22:39:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-06 22:39:00,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:00,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38504148] [2021-12-06 22:39:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:00,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:00,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:39:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:00,567 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:39:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2021-12-06 22:39:00,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452389505] [2021-12-06 22:39:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:00,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:00,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:00,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452389505] [2021-12-06 22:39:00,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452389505] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:00,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:00,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:39:00,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979543496] [2021-12-06 22:39:00,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:00,620 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-06 22:39:00,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:00,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 22:39:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 22:39:00,652 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-12-06 22:39:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:39:00,657 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-12-06 22:39:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 22:39:00,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-12-06 22:39:00,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-06 22:39:00,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2021-12-06 22:39:00,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-06 22:39:00,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-06 22:39:00,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2021-12-06 22:39:00,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:00,667 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-06 22:39:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2021-12-06 22:39:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-06 22:39:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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) [2021-12-06 22:39:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-12-06 22:39:00,685 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-06 22:39:00,686 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-06 22:39:00,686 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-06 22:39:00,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-12-06 22:39:00,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-06 22:39:00,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:39:00,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:39:00,687 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:39:00,690 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-06 22:39:00,690 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 35#L552-4 [2021-12-06 22:39:00,691 INFO L793 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 36#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 38#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 34#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 35#L552-4 [2021-12-06 22:39:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-06 22:39:00,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:00,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684314104] [2021-12-06 22:39:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:00,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:00,720 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:39:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:00,735 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:39:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2021-12-06 22:39:00,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:00,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856770752] [2021-12-06 22:39:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:00,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:00,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:00,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856770752] [2021-12-06 22:39:00,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856770752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:00,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:00,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:39:00,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782026905] [2021-12-06 22:39:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:00,775 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-06 22:39:00,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:00,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:39:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:39:00,775 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2021-12-06 22:39:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:39:00,806 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-12-06 22:39:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:39:00,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-12-06 22:39:00,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-06 22:39:00,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2021-12-06 22:39:00,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-06 22:39:00,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-06 22:39:00,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2021-12-06 22:39:00,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:00,808 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-06 22:39:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2021-12-06 22:39:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-12-06 22:39:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 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) [2021-12-06 22:39:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-06 22:39:00,810 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-06 22:39:00,810 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-06 22:39:00,810 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-06 22:39:00,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-12-06 22:39:00,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-06 22:39:00,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:39:00,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:39:00,811 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:39:00,811 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:00,811 INFO L791 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 61#L552-4 [2021-12-06 22:39:00,812 INFO L793 eck$LassoCheckResult]: Loop: 61#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 64#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 68#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 67#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 65#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 66#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 69#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 60#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 61#L552-4 [2021-12-06 22:39:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-06 22:39:00,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:00,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26891272] [2021-12-06 22:39:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:00,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:00,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:39:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:00,854 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:39:00,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2021-12-06 22:39:00,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:00,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402535705] [2021-12-06 22:39:00,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:00,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:00,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402535705] [2021-12-06 22:39:00,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402535705] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:39:00,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437183134] [2021-12-06 22:39:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:00,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:39:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:39:00,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:39:00,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 22:39:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:00,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 22:39:00,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:39:01,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-06 22:39:01,084 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-06 22:39:01,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2021-12-06 22:39:01,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-06 22:39:01,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 22:39:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:01,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:39:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:01,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437183134] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:39:01,258 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:39:01,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-06 22:39:01,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700930656] [2021-12-06 22:39:01,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:39:01,258 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-06 22:39:01,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 22:39:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-12-06 22:39:01,260 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2021-12-06 22:39:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:39:01,322 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-12-06 22:39:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:39:01,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2021-12-06 22:39:01,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2021-12-06 22:39:01,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2021-12-06 22:39:01,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-06 22:39:01,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-06 22:39:01,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2021-12-06 22:39:01,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:01,326 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-12-06 22:39:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2021-12-06 22:39:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-12-06 22:39:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 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) [2021-12-06 22:39:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-12-06 22:39:01,328 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-12-06 22:39:01,328 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-12-06 22:39:01,328 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-06 22:39:01,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-12-06 22:39:01,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-12-06 22:39:01,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:39:01,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:39:01,329 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:39:01,329 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2021-12-06 22:39:01,330 INFO L791 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 152#L552-4 [2021-12-06 22:39:01,330 INFO L793 eck$LassoCheckResult]: Loop: 152#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 160#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 169#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 156#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 157#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 158#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 159#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 168#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 167#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 166#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 165#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 164#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 162#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 163#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 161#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 151#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 152#L552-4 [2021-12-06 22:39:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-06 22:39:01,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:01,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556284000] [2021-12-06 22:39:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:01,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:01,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:39:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:39:01,360 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:39:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2021-12-06 22:39:01,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:01,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286002854] [2021-12-06 22:39:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:01,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:01,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:01,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286002854] [2021-12-06 22:39:01,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286002854] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:39:01,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336166519] [2021-12-06 22:39:01,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:39:01,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:39:01,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:39:01,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:39:01,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 22:39:01,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:39:01,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:39:01,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-06 22:39:01,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:39:01,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-06 22:39:01,855 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-06 22:39:01,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2021-12-06 22:39:01,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2021-12-06 22:39:02,037 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-06 22:39:02,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2021-12-06 22:39:02,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2021-12-06 22:39:02,179 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-06 22:39:02,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2021-12-06 22:39:02,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2021-12-06 22:39:02,352 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-06 22:39:02,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2021-12-06 22:39:02,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-06 22:39:02,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 22:39:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:02,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:42:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:42:59,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336166519] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:42:59,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:42:59,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 22 [2021-12-06 22:42:59,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301198194] [2021-12-06 22:42:59,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:42:59,076 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-06 22:42:59,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:42:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 22:42:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=282, Unknown=14, NotChecked=0, Total=462 [2021-12-06 22:42:59,077 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 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) [2021-12-06 22:42:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:42:59,177 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-12-06 22:42:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 22:42:59,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2021-12-06 22:42:59,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-12-06 22:42:59,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2021-12-06 22:42:59,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-06 22:42:59,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-06 22:42:59,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2021-12-06 22:42:59,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:42:59,180 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-12-06 22:42:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2021-12-06 22:42:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-06 22:42:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 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) [2021-12-06 22:42:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-12-06 22:42:59,181 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-06 22:42:59,181 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-06 22:42:59,182 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-06 22:42:59,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-12-06 22:42:59,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-06 22:42:59,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:42:59,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:42:59,183 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 22:42:59,183 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2021-12-06 22:42:59,183 INFO L791 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 319#L552-4 [2021-12-06 22:42:59,183 INFO L793 eck$LassoCheckResult]: Loop: 319#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 320#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 325#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 337#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 321#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 322#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 323#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 324#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 336#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 335#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 334#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 333#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 332#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 331#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 330#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 329#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 327#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 328#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 326#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 318#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 319#L552-4 [2021-12-06 22:42:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:42:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-06 22:42:59,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:42:59,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561798009] [2021-12-06 22:42:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:42:59,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:42:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:42:59,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:42:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:42:59,198 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:42:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:42:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1966644716, now seen corresponding path program 3 times [2021-12-06 22:42:59,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:42:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298516143] [2021-12-06 22:42:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:42:59,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:42:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:42:59,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:42:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:42:59,269 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:42:59,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:42:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash -872207186, now seen corresponding path program 1 times [2021-12-06 22:42:59,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:42:59,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231136494] [2021-12-06 22:42:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:42:59,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:42:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:42:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:42:59,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:42:59,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231136494] [2021-12-06 22:42:59,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231136494] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:42:59,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86920669] [2021-12-06 22:42:59,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:42:59,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:42:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:42:59,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:42:59,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 22:42:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:42:59,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-06 22:42:59,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:42:59,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 42 [2021-12-06 22:42:59,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-06 22:42:59,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2021-12-06 22:42:59,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 22:42:59,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2021-12-06 22:42:59,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-06 22:42:59,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 22:42:59,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2021-12-06 22:42:59,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-06 22:42:59,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 22:42:59,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2021-12-06 22:42:59,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-06 22:42:59,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 22:42:59,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2021-12-06 22:42:59,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-06 22:42:59,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 22:42:59,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-06 22:42:59,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 22:42:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:42:59,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:43:00,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_473)))) is different from false [2021-12-06 22:43:00,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_471))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_473))))) is different from false [2021-12-06 22:43:00,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_473 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_466 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_471))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ 2 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_473) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_466) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10)))))) is different from false [2021-12-06 22:43:00,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_473 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_466 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_471))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_466) (< (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_473))))))) is different from false [2021-12-06 22:43:00,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_473 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_459 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_466 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_471))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ 2 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_473) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_459) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_466)))))))) is different from false [2021-12-06 22:43:00,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (v_ArrVal_473 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_458))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_459 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_466 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_471))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_459) (< (+ 2 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_466) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_473))))))))) is different from false [2021-12-06 22:43:00,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (v_ArrVal_454 Int) (v_ArrVal_473 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_454 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_458))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_459 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_466 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_471))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_473) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_459) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_454) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_466)))))))))) is different from false [2021-12-06 22:43:01,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (v_ArrVal_454 Int) (v_ArrVal_473 Int) (v_ArrVal_450 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_452))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_454 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_458))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_459 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_466 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_471))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_454) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_466) (< (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) (+ v_ArrVal_450 1)) (< (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_473) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_459)))))))))))) is different from false [2021-12-06 22:43:01,429 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:43:01,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 723 treesize of output 483 [2021-12-06 22:43:01,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 885 treesize of output 877 [2021-12-06 22:43:01,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 230 [2021-12-06 22:43:01,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2021-12-06 22:43:01,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 110 [2021-12-06 22:43:01,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-06 22:43:01,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 438 treesize of output 406 [2021-12-06 22:43:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2021-12-06 22:43:01,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86920669] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:43:01,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:43:01,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 15] total 29 [2021-12-06 22:43:01,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84490756] [2021-12-06 22:43:01,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:43:13,759 WARN L227 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 169 DAG size of output: 158 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-06 22:43:15,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:43:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 22:43:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=266, Unknown=8, NotChecked=360, Total=812 [2021-12-06 22:43:15,366 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 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) [2021-12-06 22:43:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:43:15,754 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-12-06 22:43:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 22:43:15,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2021-12-06 22:43:15,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-06 22:43:15,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2021-12-06 22:43:15,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-06 22:43:15,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-06 22:43:15,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2021-12-06 22:43:15,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:43:15,757 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-12-06 22:43:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2021-12-06 22:43:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-06 22:43:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 29 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) [2021-12-06 22:43:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-12-06 22:43:15,760 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-12-06 22:43:15,760 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-12-06 22:43:15,760 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-06 22:43:15,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2021-12-06 22:43:15,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-06 22:43:15,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 22:43:15,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 22:43:15,761 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2021-12-06 22:43:15,761 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2021-12-06 22:43:15,761 INFO L791 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 568#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 569#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 570#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 575#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 594#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 571#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 572#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 573#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 574#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 592#L553-4 [2021-12-06 22:43:15,761 INFO L793 eck$LassoCheckResult]: Loop: 592#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 591#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 590#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 589#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 588#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 587#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 586#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 585#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 584#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 583#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 582#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 581#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 580#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 579#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 577#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 578#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 576#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 565#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 566#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 593#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 592#L553-4 [2021-12-06 22:43:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:43:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1923748824, now seen corresponding path program 1 times [2021-12-06 22:43:15,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:43:15,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434202151] [2021-12-06 22:43:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:43:15,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:43:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:43:15,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:43:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:43:15,789 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:43:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:43:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 440091564, now seen corresponding path program 4 times [2021-12-06 22:43:15,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:43:15,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268699652] [2021-12-06 22:43:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:43:15,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:43:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:43:15,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:43:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:43:15,838 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:43:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:43:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1733257645, now seen corresponding path program 2 times [2021-12-06 22:43:15,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:43:15,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693283549] [2021-12-06 22:43:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:43:15,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:43:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:43:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:43:16,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:43:16,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693283549] [2021-12-06 22:43:16,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693283549] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:43:16,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772230086] [2021-12-06 22:43:16,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:43:16,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:43:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:43:16,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:43:16,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef110bcb-d205-4bc2-9aa6-0d50abd811b4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 22:43:16,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:43:16,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:43:16,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 108 conjunts are in the unsatisfiable core [2021-12-06 22:43:16,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:43:16,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-06 22:43:16,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:43:16,562 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-12-06 22:43:16,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 85 [2021-12-06 22:43:16,626 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-12-06 22:43:16,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 76 [2021-12-06 22:43:16,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-06 22:43:16,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-06 22:43:16,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 10 [2021-12-06 22:43:16,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2021-12-06 22:43:16,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2021-12-06 22:43:16,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-06 22:43:16,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-06 22:43:16,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 15 [2021-12-06 22:43:16,997 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-06 22:43:16,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-12-06 22:43:17,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:43:17,169 INFO L354 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2021-12-06 22:43:17,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 63 [2021-12-06 22:43:17,329 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-06 22:43:17,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-12-06 22:43:17,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:43:17,498 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-12-06 22:43:17,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 100 [2021-12-06 22:43:17,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 28 treesize of output 31 [2021-12-06 22:43:17,570 INFO L354 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2021-12-06 22:43:17,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 75 [2021-12-06 22:43:17,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2021-12-06 22:43:17,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2021-12-06 22:43:17,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2021-12-06 22:43:17,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2021-12-06 22:43:17,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 31 [2021-12-06 22:43:17,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-12-06 22:43:17,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-06 22:43:17,971 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-06 22:43:17,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-12-06 22:43:18,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:43:18,138 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-12-06 22:43:18,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 100 [2021-12-06 22:43:18,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 28 treesize of output 31 [2021-12-06 22:43:18,209 INFO L354 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2021-12-06 22:43:18,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 75 [2021-12-06 22:43:18,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 10 [2021-12-06 22:43:18,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-12-06 22:43:18,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2021-12-06 22:43:18,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2021-12-06 22:43:18,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2021-12-06 22:43:18,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-12-06 22:43:18,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-06 22:43:18,610 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-06 22:43:18,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-12-06 22:43:18,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:43:18,789 INFO L354 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2021-12-06 22:43:18,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 63 [2021-12-06 22:43:18,964 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-06 22:43:18,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2021-12-06 22:43:19,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2021-12-06 22:43:19,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 22:43:19,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2021-12-06 22:43:19,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-06 22:43:19,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 22:43:19,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-06 22:43:19,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 22:43:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:43:19,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:43:19,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_810 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_810)))) is different from false [2021-12-06 22:43:19,753 WARN L838 $PredicateComparison]: unable to prove that (or (<= 12 |c_ULTIMATE.start_main_#t~mem9#1|) (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_810 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) (+ v_ArrVal_806 1)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810))))))) is different from false [2021-12-06 22:43:19,794 WARN L838 $PredicateComparison]: unable to prove that (or (<= 12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|)) (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_810 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) (+ v_ArrVal_806 1)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810))))))) is different from false [2021-12-06 22:43:19,834 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_810 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_806)))))) (<= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|))) is different from false [2021-12-06 22:43:19,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_801 Int) (v_ArrVal_810 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse7 |c_ULTIMATE.start_main_~j~0#1.offset|))))))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< v_ArrVal_801 (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ .cse1 1) v_ArrVal_806) (<= 10 .cse1) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_810))))))))) is different from false [2021-12-06 22:43:20,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_801 Int) (v_ArrVal_810 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|))) (or (<= 10 .cse0) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810) (< (+ .cse0 1) v_ArrVal_806) (< v_ArrVal_801 (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))))))))) is different from false [2021-12-06 22:43:20,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_790 Int) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_801 Int) (v_ArrVal_810 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_main_~j~0#1.offset|))))))) (let ((.cse7 (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_790)))) (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~j~0#1.offset|) 1))))))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (<= 10 .cse0) (< (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810) (< v_ArrVal_801 (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ .cse0 1) v_ArrVal_806) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< v_ArrVal_790 (+ (select (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))))))) is different from false [2021-12-06 22:43:21,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_790 Int) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_801 Int) (v_ArrVal_810 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse7 (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_790)))) (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~j~0#1.offset|) 1))))))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|)) (.cse2 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810) (<= 10 .cse2) (< v_ArrVal_790 (+ (select (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ .cse2 1) v_ArrVal_806) (< v_ArrVal_801 (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))))))) is different from false [2021-12-06 22:43:22,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_790 Int) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_779 Int) (v_ArrVal_801 Int) (v_ArrVal_810 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse13 |c_ULTIMATE.start_main_~j~0#1.offset|))))))) (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_779)))) (let ((.cse0 (store .cse11 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse8 (let ((.cse9 (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store .cse11 |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_790)))) (store .cse9 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~j~0#1.offset|) 1))))))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse3 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< v_ArrVal_790 (+ (select (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (<= 10 .cse1) (< v_ArrVal_801 (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ .cse1 1) v_ArrVal_806) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ 2 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810) (< v_ArrVal_779 (+ (select (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))))))))) is different from false [2021-12-06 22:44:24,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_790 Int) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_779 Int) (v_ArrVal_801 Int) (v_ArrVal_766 Int) (v_ArrVal_810 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse17 |c_ULTIMATE.start_main_~j~0#1.offset|))))))) (let ((.cse6 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_766)))) (let ((.cse2 (store .cse14 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse12 (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_779)))) (let ((.cse3 (store .cse12 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse9 (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store .cse12 |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_790)))) (store .cse10 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~j~0#1.offset|) 1))))))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.offset|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< v_ArrVal_779 (+ (select (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810) (< v_ArrVal_790 (+ (select (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (<= 10 .cse4) (< v_ArrVal_801 (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ .cse4 1) v_ArrVal_806) (< v_ArrVal_766 (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))))))))))))))) is different from false [2021-12-06 22:44:32,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_790 Int) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_779 Int) (v_ArrVal_801 Int) (v_ArrVal_766 Int) (v_ArrVal_810 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse0 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_766)))) (let ((.cse1 (store .cse14 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse12 (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_779)))) (let ((.cse3 (store .cse12 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse9 (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store (select (store .cse12 |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_790)))) (store .cse10 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~j~0#1.offset|) 1))))))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|)) (.cse2 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.offset|))) (or (< v_ArrVal_766 (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< v_ArrVal_779 (+ (select (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ .cse2 1) v_ArrVal_806) (< v_ArrVal_790 (+ (select (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_810) (<= 10 .cse2) (< v_ArrVal_801 (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))))))))))))))) is different from false [2021-12-06 22:44:49,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 Int) (v_ArrVal_779 Int) (v_ArrVal_801 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_756 Int) (v_ArrVal_766 Int) (v_ArrVal_810 Int) (|ULTIMATE.start_main_~c~0#1.base| Int) (v_ArrVal_777 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_790 Int) (v_ArrVal_807 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse20 |c_ULTIMATE.start_main_~j~0#1.offset|))))))) (let ((.cse17 (let ((.cse18 (store .cse3 |ULTIMATE.start_main_~c~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_761) |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_756)))) (store .cse18 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~j~0#1.offset|) 1))))))) (let ((.cse6 (select .cse17 |ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse15 (store .cse17 |ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_766)))) (let ((.cse5 (store .cse15 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse13 (store .cse5 |ULTIMATE.start_main_~c~0#1.base| (store (select (store .cse15 |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_777) |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_779)))) (let ((.cse7 (store .cse13 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~j~0#1.offset|) 1)))))) (let ((.cse10 (let ((.cse11 (store .cse7 |ULTIMATE.start_main_~c~0#1.base| (store (select (store .cse13 |c_ULTIMATE.start_main_~j~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_790)))) (store .cse11 |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~j~0#1.offset|) 1))))))) (let ((.cse0 (select .cse10 |ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (store .cse10 |ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_801)))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store .cse9 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_806)) |ULTIMATE.start_main_~c~0#1.base| v_ArrVal_807))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|)) (.cse4 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.offset|))) (or (< v_ArrVal_801 (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_810 (- 1)))) |ULTIMATE.start_main_~c~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< v_ArrVal_756 (+ (select (select .cse3 |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< (+ .cse4 1) v_ArrVal_806) (< (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|)) v_ArrVal_810) (<= 10 .cse4) (< v_ArrVal_779 (+ (select (select .cse5 |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< v_ArrVal_766 (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)) (< v_ArrVal_790 (+ (select (select .cse7 |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))))))))))))) is different from false [2021-12-06 22:45:06,035 INFO L354 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2021-12-06 22:45:06,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 223420 treesize of output 133629 [2021-12-06 22:45:07,261 INFO L354 Elim1Store]: treesize reduction 17, result has 57.5 percent of original size [2021-12-06 22:45:07,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66825 treesize of output 51869 [2021-12-06 22:45:07,426 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:45:07,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 76769 treesize of output 51832 [2021-12-06 22:51:23,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 154337 treesize of output 152805 [2021-12-06 22:51:24,870 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:51:24,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36100 treesize of output 35304 [2021-12-06 22:51:26,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 73642 treesize of output 72488 [2021-12-06 22:51:27,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 79953 treesize of output 78545 [2021-12-06 22:51:28,348 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:51:28,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 84849 treesize of output 84125 [2021-12-06 22:51:30,258 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 22:51:30,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 47627 treesize of output 46902 [2021-12-06 22:51:31,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32630 treesize of output 30590 [2021-12-06 22:51:32,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57278 treesize of output 53186