./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/test27-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test27-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS --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 32bit --witnessprinter.graph.data.programhash 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 01:46:15,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:46:15,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:46:15,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:46:15,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:46:15,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:46:15,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:46:15,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:46:15,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:46:15,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:46:15,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:46:15,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:46:15,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:46:15,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:46:15,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:46:15,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:46:15,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:46:15,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:46:15,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:46:15,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:46:15,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:46:15,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:46:15,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:46:15,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:46:15,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:46:15,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:46:15,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:46:15,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:46:15,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:46:15,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:46:15,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:46:15,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:46:15,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:46:15,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:46:15,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:46:15,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:46:15,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:46:15,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:46:15,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:46:15,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:46:15,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:46:15,821 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-23 01:46:15,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:46:15,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:46:15,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:46:15,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:46:15,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:46:15,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:46:15,845 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:46:15,846 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-23 01:46:15,846 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-23 01:46:15,846 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-23 01:46:15,846 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-23 01:46:15,847 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-23 01:46:15,847 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-23 01:46:15,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:46:15,847 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:46:15,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:46:15,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:46:15,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:46:15,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:46:15,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-23 01:46:15,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-23 01:46:15,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-23 01:46:15,849 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:46:15,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:46:15,849 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-23 01:46:15,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:46:15,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-23 01:46:15,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:46:15,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:46:15,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:46:15,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:46:15,851 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-23 01:46:15,852 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_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/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_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 [2022-11-23 01:46:16,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:46:16,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:46:16,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:46:16,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:46:16,181 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:46:16,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/ldv-regression/test27-1.c [2022-11-23 01:46:19,139 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:46:19,340 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:46:19,340 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/sv-benchmarks/c/ldv-regression/test27-1.c [2022-11-23 01:46:19,346 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/data/078f552b3/85a2cfad94094c2a83c6672cf61c3b13/FLAG6082692a4 [2022-11-23 01:46:19,361 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/data/078f552b3/85a2cfad94094c2a83c6672cf61c3b13 [2022-11-23 01:46:19,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:46:19,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:46:19,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:46:19,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:46:19,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:46:19,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d323d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19, skipping insertion in model container [2022-11-23 01:46:19,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:46:19,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:46:19,557 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/sv-benchmarks/c/ldv-regression/test27-1.c[1154,1167] [2022-11-23 01:46:19,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:46:19,569 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:46:19,587 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/sv-benchmarks/c/ldv-regression/test27-1.c[1154,1167] [2022-11-23 01:46:19,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:46:19,600 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:46:19,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19 WrapperNode [2022-11-23 01:46:19,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:46:19,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:46:19,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:46:19,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:46:19,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,636 INFO L138 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2022-11-23 01:46:19,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:46:19,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:46:19,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:46:19,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:46:19,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:46:19,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:46:19,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:46:19,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:46:19,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (1/1) ... [2022-11-23 01:46:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:46:19,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:19,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:46:19,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-23 01:46:19,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 01:46:19,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:46:19,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:46:19,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 01:46:19,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:46:19,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:46:19,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:46:19,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:46:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 01:46:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:46:19,830 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:46:19,832 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:46:20,188 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:46:20,193 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:46:20,194 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 01:46:20,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:20 BoogieIcfgContainer [2022-11-23 01:46:20,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:46:20,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-23 01:46:20,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-23 01:46:20,200 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-23 01:46:20,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:46:20,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:46:19" (1/3) ... [2022-11-23 01:46:20,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e5dfdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:46:20, skipping insertion in model container [2022-11-23 01:46:20,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:46:20,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:19" (2/3) ... [2022-11-23 01:46:20,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e5dfdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:46:20, skipping insertion in model container [2022-11-23 01:46:20,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:46:20,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:20" (3/3) ... [2022-11-23 01:46:20,221 INFO L332 chiAutomizerObserver]: Analyzing ICFG test27-1.c [2022-11-23 01:46:20,301 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-23 01:46:20,301 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-23 01:46:20,302 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-23 01:46:20,302 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-23 01:46:20,302 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-23 01:46:20,302 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-23 01:46:20,302 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-23 01:46:20,302 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-23 01:46:20,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:20,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-23 01:46:20,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:46:20,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:46:20,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 01:46:20,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:46:20,336 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-23 01:46:20,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:20,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-23 01:46:20,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:46:20,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:46:20,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 01:46:20,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:46:20,348 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 13#L29-3true [2022-11-23 01:46:20,349 INFO L750 eck$LassoCheckResult]: Loop: 13#L29-3true assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 15#L29-2true main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13#L29-3true [2022-11-23 01:46:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-23 01:46:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:20,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507941655] [2022-11-23 01:46:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:20,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:20,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-23 01:46:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:20,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378043563] [2022-11-23 01:46:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:20,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:20,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:20,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-11-23 01:46:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:20,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129928974] [2022-11-23 01:46:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:20,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:20,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:22,025 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 01:46:22,026 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 01:46:22,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 01:46:22,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 01:46:22,027 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-23 01:46:22,027 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:46:22,027 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 01:46:22,027 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 01:46:22,027 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-1.c_Iteration1_Lasso [2022-11-23 01:46:22,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 01:46:22,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 01:46:22,047 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,057 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,061 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,690 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,692 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,701 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,704 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,708 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,712 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,714 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,721 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,724 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,728 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,731 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,734 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,741 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,743 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,746 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,748 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,750 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,752 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,755 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:22,766 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 01:46:23,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-23 01:46:23,237 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-23 01:46:23,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:46:23,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:23,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:46:23,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:46:23,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:46:23,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:46:23,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:46:23,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:46:23,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:46:23,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:46:23,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-23 01:46:23,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:46:23,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-23 01:46:23,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:46:23,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:23,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:46:23,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:46:23,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:46:23,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:46:23,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:46:23,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:46:23,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:46:23,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:46:23,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-23 01:46:23,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:46:23,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-23 01:46:23,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:46:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:23,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:46:23,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:46:23,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:46:23,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 01:46:23,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:46:23,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:46:23,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:46:23,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 01:46:23,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 01:46:23,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-23 01:46:23,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 01:46:23,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-23 01:46:23,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:46:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:23,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:46:23,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 01:46:23,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 01:46:23,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 01:46:23,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 01:46:23,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 01:46:23,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-23 01:46:23,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 01:46:23,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 01:46:23,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-23 01:46:23,548 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-11-23 01:46:23,548 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-11-23 01:46:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:46:23,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:23,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:46:23,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-23 01:46:23,651 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-23 01:46:23,672 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-23 01:46:23,672 INFO L513 LassoAnalysis]: Proved termination. [2022-11-23 01:46:23,673 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-11-23 01:46:23,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-23 01:46:23,805 INFO L156 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2022-11-23 01:46:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:23,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 01:46:23,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:46:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:23,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 01:46:23,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:46:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:23,943 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-23 01:46:23,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2022-11-23 01:46:24,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) Result 39 states and 56 transitions. Complement of second has 8 states. [2022-11-23 01:46:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-23 01:46:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2022-11-23 01:46:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-11-23 01:46:24,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2022-11-23 01:46:24,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:46:24,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-23 01:46:24,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:46:24,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2022-11-23 01:46:24,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 01:46:24,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2022-11-23 01:46:24,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:24,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2022-11-23 01:46:24,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-11-23 01:46:24,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-23 01:46:24,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-11-23 01:46:24,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:46:24,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-11-23 01:46:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-11-23 01:46:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-23 01:46:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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) [2022-11-23 01:46:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2022-11-23 01:46:24,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-11-23 01:46:24,073 INFO L428 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-11-23 01:46:24,073 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-23 01:46:24,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2022-11-23 01:46:24,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:24,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:46:24,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:46:24,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-23 01:46:24,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:46:24,074 INFO L748 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 202#L29-3 assume !(main_~j~0#1 < 10); 203#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 198#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 199#L43-3 [2022-11-23 01:46:24,074 INFO L750 eck$LassoCheckResult]: Loop: 199#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 206#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 199#L43-3 [2022-11-23 01:46:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2022-11-23 01:46:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:24,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858651233] [2022-11-23 01:46:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:24,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:24,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858651233] [2022-11-23 01:46:24,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858651233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:24,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:24,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:46:24,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637831111] [2022-11-23 01:46:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:24,184 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 01:46:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2022-11-23 01:46:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:24,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784383411] [2022-11-23 01:46:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:24,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:24,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:24,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:46:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:46:24,246 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) [2022-11-23 01:46:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:24,262 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-11-23 01:46:24,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2022-11-23 01:46:24,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:24,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2022-11-23 01:46:24,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-11-23 01:46:24,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-23 01:46:24,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2022-11-23 01:46:24,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:46:24,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-23 01:46:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2022-11-23 01:46:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-11-23 01:46:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-23 01:46:24,271 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-23 01:46:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:46:24,272 INFO L428 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-23 01:46:24,272 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-23 01:46:24,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-11-23 01:46:24,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:24,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:46:24,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:46:24,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:24,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:46:24,274 INFO L748 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 226#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 227#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 228#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 229#L29-3 assume !(main_~j~0#1 < 10); 230#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 223#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 224#L43-3 [2022-11-23 01:46:24,274 INFO L750 eck$LassoCheckResult]: Loop: 224#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 231#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 224#L43-3 [2022-11-23 01:46:24,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2022-11-23 01:46:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:24,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15608581] [2022-11-23 01:46:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15608581] [2022-11-23 01:46:24,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15608581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:46:24,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459206358] [2022-11-23 01:46:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:24,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:46:24,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:24,459 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:46:24,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 01:46:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:24,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 01:46:24,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:46:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:24,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:46:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:24,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459206358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:46:24,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:46:24,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 01:46:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076720489] [2022-11-23 01:46:24,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:46:24,619 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 01:46:24,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:24,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2022-11-23 01:46:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:24,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288248922] [2022-11-23 01:46:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:24,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:24,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:24,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:46:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:46:24,666 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:24,701 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-11-23 01:46:24,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2022-11-23 01:46:24,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:24,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2022-11-23 01:46:24,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-11-23 01:46:24,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-23 01:46:24,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2022-11-23 01:46:24,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:46:24,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-11-23 01:46:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2022-11-23 01:46:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-23 01:46:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-11-23 01:46:24,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-11-23 01:46:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:46:24,707 INFO L428 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-11-23 01:46:24,707 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-23 01:46:24,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2022-11-23 01:46:24,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:24,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:46:24,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:46:24,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-11-23 01:46:24,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:46:24,709 INFO L748 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 295#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 296#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 297#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 298#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 303#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 307#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 306#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 305#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 304#L29-3 assume !(main_~j~0#1 < 10); 301#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 293#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 294#L43-3 [2022-11-23 01:46:24,709 INFO L750 eck$LassoCheckResult]: Loop: 294#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 302#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 294#L43-3 [2022-11-23 01:46:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 2 times [2022-11-23 01:46:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:24,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039354454] [2022-11-23 01:46:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:24,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-11-23 01:46:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:24,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039354454] [2022-11-23 01:46:24,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039354454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:46:24,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022660610] [2022-11-23 01:46:24,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 01:46:24,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:46:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:24,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:46:24,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a643fc8-87d8-439b-913b-d75b7698862c/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 01:46:25,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 01:46:25,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 01:46:25,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 01:46:25,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:46:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:25,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:46:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:25,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022660610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:46:25,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:46:25,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-23 01:46:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645695589] [2022-11-23 01:46:25,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:46:25,240 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 01:46:25,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2022-11-23 01:46:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:25,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257361570] [2022-11-23 01:46:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:25,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:25,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 01:46:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-23 01:46:25,282 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:25,342 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-11-23 01:46:25,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2022-11-23 01:46:25,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:25,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2022-11-23 01:46:25,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-11-23 01:46:25,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-23 01:46:25,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2022-11-23 01:46:25,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:46:25,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-23 01:46:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2022-11-23 01:46:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 01:46:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-11-23 01:46:25,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-23 01:46:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 01:46:25,347 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-23 01:46:25,348 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-23 01:46:25,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2022-11-23 01:46:25,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-23 01:46:25,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:46:25,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:46:25,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2022-11-23 01:46:25,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 01:46:25,349 INFO L748 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 426#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 427#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 428#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 429#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 430#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 433#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 449#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 448#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 447#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 446#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 445#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 444#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 443#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 442#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 441#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 440#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 439#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 438#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 437#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 436#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 435#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 434#L29-3 assume !(main_~j~0#1 < 10); 431#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 423#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 424#L43-3 [2022-11-23 01:46:25,350 INFO L750 eck$LassoCheckResult]: Loop: 424#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 432#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 424#L43-3 [2022-11-23 01:46:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 3 times [2022-11-23 01:46:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:25,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797751757] [2022-11-23 01:46:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:25,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:25,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:25,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2022-11-23 01:46:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:25,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117006124] [2022-11-23 01:46:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:25,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:25,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:46:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1328236761, now seen corresponding path program 1 times [2022-11-23 01:46:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:25,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051748900] [2022-11-23 01:46:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:26,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:46:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:46:26,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace