./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-acceleration/array_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-acceleration/array_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d1726b0c52a0be10cb8b374bfde8cdbfe3513d4b934203f7e56a3a1bce5e9e5b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:48:42,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:48:42,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:48:42,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:48:42,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:48:42,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:48:42,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:48:42,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:48:42,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:48:42,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:48:42,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:48:42,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:48:42,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:48:42,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:48:42,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:48:42,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:48:42,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:48:42,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:48:42,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:48:42,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:48:42,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:48:42,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:48:42,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:48:42,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:48:42,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:48:42,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:48:42,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:48:42,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:48:42,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:48:42,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:48:42,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:48:42,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:48:42,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:48:42,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:48:42,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:48:42,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:48:42,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:48:42,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:48:42,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:48:42,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:48:42,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:48:42,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 09:48:42,873 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:48:42,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:48:42,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:48:42,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:48:42,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:48:42,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:48:42,876 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:48:42,876 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:48:42,876 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:48:42,877 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:48:42,877 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:48:42,878 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:48:42,878 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:48:42,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:48:42,878 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 09:48:42,878 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:48:42,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:48:42,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 09:48:42,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:48:42,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:48:42,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:48:42,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:48:42,880 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 09:48:42,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:48:42,880 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:48:42,880 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:48:42,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:48:42,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:48:42,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:48:42,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:48:42,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:48:42,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:48:42,883 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:48:42,883 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d1726b0c52a0be10cb8b374bfde8cdbfe3513d4b934203f7e56a3a1bce5e9e5b [2021-12-16 09:48:43,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:48:43,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:48:43,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:48:43,145 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:48:43,145 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:48:43,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/array_2-1.i [2021-12-16 09:48:43,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fccffe1fd/90420468d2ac474bbfd9402618650ec8/FLAG03d6d652b [2021-12-16 09:48:43,610 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:48:43,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-1.i [2021-12-16 09:48:43,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fccffe1fd/90420468d2ac474bbfd9402618650ec8/FLAG03d6d652b [2021-12-16 09:48:43,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fccffe1fd/90420468d2ac474bbfd9402618650ec8 [2021-12-16 09:48:43,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:48:43,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:48:43,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:48:43,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:48:43,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:48:43,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a8262b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43, skipping insertion in model container [2021-12-16 09:48:43,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:48:43,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:48:43,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-1.i[849,862] [2021-12-16 09:48:43,879 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:48:43,887 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:48:43,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-1.i[849,862] [2021-12-16 09:48:43,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:48:43,921 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:48:43,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43 WrapperNode [2021-12-16 09:48:43,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:48:43,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:48:43,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:48:43,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:48:43,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,954 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2021-12-16 09:48:43,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:48:43,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:48:43,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:48:43,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:48:43,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:48:43,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:48:43,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:48:43,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:48:43,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (1/1) ... [2021-12-16 09:48:43,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:48:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:44,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:48:44,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 09:48:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 09:48:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 09:48:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 09:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 09:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:48:44,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 09:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 09:48:44,123 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:48:44,125 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:48:44,258 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:48:44,263 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:48:44,263 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:48:44,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:48:44 BoogieIcfgContainer [2021-12-16 09:48:44,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:48:44,266 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:48:44,266 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:48:44,269 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:48:44,269 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:48:44,269 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:48:43" (1/3) ... [2021-12-16 09:48:44,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a696158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:48:44, skipping insertion in model container [2021-12-16 09:48:44,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:48:44,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:48:43" (2/3) ... [2021-12-16 09:48:44,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a696158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:48:44, skipping insertion in model container [2021-12-16 09:48:44,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:48:44,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:48:44" (3/3) ... [2021-12-16 09:48:44,280 INFO L388 chiAutomizerObserver]: Analyzing ICFG array_2-1.i [2021-12-16 09:48:44,316 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:48:44,316 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:48:44,316 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:48:44,316 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:48:44,317 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:48:44,317 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:48:44,317 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:48:44,317 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:48:44,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:44,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-16 09:48:44,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:44,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:44,346 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:48:44,347 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:44,347 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:48:44,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:44,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-16 09:48:44,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:44,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:44,349 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:48:44,349 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:44,355 INFO L791 eck$LassoCheckResult]: Stem: 5#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(12, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 7#L25-3true [2021-12-16 09:48:44,355 INFO L793 eck$LassoCheckResult]: Loop: 7#L25-3true assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 11#L25-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 7#L25-3true [2021-12-16 09:48:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-16 09:48:44,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:44,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944298457] [2021-12-16 09:48:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:44,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:44,481 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:44,520 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-16 09:48:44,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:44,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465596763] [2021-12-16 09:48:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:44,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:44,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:44,576 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-16 09:48:44,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:44,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381024385] [2021-12-16 09:48:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:44,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:44,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:44,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:45,072 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:48:45,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:48:45,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:48:45,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:48:45,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:48:45,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:48:45,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:48:45,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:48:45,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_2-1.i_Iteration1_Lasso [2021-12-16 09:48:45,075 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:48:45,075 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:48:45,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:48:45,639 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:48:45,642 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:48:45,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:48:45,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:45,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:48:45,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-16 09:48:45,652 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 [2021-12-16 09:48:45,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:48:45,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:48:45,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:48:45,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:48:45,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:48:45,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:48:45,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:48:45,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-16 09:48:45,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:48:45,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:45,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:48:45,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-16 09:48:45,715 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 [2021-12-16 09:48:45,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:48:45,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:48:45,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:48:45,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:48:45,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:48:45,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:48:45,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:48:45,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:48:45,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-16 09:48:45,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:48:45,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:45,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:48:45,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-16 09:48:45,752 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 [2021-12-16 09:48:45,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:48:45,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:48:45,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:48:45,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:48:45,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:48:45,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:48:45,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:48:45,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-16 09:48:45,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:48:45,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:45,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:48:45,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-16 09:48:45,818 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 [2021-12-16 09:48:45,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:48:45,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:48:45,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:48:45,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:48:45,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:48:45,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:48:45,847 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:48:45,866 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-16 09:48:45,866 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-16 09:48:45,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:48:45,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:45,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:48:45,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-16 09:48:45,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:48:45,956 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 09:48:45,957 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:48:45,957 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 4095*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 Supporting invariants [] [2021-12-16 09:48:45,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 09:48:46,010 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-16 09:48:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:46,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:48:46,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:48:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:46,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:48:46,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:48:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,153 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-16 09:48:46,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2021-12-16 09:48:46,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 27 states and 37 transitions. Complement of second has 8 states. [2021-12-16 09:48:46,187 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 [2021-12-16 09:48:46,191 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) [2021-12-16 09:48:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2021-12-16 09:48:46,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-16 09:48:46,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:48:46,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-16 09:48:46,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:48:46,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-16 09:48:46,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:48:46,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2021-12-16 09:48:46,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:46,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 8 states and 10 transitions. [2021-12-16 09:48:46,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-16 09:48:46,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-16 09:48:46,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2021-12-16 09:48:46,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:48:46,202 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-12-16 09:48:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2021-12-16 09:48:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-16 09:48:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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) [2021-12-16 09:48:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2021-12-16 09:48:46,219 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-12-16 09:48:46,219 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-12-16 09:48:46,219 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:48:46,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2021-12-16 09:48:46,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:46,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:46,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:46,221 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:48:46,221 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:46,221 INFO L791 eck$LassoCheckResult]: Stem: 127#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(12, 2); 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 132#L25-3 assume !(main_~i~0#1 < 2048); 131#L25-4 main_~i~0#1 := 0; 129#L29-3 [2021-12-16 09:48:46,221 INFO L793 eck$LassoCheckResult]: Loop: 129#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 130#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 129#L29-3 [2021-12-16 09:48:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-12-16 09:48:46,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:46,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506339784] [2021-12-16 09:48:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:46,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:48:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506339784] [2021-12-16 09:48:46,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506339784] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:48:46,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:48:46,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:48:46,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838455773] [2021-12-16 09:48:46,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:48:46,260 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:48:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-12-16 09:48:46,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689199801] [2021-12-16 09:48:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:46,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:46,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:46,273 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:46,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:48:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:48:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:48:46,342 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 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) [2021-12-16 09:48:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:48:46,356 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-12-16 09:48:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:48:46,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-12-16 09:48:46,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:46,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2021-12-16 09:48:46,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-16 09:48:46,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-16 09:48:46,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2021-12-16 09:48:46,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:48:46,359 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-16 09:48:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2021-12-16 09:48:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2021-12-16 09:48:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-12-16 09:48:46,361 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-16 09:48:46,361 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-16 09:48:46,361 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:48:46,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-12-16 09:48:46,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:46,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:46,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:46,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:48:46,363 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:46,363 INFO L791 eck$LassoCheckResult]: Stem: 154#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(12, 2); 155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 157#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 150#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 151#L25-3 assume !(main_~i~0#1 < 2048); 156#L25-4 main_~i~0#1 := 0; 152#L29-3 [2021-12-16 09:48:46,363 INFO L793 eck$LassoCheckResult]: Loop: 152#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 153#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 152#L29-3 [2021-12-16 09:48:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-12-16 09:48:46,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:46,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877127070] [2021-12-16 09:48:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:46,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:48:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877127070] [2021-12-16 09:48:46,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877127070] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:48:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354370141] [2021-12-16 09:48:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:46,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:48:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:46,400 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:48:46,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 09:48:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:46,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 09:48:46,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:48:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:48:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354370141] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:48:46,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:48:46,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-16 09:48:46,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050002505] [2021-12-16 09:48:46,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:48:46,501 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:48:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2021-12-16 09:48:46,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:46,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277616003] [2021-12-16 09:48:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:46,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:46,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:46,533 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:46,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:48:46,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 09:48:46,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:48:46,652 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:46,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-16 09:48:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:48:46,708 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-12-16 09:48:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:48:46,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2021-12-16 09:48:46,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:46,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2021-12-16 09:48:46,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-16 09:48:46,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-16 09:48:46,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2021-12-16 09:48:46,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:48:46,715 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-12-16 09:48:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2021-12-16 09:48:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2021-12-16 09:48:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-16 09:48:46,719 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-16 09:48:46,719 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-16 09:48:46,719 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:48:46,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2021-12-16 09:48:46,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:46,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:46,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:46,722 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-12-16 09:48:46,722 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:46,722 INFO L791 eck$LassoCheckResult]: Stem: 221#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(12, 2); 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 225#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 219#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 220#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 226#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 232#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 231#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 230#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 229#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 228#L25-3 assume !(main_~i~0#1 < 2048); 227#L25-4 main_~i~0#1 := 0; 223#L29-3 [2021-12-16 09:48:46,722 INFO L793 eck$LassoCheckResult]: Loop: 223#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 224#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 223#L29-3 [2021-12-16 09:48:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-12-16 09:48:46,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:46,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757765282] [2021-12-16 09:48:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:46,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:48:46,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757765282] [2021-12-16 09:48:46,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757765282] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:48:46,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327705041] [2021-12-16 09:48:46,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:48:46,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:48:46,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:46,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:48:46,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 09:48:46,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:48:46,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:48:46,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:48:46,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:48:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:48:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:46,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327705041] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:48:46,966 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:48:46,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-16 09:48:46,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811074294] [2021-12-16 09:48:46,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:48:46,967 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:48:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2021-12-16 09:48:46,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:46,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130521406] [2021-12-16 09:48:46,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:46,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:46,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:46,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:47,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:48:47,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 09:48:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-16 09:48:47,047 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:48:47,144 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-12-16 09:48:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 09:48:47,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2021-12-16 09:48:47,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:47,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2021-12-16 09:48:47,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-16 09:48:47,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-16 09:48:47,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2021-12-16 09:48:47,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:48:47,152 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-12-16 09:48:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2021-12-16 09:48:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2021-12-16 09:48:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-12-16 09:48:47,157 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-12-16 09:48:47,157 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-12-16 09:48:47,157 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:48:47,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2021-12-16 09:48:47,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:47,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:47,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:47,160 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-12-16 09:48:47,160 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:47,161 INFO L791 eck$LassoCheckResult]: Stem: 364#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(12, 2); 365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 366#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 367#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 368#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 360#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 361#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 385#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 384#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 383#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 382#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 381#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 380#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 379#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 378#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 377#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 376#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 375#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 374#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 373#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 372#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 371#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 370#L25-3 assume !(main_~i~0#1 < 2048); 369#L25-4 main_~i~0#1 := 0; 362#L29-3 [2021-12-16 09:48:47,161 INFO L793 eck$LassoCheckResult]: Loop: 362#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 363#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 362#L29-3 [2021-12-16 09:48:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2021-12-16 09:48:47,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:47,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909540193] [2021-12-16 09:48:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:47,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:47,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:48:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909540193] [2021-12-16 09:48:47,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909540193] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:48:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807573886] [2021-12-16 09:48:47,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 09:48:47,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:48:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:47,327 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:48:47,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 09:48:47,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-16 09:48:47,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:48:47,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 09:48:47,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:48:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:47,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:48:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:47,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807573886] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:48:47,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:48:47,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-12-16 09:48:47,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107625707] [2021-12-16 09:48:47,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:48:47,967 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:48:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2021-12-16 09:48:47,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585907511] [2021-12-16 09:48:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:47,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:47,974 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:47,983 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:48,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:48:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-16 09:48:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-12-16 09:48:48,046 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:48:48,206 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2021-12-16 09:48:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 09:48:48,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions. [2021-12-16 09:48:48,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:48,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 94 transitions. [2021-12-16 09:48:48,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2021-12-16 09:48:48,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2021-12-16 09:48:48,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 94 transitions. [2021-12-16 09:48:48,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:48:48,210 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-12-16 09:48:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 94 transitions. [2021-12-16 09:48:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 50. [2021-12-16 09:48:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-12-16 09:48:48,213 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-12-16 09:48:48,213 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-12-16 09:48:48,213 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:48:48,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2021-12-16 09:48:48,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:48,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:48,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:48,216 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2021-12-16 09:48:48,216 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:48,216 INFO L791 eck$LassoCheckResult]: Stem: 649#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(12, 2); 650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 651#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 652#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 653#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 645#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 646#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 694#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 693#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 692#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 691#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 690#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 689#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 688#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 687#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 686#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 685#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 684#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 683#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 682#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 681#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 680#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 679#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 678#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 677#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 676#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 675#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 674#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 673#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 672#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 671#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 670#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 669#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 668#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 667#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 666#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 665#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 664#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 663#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 662#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 661#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 660#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 659#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 658#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 657#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 656#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 655#L25-3 assume !(main_~i~0#1 < 2048); 654#L25-4 main_~i~0#1 := 0; 647#L29-3 [2021-12-16 09:48:48,216 INFO L793 eck$LassoCheckResult]: Loop: 647#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 648#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 647#L29-3 [2021-12-16 09:48:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2021-12-16 09:48:48,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:48,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263737743] [2021-12-16 09:48:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:48,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:48,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:48:48,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263737743] [2021-12-16 09:48:48,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263737743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:48:48,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412885618] [2021-12-16 09:48:48,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 09:48:48,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:48:48,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:48,603 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:48:48,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 09:48:48,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 09:48:48,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:48:48,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 09:48:48,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:48:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:48,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:48:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:49,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412885618] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:48:49,601 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:48:49,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2021-12-16 09:48:49,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204927077] [2021-12-16 09:48:49,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:48:49,602 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:48:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2021-12-16 09:48:49,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:49,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651260674] [2021-12-16 09:48:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:49,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:49,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:48:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:48:49,625 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:48:49,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:48:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-16 09:48:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-12-16 09:48:49,686 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:48:50,042 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2021-12-16 09:48:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-16 09:48:50,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 190 transitions. [2021-12-16 09:48:50,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:50,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 190 transitions. [2021-12-16 09:48:50,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2021-12-16 09:48:50,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2021-12-16 09:48:50,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 190 transitions. [2021-12-16 09:48:50,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:48:50,048 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 190 transitions. [2021-12-16 09:48:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 190 transitions. [2021-12-16 09:48:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98. [2021-12-16 09:48:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:48:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2021-12-16 09:48:50,054 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2021-12-16 09:48:50,054 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2021-12-16 09:48:50,054 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:48:50,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2021-12-16 09:48:50,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 09:48:50,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:48:50,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:48:50,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2021-12-16 09:48:50,058 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 09:48:50,058 INFO L791 eck$LassoCheckResult]: Stem: 1220#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(12, 2); 1221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 1224#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1218#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1219#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1225#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1315#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1314#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1313#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1312#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1311#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1310#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1309#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1308#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1307#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1306#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1305#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1304#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1303#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1302#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1301#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1300#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1299#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1298#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1297#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1296#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1295#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1294#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1293#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1292#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1291#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1290#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1289#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1288#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1287#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1286#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1285#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1284#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1283#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1282#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1281#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1280#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1279#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1278#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1277#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1276#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1275#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1274#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1273#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1272#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1271#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1270#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1269#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1268#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1267#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1266#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1265#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1264#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1263#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1262#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1261#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1260#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1259#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1258#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1257#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1256#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1255#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1254#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1253#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1252#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1251#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1250#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1249#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1248#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1247#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1246#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1245#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1244#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1243#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1242#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1241#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1240#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1239#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1238#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1237#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1236#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1235#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1234#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1233#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1232#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1231#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1230#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1229#L25-3 assume !!(main_~i~0#1 < 2048);call write~int(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;call write~int(main_#t~nondet3#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1228#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1227#L25-3 assume !(main_~i~0#1 < 2048); 1226#L25-4 main_~i~0#1 := 0; 1222#L29-3 [2021-12-16 09:48:50,059 INFO L793 eck$LassoCheckResult]: Loop: 1222#L29-3 assume !!(main_~i~0#1 < 2048);call main_#t~mem5#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); 1223#L29-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1222#L29-3 [2021-12-16 09:48:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:48:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2021-12-16 09:48:50,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:48:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67086034] [2021-12-16 09:48:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:48:50,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:48:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:48:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:48:51,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:48:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67086034] [2021-12-16 09:48:51,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67086034] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:48:51,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803551711] [2021-12-16 09:48:51,074 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 09:48:51,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:48:51,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:48:51,077 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:48:51,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process