./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/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_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt --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 6441f2629f7ca5357ff69069fc5c217332d52665 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: integer overflow --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:01:27,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:01:27,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:01:27,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:01:27,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:01:27,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:01:27,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:01:27,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:01:27,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:01:27,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:01:27,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:01:27,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:01:27,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:01:27,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:01:27,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:01:27,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:01:27,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:01:27,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:01:27,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:01:27,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:01:27,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:01:27,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:01:27,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:01:27,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:01:27,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:01:27,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:01:27,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:01:27,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:01:27,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:01:27,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:01:27,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:01:27,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:01:27,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:01:27,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:01:27,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:01:27,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:01:27,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:01:27,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:01:27,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:01:27,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:01:27,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:01:27,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-10-13 00:01:27,269 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:01:27,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:01:27,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:01:27,270 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:01:27,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:01:27,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:01:27,272 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:01:27,272 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 00:01:27,272 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 00:01:27,272 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 00:01:27,272 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 00:01:27,273 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 00:01:27,273 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 00:01:27,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:01:27,273 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:01:27,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:01:27,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:01:27,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 00:01:27,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 00:01:27,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 00:01:27,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:01:27,275 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 00:01:27,275 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:01:27,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 00:01:27,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:01:27,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:01:27,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:01:27,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:01:27,276 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:01:27,277 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 00:01:27,277 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_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/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_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt 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 -> 6441f2629f7ca5357ff69069fc5c217332d52665 [2021-10-13 00:01:27,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:01:27,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:01:27,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:01:27,658 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:01:27,658 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:01:27,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-10-13 00:01:27,734 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/data/5ac4c3db4/f31a53f70855417b9c795c963f5386da/FLAG903be64fa [2021-10-13 00:01:28,266 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:01:28,267 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-10-13 00:01:28,289 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/data/5ac4c3db4/f31a53f70855417b9c795c963f5386da/FLAG903be64fa [2021-10-13 00:01:28,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/data/5ac4c3db4/f31a53f70855417b9c795c963f5386da [2021-10-13 00:01:28,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:01:28,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:01:28,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:01:28,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:01:28,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:01:28,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:28" (1/1) ... [2021-10-13 00:01:28,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f838deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:28, skipping insertion in model container [2021-10-13 00:01:28,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:28" (1/1) ... [2021-10-13 00:01:28,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:01:28,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:01:28,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:01:28,968 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:01:29,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:01:29,046 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:01:29,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29 WrapperNode [2021-10-13 00:01:29,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:01:29,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:01:29,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:01:29,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:01:29,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:01:29,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:01:29,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:01:29,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:01:29,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:01:29,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:01:29,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:01:29,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:01:29,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (1/1) ... [2021-10-13 00:01:29,118 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:01:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:29,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:01:29,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 00:01:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 00:01:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:01:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:01:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:01:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:01:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:01:29,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:01:29,386 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-10-13 00:01:29,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:01:29 BoogieIcfgContainer [2021-10-13 00:01:29,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:01:29,389 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 00:01:29,389 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 00:01:29,392 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 00:01:29,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:01:29,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 12:01:28" (1/3) ... [2021-10-13 00:01:29,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@208f5c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:01:29, skipping insertion in model container [2021-10-13 00:01:29,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:01:29,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:29" (2/3) ... [2021-10-13 00:01:29,395 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@208f5c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:01:29, skipping insertion in model container [2021-10-13 00:01:29,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:01:29,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:01:29" (3/3) ... [2021-10-13 00:01:29,396 INFO L389 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2021-10-13 00:01:29,433 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 00:01:29,433 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 00:01:29,433 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 00:01:29,433 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 00:01:29,433 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 00:01:29,433 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 00:01:29,433 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 00:01:29,434 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 00:01:29,444 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-10-13 00:01:29,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-13 00:01:29,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:29,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:29,465 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:29,465 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-13 00:01:29,465 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 00:01:29,466 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-10-13 00:01:29,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-13 00:01:29,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:29,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:29,468 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:29,468 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-13 00:01:29,473 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 6#L552-4true [2021-10-13 00:01:29,473 INFO L793 eck$LassoCheckResult]: Loop: 6#L552-4true call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 13#L552-1true assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 12#L553-4true assume !true; 5#L552-3true call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 6#L552-4true [2021-10-13 00:01:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:29,479 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-13 00:01:29,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:29,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692834476] [2021-10-13 00:01:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:29,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:29,600 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:29,647 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:29,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2021-10-13 00:01:29,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:29,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908093794] [2021-10-13 00:01:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:29,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:29,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:29,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908093794] [2021-10-13 00:01:29,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908093794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:29,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:29,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:01:29,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276513226] [2021-10-13 00:01:29,709 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:29,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:29,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 00:01:29,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 00:01:29,727 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-10-13 00:01:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:29,733 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-10-13 00:01:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 00:01:29,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-10-13 00:01:29,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-13 00:01:29,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2021-10-13 00:01:29,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-10-13 00:01:29,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-10-13 00:01:29,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2021-10-13 00:01:29,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:29,752 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-10-13 00:01:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2021-10-13 00:01:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-13 00:01:29,791 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-10-13 00:01:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-10-13 00:01:29,801 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-10-13 00:01:29,801 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-10-13 00:01:29,802 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 00:01:29,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-10-13 00:01:29,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-10-13 00:01:29,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:29,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:29,803 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:29,803 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-10-13 00:01:29,804 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 33#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 35#L552-4 [2021-10-13 00:01:29,804 INFO L793 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 36#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 38#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 39#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 34#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 35#L552-4 [2021-10-13 00:01:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-13 00:01:29,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:29,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550278627] [2021-10-13 00:01:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:29,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:29,845 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:29,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2021-10-13 00:01:29,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:29,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059180731] [2021-10-13 00:01:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:29,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:29,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:29,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059180731] [2021-10-13 00:01:29,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059180731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:01:29,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:01:29,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:01:29,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201225514] [2021-10-13 00:01:29,968 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:29,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:29,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:01:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:01:29,975 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-10-13 00:01:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:30,039 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-10-13 00:01:30,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:01:30,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2021-10-13 00:01:30,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-10-13 00:01:30,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2021-10-13 00:01:30,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-10-13 00:01:30,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-10-13 00:01:30,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-10-13 00:01:30,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:30,046 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-10-13 00:01:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-10-13 00:01:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-10-13 00:01:30,047 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-10-13 00:01:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-10-13 00:01:30,049 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-10-13 00:01:30,050 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-10-13 00:01:30,050 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 00:01:30,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-10-13 00:01:30,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-10-13 00:01:30,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:30,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:30,052 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:30,052 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-10-13 00:01:30,053 INFO L791 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 60#L552-4 [2021-10-13 00:01:30,053 INFO L793 eck$LassoCheckResult]: Loop: 60#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 63#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 67#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 66#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 64#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 65#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 68#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 59#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 60#L552-4 [2021-10-13 00:01:30,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:30,058 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-13 00:01:30,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:30,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570842938] [2021-10-13 00:01:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:30,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:30,097 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:30,145 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2021-10-13 00:01:30,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:30,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563875846] [2021-10-13 00:01:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:30,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:30,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:30,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563875846] [2021-10-13 00:01:30,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563875846] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:30,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293001939] [2021-10-13 00:01:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:30,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:01:30,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:30,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:01:30,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 00:01:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:30,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 00:01:30,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:01:30,444 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-10-13 00:01:30,522 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:30,522 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 5 case distinctions, treesize of input 114 treesize of output 90 [2021-10-13 00:01:30,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:30,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:30,687 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 35 treesize of output 27 [2021-10-13 00:01:30,751 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:30,752 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-10-13 00:01:30,784 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:30,785 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-10-13 00:01:30,819 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 33 treesize of output 17 [2021-10-13 00:01:30,846 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 23 treesize of output 11 [2021-10-13 00:01:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:30,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293001939] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:30,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:01:30,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-10-13 00:01:30,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883163619] [2021-10-13 00:01:30,865 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:30,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:01:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:01:30,867 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.3) internal successors, (13), 10 states have internal predecessors, (13), 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-10-13 00:01:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:30,950 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2021-10-13 00:01:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:01:30,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2021-10-13 00:01:30,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-10-13 00:01:30,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2021-10-13 00:01:30,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-13 00:01:30,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-10-13 00:01:30,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2021-10-13 00:01:30,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:30,958 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-10-13 00:01:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2021-10-13 00:01:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-10-13 00:01:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 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-10-13 00:01:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-10-13 00:01:30,961 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-10-13 00:01:30,961 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-10-13 00:01:30,962 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 00:01:30,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2021-10-13 00:01:30,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-10-13 00:01:30,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:30,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:30,965 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:30,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 1, 1, 1, 1] [2021-10-13 00:01:30,967 INFO L791 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 127#L552-4 [2021-10-13 00:01:30,967 INFO L793 eck$LassoCheckResult]: Loop: 127#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 128#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 133#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 139#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 129#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 130#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 131#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 132#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 138#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 137#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 135#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 136#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 134#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 126#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 127#L552-4 [2021-10-13 00:01:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-13 00:01:30,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:30,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859688303] [2021-10-13 00:01:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:30,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:31,002 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:31,028 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1818601484, now seen corresponding path program 2 times [2021-10-13 00:01:31,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:31,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716317308] [2021-10-13 00:01:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:31,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:31,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:31,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716317308] [2021-10-13 00:01:31,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716317308] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:31,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294511299] [2021-10-13 00:01:31,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:01:31,492 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:01:31,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:31,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:01:31,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 00:01:31,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:01:31,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:01:31,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 00:01:31,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:01:31,587 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-10-13 00:01:31,665 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:31,666 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 5 case distinctions, treesize of input 114 treesize of output 90 [2021-10-13 00:01:31,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:31,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:31,725 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 35 treesize of output 27 [2021-10-13 00:01:31,779 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:31,780 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:31,897 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:31,897 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 50 treesize of output 61 [2021-10-13 00:01:32,066 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:32,067 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:32,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:32,156 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 27 treesize of output 19 [2021-10-13 00:01:32,192 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 13 treesize of output 9 [2021-10-13 00:01:32,302 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 42 treesize of output 26 [2021-10-13 00:01:32,319 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:32,320 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 1 case distinctions, treesize of input 42 treesize of output 26 [2021-10-13 00:01:32,433 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:32,433 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 50 treesize of output 61 [2021-10-13 00:01:32,595 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:32,595 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:32,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:32,647 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 35 treesize of output 27 [2021-10-13 00:01:32,731 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 34 treesize of output 18 [2021-10-13 00:01:32,743 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:32,744 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 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:32,801 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 33 treesize of output 17 [2021-10-13 00:01:32,828 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 23 treesize of output 11 [2021-10-13 00:01:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:32,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294511299] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:32,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:01:32,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2021-10-13 00:01:32,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215412868] [2021-10-13 00:01:32,839 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:32,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 00:01:32,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:01:32,843 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 2 Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:33,080 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-10-13 00:01:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:01:33,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2021-10-13 00:01:33,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2021-10-13 00:01:33,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2021-10-13 00:01:33,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:01:33,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:01:33,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2021-10-13 00:01:33,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:33,082 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-10-13 00:01:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2021-10-13 00:01:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-10-13 00:01:33,084 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-10-13 00:01:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-10-13 00:01:33,084 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-10-13 00:01:33,084 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-10-13 00:01:33,085 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 00:01:33,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-10-13 00:01:33,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-10-13 00:01:33,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:33,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:33,086 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:33,086 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2021-10-13 00:01:33,086 INFO L791 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 231#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 229#L552-4 [2021-10-13 00:01:33,086 INFO L793 eck$LassoCheckResult]: Loop: 229#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 232#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 237#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 246#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 233#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 234#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 235#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 236#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 245#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 244#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 243#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 242#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 241#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 239#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 240#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 238#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 228#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 229#L552-4 [2021-10-13 00:01:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-13 00:01:33,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:33,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965969553] [2021-10-13 00:01:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:33,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:33,099 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:33,115 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:33,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 3 times [2021-10-13 00:01:33,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:33,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542728886] [2021-10-13 00:01:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:33,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:33,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:33,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542728886] [2021-10-13 00:01:33,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542728886] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:33,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295254506] [2021-10-13 00:01:33,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 00:01:33,612 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:01:33,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:33,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:01:33,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 00:01:33,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-10-13 00:01:33,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:01:33,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 00:01:33,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:01:33,763 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-10-13 00:01:33,810 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:33,811 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 5 case distinctions, treesize of input 114 treesize of output 90 [2021-10-13 00:01:33,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:33,845 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 35 treesize of output 27 [2021-10-13 00:01:33,881 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:33,881 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2021-10-13 00:01:33,972 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:33,973 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 50 treesize of output 61 [2021-10-13 00:01:34,127 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:34,128 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:34,152 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 13 treesize of output 9 [2021-10-13 00:01:34,260 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 34 treesize of output 18 [2021-10-13 00:01:34,280 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:34,280 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 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:34,406 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:34,406 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 50 treesize of output 61 [2021-10-13 00:01:34,563 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:34,564 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:34,586 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 35 treesize of output 27 [2021-10-13 00:01:34,646 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:34,647 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2021-10-13 00:01:34,770 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:34,770 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 50 treesize of output 61 [2021-10-13 00:01:34,925 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:34,925 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:34,956 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 13 treesize of output 9 [2021-10-13 00:01:35,113 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:35,116 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 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:35,125 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 34 treesize of output 18 [2021-10-13 00:01:35,187 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 33 treesize of output 17 [2021-10-13 00:01:35,217 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 23 treesize of output 11 [2021-10-13 00:01:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:35,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295254506] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:35,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:01:35,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2021-10-13 00:01:35,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491680340] [2021-10-13 00:01:35,227 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:35,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-13 00:01:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:01:35,230 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-10-13 00:01:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:35,566 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-10-13 00:01:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:01:35,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2021-10-13 00:01:35,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-10-13 00:01:35,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2021-10-13 00:01:35,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-10-13 00:01:35,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-10-13 00:01:35,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2021-10-13 00:01:35,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:35,569 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-10-13 00:01:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2021-10-13 00:01:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-10-13 00:01:35,571 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-10-13 00:01:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-10-13 00:01:35,571 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-10-13 00:01:35,571 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-10-13 00:01:35,572 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 00:01:35,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-10-13 00:01:35,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-10-13 00:01:35,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:35,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:35,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:35,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2021-10-13 00:01:35,574 INFO L791 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 357#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 355#L552-4 [2021-10-13 00:01:35,574 INFO L793 eck$LassoCheckResult]: Loop: 355#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 358#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 363#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 375#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 359#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 360#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 361#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 362#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 374#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 373#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 372#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 371#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 370#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 369#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 368#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 367#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 365#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 366#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 364#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 354#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 355#L552-4 [2021-10-13 00:01:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-13 00:01:35,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:35,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730993575] [2021-10-13 00:01:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:35,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:35,583 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:35,592 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1966644716, now seen corresponding path program 4 times [2021-10-13 00:01:35,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:35,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321711452] [2021-10-13 00:01:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:35,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:35,635 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:35,663 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:35,664 INFO L82 PathProgramCache]: Analyzing trace with hash -872207186, now seen corresponding path program 1 times [2021-10-13 00:01:35,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:35,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258132731] [2021-10-13 00:01:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:35,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:35,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:35,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258132731] [2021-10-13 00:01:35,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258132731] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:35,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320467025] [2021-10-13 00:01:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:35,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:01:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:35,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:01:35,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 00:01:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:36,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-13 00:01:36,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:01:36,029 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 14 treesize of output 12 [2021-10-13 00:01:36,047 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-10-13 00:01:36,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:01:36,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 22 [2021-10-13 00:01:36,091 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 25 treesize of output 13 [2021-10-13 00:01:36,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:01:36,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 22 [2021-10-13 00:01:36,135 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 25 treesize of output 13 [2021-10-13 00:01:36,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:01:36,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 22 [2021-10-13 00:01:36,178 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 25 treesize of output 13 [2021-10-13 00:01:36,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:01:36,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 22 [2021-10-13 00:01:36,222 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 25 treesize of output 13 [2021-10-13 00:01:36,270 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-10-13 00:01:36,271 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 5 case distinctions, treesize of input 118 treesize of output 66 [2021-10-13 00:01:36,292 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 34 treesize of output 18 [2021-10-13 00:01:36,308 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 25 treesize of output 13 [2021-10-13 00:01:36,323 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-10-13 00:01:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:36,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320467025] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:36,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:01:36,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 24 [2021-10-13 00:01:36,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028752596] [2021-10-13 00:01:46,651 WARN L207 SmtUtils]: Spent 10.32 s on a formula simplification. DAG size of input: 169 DAG size of output: 158 [2021-10-13 00:01:48,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:48,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-13 00:01:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:01:48,212 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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-10-13 00:01:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:48,473 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-10-13 00:01:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:01:48,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2021-10-13 00:01:48,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2021-10-13 00:01:48,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2021-10-13 00:01:48,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-10-13 00:01:48,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-10-13 00:01:48,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2021-10-13 00:01:48,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:48,476 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-10-13 00:01:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2021-10-13 00:01:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-10-13 00:01:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-10-13 00:01:48,478 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-10-13 00:01:48,478 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-10-13 00:01:48,478 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-13 00:01:48,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-10-13 00:01:48,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-10-13 00:01:48,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:48,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:48,480 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:48,480 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 1, 1, 1, 1] [2021-10-13 00:01:48,480 INFO L791 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 507#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 509#L552-4 [2021-10-13 00:01:48,481 INFO L793 eck$LassoCheckResult]: Loop: 509#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 510#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 515#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 530#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 511#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 512#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 513#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 514#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 529#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 528#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 527#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 526#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 525#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 524#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 523#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 522#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 521#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 520#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 519#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 517#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 518#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 516#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 508#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 509#L552-4 [2021-10-13 00:01:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:48,481 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-13 00:01:48,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:48,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597058254] [2021-10-13 00:01:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:48,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:48,489 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:48,497 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 665592497, now seen corresponding path program 5 times [2021-10-13 00:01:48,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:48,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012868025] [2021-10-13 00:01:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:48,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:49,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:49,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012868025] [2021-10-13 00:01:49,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012868025] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:49,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418089799] [2021-10-13 00:01:49,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-13 00:01:49,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:01:49,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:49,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:01:49,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 00:01:49,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-10-13 00:01:49,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:01:49,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 00:01:49,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:01:49,568 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-10-13 00:01:49,614 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:49,617 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 5 case distinctions, treesize of input 114 treesize of output 90 [2021-10-13 00:01:49,651 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:49,651 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2021-10-13 00:01:49,737 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 19 treesize of output 11 [2021-10-13 00:01:49,747 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 7 treesize of output 3 [2021-10-13 00:01:49,886 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:49,886 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 57 treesize of output 64 [2021-10-13 00:01:50,038 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:50,038 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:50,064 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 13 treesize of output 9 [2021-10-13 00:01:50,135 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:50,135 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2021-10-13 00:01:50,266 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:50,267 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 50 treesize of output 61 [2021-10-13 00:01:50,422 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:50,422 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:50,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:50,476 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 35 treesize of output 27 [2021-10-13 00:01:50,553 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 67 treesize of output 47 [2021-10-13 00:01:50,589 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:50,589 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 1 case distinctions, treesize of input 67 treesize of output 47 [2021-10-13 00:01:50,708 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:50,709 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 57 treesize of output 64 [2021-10-13 00:01:50,859 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:50,859 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:50,881 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 13 treesize of output 9 [2021-10-13 00:01:51,004 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 67 treesize of output 47 [2021-10-13 00:01:51,040 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:51,041 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 1 case distinctions, treesize of input 67 treesize of output 47 [2021-10-13 00:01:51,167 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:51,167 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 57 treesize of output 64 [2021-10-13 00:01:51,315 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:51,315 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:51,330 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 13 treesize of output 9 [2021-10-13 00:01:51,459 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:51,459 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 1 case distinctions, treesize of input 59 treesize of output 39 [2021-10-13 00:01:51,472 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 59 treesize of output 39 [2021-10-13 00:01:51,619 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:51,619 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 57 treesize of output 64 [2021-10-13 00:01:51,804 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-10-13 00:01:51,805 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 5 case distinctions, treesize of input 123 treesize of output 71 [2021-10-13 00:01:51,827 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-13 00:01:51,839 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:51,840 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:51,877 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 25 treesize of output 13 [2021-10-13 00:01:51,914 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-10-13 00:01:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:51,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418089799] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:51,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:01:51,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 34 [2021-10-13 00:01:51,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772668298] [2021-10-13 00:01:51,920 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:51,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-13 00:01:51,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 00:01:51,922 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:52,557 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-10-13 00:01:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-13 00:01:52,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2021-10-13 00:01:52,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-10-13 00:01:52,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2021-10-13 00:01:52,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-10-13 00:01:52,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-10-13 00:01:52,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2021-10-13 00:01:52,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:52,560 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-10-13 00:01:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2021-10-13 00:01:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-10-13 00:01:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:01:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-10-13 00:01:52,563 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-10-13 00:01:52,563 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-10-13 00:01:52,563 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-13 00:01:52,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2021-10-13 00:01:52,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-10-13 00:01:52,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:52,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:52,566 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:52,567 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 1, 1, 1, 1] [2021-10-13 00:01:52,567 INFO L791 eck$LassoCheckResult]: Stem: 679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 680#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 678#L552-4 [2021-10-13 00:01:52,567 INFO L793 eck$LassoCheckResult]: Loop: 678#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 681#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 686#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 704#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 682#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 683#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 684#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 685#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 703#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 702#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 701#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 700#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 699#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 698#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 697#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 696#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 695#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 694#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 693#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 692#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 691#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 690#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 688#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 689#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 687#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 677#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 678#L552-4 [2021-10-13 00:01:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-13 00:01:52,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:52,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480353505] [2021-10-13 00:01:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:52,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:52,576 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:52,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1196184628, now seen corresponding path program 6 times [2021-10-13 00:01:52,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:52,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139555537] [2021-10-13 00:01:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:52,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:53,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:53,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139555537] [2021-10-13 00:01:53,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139555537] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:53,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289188186] [2021-10-13 00:01:53,495 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-13 00:01:53,495 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:01:53,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:53,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:01:53,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 00:01:53,828 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-10-13 00:01:53,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:01:53,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 00:01:53,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:01:53,848 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-10-13 00:01:53,888 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:53,889 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 5 case distinctions, treesize of input 114 treesize of output 90 [2021-10-13 00:01:53,909 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 35 treesize of output 27 [2021-10-13 00:01:53,948 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:53,949 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:53,967 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-13 00:01:54,060 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:54,061 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 50 treesize of output 61 [2021-10-13 00:01:54,201 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:54,201 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:54,227 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 35 treesize of output 27 [2021-10-13 00:01:54,288 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:54,289 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:54,328 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-13 00:01:54,418 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:54,419 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 50 treesize of output 61 [2021-10-13 00:01:54,572 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:54,572 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:54,592 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 13 treesize of output 9 [2021-10-13 00:01:54,689 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:54,689 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 1 case distinctions, treesize of input 42 treesize of output 26 [2021-10-13 00:01:54,696 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 42 treesize of output 26 [2021-10-13 00:01:54,824 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:54,825 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 50 treesize of output 61 [2021-10-13 00:01:55,031 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:55,032 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:55,054 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 13 treesize of output 9 [2021-10-13 00:01:55,091 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-13 00:01:55,129 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 67 treesize of output 47 [2021-10-13 00:01:55,143 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:55,143 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 1 case distinctions, treesize of input 67 treesize of output 47 [2021-10-13 00:01:55,239 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:55,240 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 57 treesize of output 64 [2021-10-13 00:01:55,357 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:55,358 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:55,384 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 35 treesize of output 27 [2021-10-13 00:01:55,520 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 34 treesize of output 18 [2021-10-13 00:01:55,534 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:55,534 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 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:55,653 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:55,654 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 50 treesize of output 61 [2021-10-13 00:01:55,796 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:55,796 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:55,829 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 13 treesize of output 9 [2021-10-13 00:01:55,934 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:55,934 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 1 case distinctions, treesize of input 67 treesize of output 47 [2021-10-13 00:01:55,945 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 67 treesize of output 47 [2021-10-13 00:01:56,065 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:56,065 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 57 treesize of output 64 [2021-10-13 00:01:56,215 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-10-13 00:01:56,216 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 5 case distinctions, treesize of input 123 treesize of output 71 [2021-10-13 00:01:56,263 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-10-13 00:01:56,263 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2021-10-13 00:01:56,309 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 25 treesize of output 13 [2021-10-13 00:01:56,347 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-10-13 00:01:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:56,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289188186] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:56,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:01:56,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 39 [2021-10-13 00:01:56,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862279821] [2021-10-13 00:01:56,353 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:01:56,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:01:56,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-10-13 00:01:56,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2021-10-13 00:01:56,355 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. cyclomatic complexity: 2 Second operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 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-10-13 00:01:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:01:57,043 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2021-10-13 00:01:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-13 00:01:57,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 33 transitions. [2021-10-13 00:01:57,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2021-10-13 00:01:57,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 33 transitions. [2021-10-13 00:01:57,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-10-13 00:01:57,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-10-13 00:01:57,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 33 transitions. [2021-10-13 00:01:57,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:01:57,046 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-10-13 00:01:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 33 transitions. [2021-10-13 00:01:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-10-13 00:01:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 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-10-13 00:01:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-10-13 00:01:57,048 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-10-13 00:01:57,048 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-10-13 00:01:57,048 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-13 00:01:57,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 32 transitions. [2021-10-13 00:01:57,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-10-13 00:01:57,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:01:57,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:01:57,049 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:01:57,049 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 1, 1, 1, 1] [2021-10-13 00:01:57,050 INFO L791 eck$LassoCheckResult]: Stem: 876#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 877#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 875#L552-4 [2021-10-13 00:01:57,050 INFO L793 eck$LassoCheckResult]: Loop: 875#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 878#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 883#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 904#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 879#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 880#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 881#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 882#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 903#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 902#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 901#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 900#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 899#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 898#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 897#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 896#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 895#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 894#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 893#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 892#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 891#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 890#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 889#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 888#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 887#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 885#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 886#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 884#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 874#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 875#L552-4 [2021-10-13 00:01:57,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:57,050 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-13 00:01:57,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:57,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185613114] [2021-10-13 00:01:57,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:57,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:57,069 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:01:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:01:57,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:01:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:01:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash -190854959, now seen corresponding path program 7 times [2021-10-13 00:01:57,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:01:57,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276112782] [2021-10-13 00:01:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:01:57,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:01:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:01:58,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:01:58,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276112782] [2021-10-13 00:01:58,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276112782] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:01:58,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439759100] [2021-10-13 00:01:58,069 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 00:01:58,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:01:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:01:58,088 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:01:58,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 00:01:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:01:58,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-13 00:01:58,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:01:58,284 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-10-13 00:01:58,328 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:58,328 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 5 case distinctions, treesize of input 114 treesize of output 90 [2021-10-13 00:01:58,349 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-13 00:01:58,370 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:58,370 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2021-10-13 00:01:58,419 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 7 treesize of output 3 [2021-10-13 00:01:58,563 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:58,563 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 57 treesize of output 64 [2021-10-13 00:01:58,702 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:58,703 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:58,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:58,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:58,728 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 27 treesize of output 19 [2021-10-13 00:01:58,747 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 13 treesize of output 9 [2021-10-13 00:01:58,777 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:01:58,777 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 47 [2021-10-13 00:01:58,875 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:58,875 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 50 treesize of output 61 [2021-10-13 00:01:58,990 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:58,990 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:59,070 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 13 treesize of output 9 [2021-10-13 00:01:59,170 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 59 treesize of output 39 [2021-10-13 00:01:59,196 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:59,197 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 1 case distinctions, treesize of input 59 treesize of output 39 [2021-10-13 00:01:59,313 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:59,313 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 57 treesize of output 64 [2021-10-13 00:01:59,465 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:59,465 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:59,515 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 35 treesize of output 27 [2021-10-13 00:01:59,591 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:01:59,591 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 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:01:59,597 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 34 treesize of output 18 [2021-10-13 00:01:59,734 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:01:59,734 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 50 treesize of output 61 [2021-10-13 00:01:59,862 INFO L354 Elim1Store]: treesize reduction 34, result has 58.0 percent of original size [2021-10-13 00:01:59,862 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 5 case distinctions, treesize of input 139 treesize of output 111 [2021-10-13 00:01:59,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-13 00:01:59,914 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 27 treesize of output 19 [2021-10-13 00:01:59,972 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 13 treesize of output 9 [2021-10-13 00:02:00,030 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 00:02:00,030 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 1 case distinctions, treesize of input 42 treesize of output 26 [2021-10-13 00:02:00,039 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 42 treesize of output 26 [2021-10-13 00:02:00,144 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-13 00:02:00,144 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 50 treesize of output 61 [2021-10-13 00:02:00,338 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-10-13 00:02:00,338 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 5 case distinctions, treesize of input 114 treesize of output 62 [2021-10-13 00:02:00,353 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:02:00,353 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-10-13 00:02:00,410 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 25 treesize of output 13 [2021-10-13 00:02:00,478 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-10-13 00:02:00,478 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 5 case distinctions, treesize of input 114 treesize of output 62 [2021-10-13 00:02:00,492 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-13 00:02:00,504 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-13 00:02:00,504 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-10-13 00:02:00,554 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 25 treesize of output 13 [2021-10-13 00:02:00,636 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-10-13 00:02:00,637 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 5 case distinctions, treesize of input 123 treesize of output 71 [2021-10-13 00:02:00,689 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-10-13 00:02:00,689 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2021-10-13 00:02:00,731 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 25 treesize of output 13 [2021-10-13 00:02:00,771 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-10-13 00:02:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:02:00,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439759100] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:02:00,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:02:00,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 44 [2021-10-13 00:02:00,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848986233] [2021-10-13 00:02:00,777 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:02:00,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-10-13 00:02:00,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2021-10-13 00:02:00,779 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 44 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 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-10-13 00:02:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:01,539 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2021-10-13 00:02:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-13 00:02:01,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2021-10-13 00:02:01,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2021-10-13 00:02:01,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2021-10-13 00:02:01,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-10-13 00:02:01,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-10-13 00:02:01,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2021-10-13 00:02:01,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:02:01,541 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-10-13 00:02:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2021-10-13 00:02:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-10-13 00:02:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 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-10-13 00:02:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-10-13 00:02:01,543 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-10-13 00:02:01,543 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-10-13 00:02:01,543 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-13 00:02:01,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2021-10-13 00:02:01,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-10-13 00:02:01,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:02:01,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:02:01,544 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:02:01,544 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2021-10-13 00:02:01,544 INFO L791 eck$LassoCheckResult]: Stem: 1087#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1088#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 1090#L552-4 [2021-10-13 00:02:01,545 INFO L793 eck$LassoCheckResult]: Loop: 1090#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1091#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 1096#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1120#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1092#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1093#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1094#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1095#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1119#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1118#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1117#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1116#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1115#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1114#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1113#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1112#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1111#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1110#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1109#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1108#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1107#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1106#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1105#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1104#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1103#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1102#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1101#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1100#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 1098#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 1099#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 1097#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 1089#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6; 1090#L552-4 [2021-10-13 00:02:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:01,545 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-13 00:02:01,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:01,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311146742] [2021-10-13 00:02:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:01,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:02:01,564 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:02:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:02:01,570 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:02:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:01,571 INFO L82 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 8 times [2021-10-13 00:02:01,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:01,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050023401] [2021-10-13 00:02:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:01,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:02:01,608 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:02:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:02:01,647 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:02:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 2 times [2021-10-13 00:02:01,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:01,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915910555] [2021-10-13 00:02:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:01,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:02:01,688 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:02:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:02:01,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:02:59,326 WARN L207 SmtUtils]: Spent 57.59 s on a formula simplification. DAG size of input: 257 DAG size of output: 247 [2021-10-13 00:03:06,974 INFO L210 LassoAnalysis]: Preferences: [2021-10-13 00:03:06,975 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-13 00:03:06,975 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-13 00:03:06,975 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-13 00:03:06,975 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-13 00:03:06,975 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:03:06,975 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-13 00:03:06,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-13 00:03:06,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration10_Lasso [2021-10-13 00:03:06,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-13 00:03:06,976 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-13 00:03:06,985 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ArithmeticException: integer overflow at java.base/java.lang.Math.toIntExact(Math.java:1071) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis$PreprocessingBenchmark.(LassoAnalysis.java:551) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:255) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 00:03:06,987 INFO L168 Benchmark]: Toolchain (without parser) took 98408.94 ms. Allocated memory was 132.1 MB in the beginning and 197.1 MB in the end (delta: 65.0 MB). Free memory was 92.5 MB in the beginning and 127.5 MB in the end (delta: -35.0 MB). Peak memory consumption was 127.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:03:06,987 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 132.1 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:03:06,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.05 ms. Allocated memory is still 132.1 MB. Free memory was 92.2 MB in the beginning and 101.1 MB in the end (delta: -8.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:03:06,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 132.1 MB. Free memory was 101.1 MB in the beginning and 99.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:03:06,989 INFO L168 Benchmark]: Boogie Preprocessor took 21.31 ms. Allocated memory is still 132.1 MB. Free memory was 99.7 MB in the beginning and 98.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:03:06,989 INFO L168 Benchmark]: RCFGBuilder took 282.95 ms. Allocated memory is still 132.1 MB. Free memory was 98.2 MB in the beginning and 87.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:03:06,990 INFO L168 Benchmark]: BuchiAutomizer took 97598.11 ms. Allocated memory was 132.1 MB in the beginning and 197.1 MB in the end (delta: 65.0 MB). Free memory was 87.7 MB in the beginning and 127.5 MB in the end (delta: -39.8 MB). Peak memory consumption was 125.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:03:06,992 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 132.1 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 454.05 ms. Allocated memory is still 132.1 MB. Free memory was 92.2 MB in the beginning and 101.1 MB in the end (delta: -8.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 132.1 MB. Free memory was 101.1 MB in the beginning and 99.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.31 ms. Allocated memory is still 132.1 MB. Free memory was 99.7 MB in the beginning and 98.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 282.95 ms. Allocated memory is still 132.1 MB. Free memory was 98.2 MB in the beginning and 87.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 97598.11 ms. Allocated memory was 132.1 MB in the beginning and 197.1 MB in the end (delta: 65.0 MB). Free memory was 87.7 MB in the beginning and 127.5 MB in the end (delta: -39.8 MB). Peak memory consumption was 125.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ArithmeticException: integer overflow de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ArithmeticException: integer overflow: java.base/java.lang.Math.toIntExact(Math.java:1071) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 00:03:07,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 00:03:07,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-13 00:03:07,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 00:03:07,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-10-13 00:03:07,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:03:08,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-13 00:03:08,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:03:08,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6713a496-e8f7-4363-be4b-30df38d27713/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...