./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e8d55036 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/termination-crafted/LexIndexValue-Pointer-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 23:12:11,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 23:12:11,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 23:12:11,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 23:12:11,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 23:12:11,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 23:12:11,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 23:12:11,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 23:12:11,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 23:12:11,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 23:12:11,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 23:12:11,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 23:12:11,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 23:12:11,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 23:12:11,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 23:12:11,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 23:12:11,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 23:12:11,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 23:12:11,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 23:12:11,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 23:12:11,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 23:12:11,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 23:12:11,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 23:12:11,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 23:12:11,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 23:12:11,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 23:12:11,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 23:12:11,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 23:12:11,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 23:12:11,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 23:12:11,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 23:12:11,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 23:12:11,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 23:12:11,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 23:12:11,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 23:12:11,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 23:12:11,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 23:12:11,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 23:12:11,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 23:12:11,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 23:12:11,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 23:12:11,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 23:12:11,837 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 23:12:11,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 23:12:11,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 23:12:11,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 23:12:11,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 23:12:11,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 23:12:11,839 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 23:12:11,839 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 23:12:11,839 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 23:12:11,839 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 23:12:11,840 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 23:12:11,840 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 23:12:11,841 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 23:12:11,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 23:12:11,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 23:12:11,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 23:12:11,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 23:12:11,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 23:12:11,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 23:12:11,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 23:12:11,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 23:12:11,843 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 23:12:11,846 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 23:12:11,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 23:12:11,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 23:12:11,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 23:12:11,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 23:12:11,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 23:12:11,849 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 23:12:11,849 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 [2023-02-15 23:12:12,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 23:12:12,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 23:12:12,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 23:12:12,032 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 23:12:12,032 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 23:12:12,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2023-02-15 23:12:13,124 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 23:12:13,329 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 23:12:13,330 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2023-02-15 23:12:13,333 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc666049/d4fd7a1968b74cb483e758fe5b6af601/FLAG99933b356 [2023-02-15 23:12:13,343 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc666049/d4fd7a1968b74cb483e758fe5b6af601 [2023-02-15 23:12:13,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 23:12:13,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 23:12:13,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 23:12:13,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 23:12:13,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 23:12:13,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15148788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13, skipping insertion in model container [2023-02-15 23:12:13,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 23:12:13,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 23:12:13,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:12:13,492 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 23:12:13,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:12:13,513 INFO L208 MainTranslator]: Completed translation [2023-02-15 23:12:13,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13 WrapperNode [2023-02-15 23:12:13,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 23:12:13,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 23:12:13,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 23:12:13,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 23:12:13,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,541 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2023-02-15 23:12:13,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 23:12:13,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 23:12:13,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 23:12:13,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 23:12:13,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 23:12:13,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 23:12:13,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 23:12:13,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 23:12:13,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (1/1) ... [2023-02-15 23:12:13,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:13,596 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) [2023-02-15 23:12:13,603 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 [2023-02-15 23:12:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 23:12:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 23:12:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 23:12:13,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 23:12:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 23:12:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 23:12:13,695 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 23:12:13,697 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 23:12:13,784 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 23:12:13,788 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 23:12:13,788 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 23:12:13,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:13 BoogieIcfgContainer [2023-02-15 23:12:13,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 23:12:13,791 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 23:12:13,791 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 23:12:13,793 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 23:12:13,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:12:13,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 11:12:13" (1/3) ... [2023-02-15 23:12:13,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e057a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:12:13, skipping insertion in model container [2023-02-15 23:12:13,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:12:13,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:12:13" (2/3) ... [2023-02-15 23:12:13,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e057a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:12:13, skipping insertion in model container [2023-02-15 23:12:13,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:12:13,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:13" (3/3) ... [2023-02-15 23:12:13,796 INFO L332 chiAutomizerObserver]: Analyzing ICFG LexIndexValue-Pointer-2.c [2023-02-15 23:12:13,831 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 23:12:13,832 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 23:12:13,832 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 23:12:13,832 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 23:12:13,832 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 23:12:13,832 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 23:12:13,832 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 23:12:13,832 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 23:12:13,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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) [2023-02-15 23:12:13,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-15 23:12:13,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:13,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:13,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 23:12:13,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 23:12:13,852 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 23:12:13,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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) [2023-02-15 23:12:13,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-15 23:12:13,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:13,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:13,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 23:12:13,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 23:12:13,862 INFO L748 eck$LassoCheckResult]: Stem: 11#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 9#L18-3true [2023-02-15 23:12:13,868 INFO L750 eck$LassoCheckResult]: Loop: 9#L18-3true assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 7#L18-2true main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9#L18-3true [2023-02-15 23:12:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 23:12:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:13,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697284174] [2023-02-15 23:12:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:14,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:14,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:14,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-02-15 23:12:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:14,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447522544] [2023-02-15 23:12:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:14,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:14,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-02-15 23:12:14,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:14,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592813177] [2023-02-15 23:12:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:14,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:14,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:14,292 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:12:14,292 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:12:14,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:12:14,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:12:14,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:12:14,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:12:14,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:12:14,293 INFO L133 ssoRankerPreferences]: Filename of dumped script: LexIndexValue-Pointer-2.c_Iteration1_Lasso [2023-02-15 23:12:14,293 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:12:14,294 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:12:14,307 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,464 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,466 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,473 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,476 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,479 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:12:14,669 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:12:14,672 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:12:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,691 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) [2023-02-15 23:12:14,692 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 [2023-02-15 23:12:14,693 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 [2023-02-15 23:12:14,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:14,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:14,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:14,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:14,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:14,712 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 [2023-02-15 23:12:14,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,715 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) [2023-02-15 23:12:14,718 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 [2023-02-15 23:12:14,720 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 [2023-02-15 23:12:14,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:14,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:14,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:14,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:14,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:14,745 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 [2023-02-15 23:12:14,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,747 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) [2023-02-15 23:12:14,749 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 [2023-02-15 23:12:14,758 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 [2023-02-15 23:12:14,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:14,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:14,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:14,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:14,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:14,789 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 [2023-02-15 23:12:14,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,790 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) [2023-02-15 23:12:14,792 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 [2023-02-15 23:12:14,794 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 [2023-02-15 23:12:14,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:12:14,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:14,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:12:14,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:12:14,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:14,820 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 [2023-02-15 23:12:14,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,822 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) [2023-02-15 23:12:14,824 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 [2023-02-15 23:12:14,825 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 [2023-02-15 23:12:14,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:14,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:14,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:14,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:14,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:14,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,858 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2023-02-15 23:12:14,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-15 23:12:14,861 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 [2023-02-15 23:12:14,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:14,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:14,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:14,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:14,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:14,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,884 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2023-02-15 23:12:14,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-15 23:12:14,888 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 [2023-02-15 23:12:14,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,894 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-02-15 23:12:14,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,898 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-02-15 23:12:14,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:14,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:12:14,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:14,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:14,929 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2023-02-15 23:12:14,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-15 23:12:14,933 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 [2023-02-15 23:12:14,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:12:14,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:12:14,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:12:14,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:12:14,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:12:14,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 23:12:14,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:12:15,005 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-02-15 23:12:15,005 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-02-15 23:12:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:12:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,032 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-02-15 23:12:15,055 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:12:15,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-15 23:12:15,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 23:12:15,081 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:12:15,082 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~p~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 2095*v_rep(select #length ULTIMATE.start_main_~p~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-15 23:12:15,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:15,095 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2023-02-15 23:12:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:15,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 23:12:15,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:15,175 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:12:15,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:15,239 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 23:12:15,240 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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) [2023-02-15 23:12:15,306 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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 33 states and 48 transitions. Complement of second has 7 states. [2023-02-15 23:12:15,308 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 [2023-02-15 23:12:15,311 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) [2023-02-15 23:12:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2023-02-15 23:12:15,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 2 letters. Loop has 2 letters. [2023-02-15 23:12:15,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:15,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-15 23:12:15,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:15,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-15 23:12:15,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:12:15,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2023-02-15 23:12:15,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:15,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 10 states and 14 transitions. [2023-02-15 23:12:15,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-15 23:12:15,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 23:12:15,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2023-02-15 23:12:15,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:12:15,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2023-02-15 23:12:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2023-02-15 23:12:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-15 23:12:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2023-02-15 23:12:15,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2023-02-15 23:12:15,339 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2023-02-15 23:12:15,339 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 23:12:15,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2023-02-15 23:12:15,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:15,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:15,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:15,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:12:15,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:15,342 INFO L748 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 107#L18-3 assume !(main_~i~0#1 < 1048); 106#L18-4 main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 105#L23-2 [2023-02-15 23:12:15,342 INFO L750 eck$LassoCheckResult]: Loop: 105#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 101#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 102#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1; 110#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 105#L23-2 [2023-02-15 23:12:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-02-15 23:12:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:15,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534168171] [2023-02-15 23:12:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:15,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534168171] [2023-02-15 23:12:15,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534168171] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:12:15,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:12:15,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 23:12:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337033438] [2023-02-15 23:12:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:12:15,420 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:12:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 1 times [2023-02-15 23:12:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:15,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846772167] [2023-02-15 23:12:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:15,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:15,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:15,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:15,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 23:12:15,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:12:15,503 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 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) [2023-02-15 23:12:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:15,510 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2023-02-15 23:12:15,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2023-02-15 23:12:15,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:15,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2023-02-15 23:12:15,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 23:12:15,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 23:12:15,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2023-02-15 23:12:15,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:12:15,511 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2023-02-15 23:12:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2023-02-15 23:12:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-02-15 23:12:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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) [2023-02-15 23:12:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2023-02-15 23:12:15,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-15 23:12:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 23:12:15,513 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-15 23:12:15,513 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 23:12:15,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2023-02-15 23:12:15,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:15,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:15,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:15,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-02-15 23:12:15,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:15,515 INFO L748 eck$LassoCheckResult]: Stem: 135#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 133#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 130#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 131#L18-3 assume !(main_~i~0#1 < 1048); 134#L18-4 main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 132#L23-2 [2023-02-15 23:12:15,515 INFO L750 eck$LassoCheckResult]: Loop: 132#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 128#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 129#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1; 137#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 132#L23-2 [2023-02-15 23:12:15,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-02-15 23:12:15,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:15,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601144685] [2023-02-15 23:12:15,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:15,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601144685] [2023-02-15 23:12:15,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601144685] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:15,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557829424] [2023-02-15 23:12:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,564 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) [2023-02-15 23:12:15,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 23:12:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:15,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 23:12:15,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:15,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:12:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:15,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557829424] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:12:15,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:12:15,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 23:12:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652991378] [2023-02-15 23:12:15,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:12:15,650 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:12:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 2 times [2023-02-15 23:12:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:15,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594953729] [2023-02-15 23:12:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:15,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:15,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 23:12:15,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 23:12:15,754 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 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) [2023-02-15 23:12:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:15,778 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-02-15 23:12:15,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2023-02-15 23:12:15,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:15,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2023-02-15 23:12:15,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 23:12:15,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 23:12:15,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2023-02-15 23:12:15,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:12:15,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-02-15 23:12:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2023-02-15 23:12:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-15 23:12:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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) [2023-02-15 23:12:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-02-15 23:12:15,785 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-02-15 23:12:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:12:15,786 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-02-15 23:12:15,787 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 23:12:15,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2023-02-15 23:12:15,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:15,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:15,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:15,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-02-15 23:12:15,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:15,790 INFO L748 eck$LassoCheckResult]: Stem: 204#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 199#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 200#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 201#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 196#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 197#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 209#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 208#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 207#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 206#L18-3 assume !(main_~i~0#1 < 1048); 202#L18-4 main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 198#L23-2 [2023-02-15 23:12:15,790 INFO L750 eck$LassoCheckResult]: Loop: 198#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 194#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 195#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1; 203#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 198#L23-2 [2023-02-15 23:12:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-02-15 23:12:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:15,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454939989] [2023-02-15 23:12:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:15,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454939989] [2023-02-15 23:12:15,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454939989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:15,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547498006] [2023-02-15 23:12:15,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:12:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:15,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:15,935 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:15,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 23:12:15,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:12:15,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:12:15,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:12:15,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:16,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:12:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:16,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547498006] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:12:16,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:12:16,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-15 23:12:16,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220544414] [2023-02-15 23:12:16,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:12:16,061 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:12:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 3 times [2023-02-15 23:12:16,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:16,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19646013] [2023-02-15 23:12:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:16,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:16,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 23:12:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 23:12:16,132 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 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) [2023-02-15 23:12:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:16,161 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-02-15 23:12:16,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2023-02-15 23:12:16,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:16,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2023-02-15 23:12:16,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 23:12:16,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 23:12:16,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2023-02-15 23:12:16,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:12:16,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 23:12:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2023-02-15 23:12:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 23:12:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-15 23:12:16,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 23:12:16,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 23:12:16,165 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 23:12:16,166 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 23:12:16,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2023-02-15 23:12:16,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:16,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:16,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:16,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-02-15 23:12:16,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:16,167 INFO L748 eck$LassoCheckResult]: Stem: 329#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 325#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 326#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 327#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 322#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 323#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 347#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 346#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 345#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 344#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 343#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 342#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 341#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 340#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 339#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 338#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 337#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 336#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 335#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 334#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 333#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 332#L18-3 assume !(main_~i~0#1 < 1048); 328#L18-4 main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 324#L23-2 [2023-02-15 23:12:16,167 INFO L750 eck$LassoCheckResult]: Loop: 324#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 320#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 321#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1; 331#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 324#L23-2 [2023-02-15 23:12:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-02-15 23:12:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:16,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951271836] [2023-02-15 23:12:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:16,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-15 23:12:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:16,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951271836] [2023-02-15 23:12:16,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951271836] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:16,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128255179] [2023-02-15 23:12:16,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:12:16,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:16,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:16,364 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:16,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 23:12:16,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 23:12:16,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:12:16,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 23:12:16,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:16,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:12:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128255179] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:12:16,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:12:16,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-02-15 23:12:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970479058] [2023-02-15 23:12:16,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:12:16,714 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:12:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 4 times [2023-02-15 23:12:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:16,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413511331] [2023-02-15 23:12:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:16,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:16,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:16,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 23:12:16,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-02-15 23:12:16,787 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 5 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) [2023-02-15 23:12:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:16,840 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-02-15 23:12:16,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 55 transitions. [2023-02-15 23:12:16,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:16,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 55 transitions. [2023-02-15 23:12:16,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 23:12:16,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 23:12:16,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 55 transitions. [2023-02-15 23:12:16,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:12:16,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-02-15 23:12:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 55 transitions. [2023-02-15 23:12:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-15 23:12:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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) [2023-02-15 23:12:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2023-02-15 23:12:16,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-02-15 23:12:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 23:12:16,845 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-02-15 23:12:16,845 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 23:12:16,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 55 transitions. [2023-02-15 23:12:16,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:16,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:16,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:16,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2023-02-15 23:12:16,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:16,847 INFO L748 eck$LassoCheckResult]: Stem: 575#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 571#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 572#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 573#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 568#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 569#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 617#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 616#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 615#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 614#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 613#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 612#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 611#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 610#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 609#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 608#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 607#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 606#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 605#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 604#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 603#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 602#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 601#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 600#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 599#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 598#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 597#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 596#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 595#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 594#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 593#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 592#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 591#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 590#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 589#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 588#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 587#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 586#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 585#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 584#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 583#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 582#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 581#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 580#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 579#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 578#L18-3 assume !(main_~i~0#1 < 1048); 574#L18-4 main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 570#L23-2 [2023-02-15 23:12:16,847 INFO L750 eck$LassoCheckResult]: Loop: 570#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 566#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 567#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1; 577#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 570#L23-2 [2023-02-15 23:12:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2023-02-15 23:12:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561872156] [2023-02-15 23:12:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561872156] [2023-02-15 23:12:17,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561872156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734170299] [2023-02-15 23:12:17,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:12:17,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:17,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:17,270 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:17,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 23:12:17,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:12:17,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:12:17,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 23:12:17,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:17,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:12:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:17,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734170299] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:12:17,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:12:17,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-02-15 23:12:17,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976715026] [2023-02-15 23:12:17,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:12:17,976 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:12:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 5 times [2023-02-15 23:12:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:17,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544963258] [2023-02-15 23:12:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:17,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:17,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:18,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 23:12:18,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 23:12:18,044 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. cyclomatic complexity: 5 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) [2023-02-15 23:12:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:18,165 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2023-02-15 23:12:18,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 103 transitions. [2023-02-15 23:12:18,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:18,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 103 transitions. [2023-02-15 23:12:18,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 23:12:18,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 23:12:18,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 103 transitions. [2023-02-15 23:12:18,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:12:18,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 103 transitions. [2023-02-15 23:12:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 103 transitions. [2023-02-15 23:12:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-15 23:12:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.03) internal successors, (103), 99 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:12:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2023-02-15 23:12:18,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 103 transitions. [2023-02-15 23:12:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-15 23:12:18,171 INFO L428 stractBuchiCegarLoop]: Abstraction has 100 states and 103 transitions. [2023-02-15 23:12:18,171 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 23:12:18,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 103 transitions. [2023-02-15 23:12:18,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:18,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:18,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:18,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2023-02-15 23:12:18,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:18,174 INFO L748 eck$LassoCheckResult]: Stem: 1062#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1063#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 1057#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1058#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1059#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1054#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1055#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1151#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1150#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1149#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1148#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1147#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1146#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1145#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1144#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1143#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1142#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1141#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1140#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1139#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1138#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1137#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1136#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1135#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1134#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1133#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1132#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1131#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1130#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1129#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1128#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1127#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1126#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1125#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1124#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1123#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1122#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1121#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1120#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1119#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1118#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1117#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1116#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1115#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1114#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1113#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1112#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1111#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1110#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1109#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1108#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1107#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1106#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1105#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1104#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1103#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1102#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1101#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1100#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1099#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1098#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1097#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1096#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1095#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1094#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1093#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1092#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1091#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1090#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1089#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1088#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1087#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1086#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1085#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1084#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1083#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1082#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1081#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1080#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1079#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1078#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1077#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1076#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1075#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1074#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1073#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1072#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1071#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1070#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1069#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1068#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1067#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1066#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1065#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1064#L18-3 assume !(main_~i~0#1 < 1048); 1060#L18-4 main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 1056#L23-2 [2023-02-15 23:12:18,175 INFO L750 eck$LassoCheckResult]: Loop: 1056#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 1052#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 1053#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1; 1061#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 1056#L23-2 [2023-02-15 23:12:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2023-02-15 23:12:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:18,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131157535] [2023-02-15 23:12:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131157535] [2023-02-15 23:12:19,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131157535] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104279917] [2023-02-15 23:12:19,606 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:12:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:19,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:19,616 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:19,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 23:12:37,063 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-02-15 23:12:37,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:12:37,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 23:12:37,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:12:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:37,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:12:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:38,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104279917] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:12:38,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:12:38,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-02-15 23:12:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106918000] [2023-02-15 23:12:38,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:12:38,867 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:12:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 6 times [2023-02-15 23:12:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:38,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96283794] [2023-02-15 23:12:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:38,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:12:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:12:38,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:12:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:12:38,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-02-15 23:12:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-02-15 23:12:38,956 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. cyclomatic complexity: 5 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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) [2023-02-15 23:12:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:12:39,297 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2023-02-15 23:12:39,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 199 transitions. [2023-02-15 23:12:39,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:39,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 199 transitions. [2023-02-15 23:12:39,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 23:12:39,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 23:12:39,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 199 transitions. [2023-02-15 23:12:39,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:12:39,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 196 states and 199 transitions. [2023-02-15 23:12:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 199 transitions. [2023-02-15 23:12:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-02-15 23:12:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.0153061224489797) internal successors, (199), 195 states have internal predecessors, (199), 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) [2023-02-15 23:12:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2023-02-15 23:12:39,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 199 transitions. [2023-02-15 23:12:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-02-15 23:12:39,321 INFO L428 stractBuchiCegarLoop]: Abstraction has 196 states and 199 transitions. [2023-02-15 23:12:39,321 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 23:12:39,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 199 transitions. [2023-02-15 23:12:39,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 23:12:39,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:12:39,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:12:39,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2023-02-15 23:12:39,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 23:12:39,329 INFO L748 eck$LassoCheckResult]: Stem: 2027#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2028#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~short5#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 2023#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2024#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2025#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2020#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2021#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2213#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2212#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2211#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2210#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2209#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2208#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2207#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2206#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2205#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2204#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2203#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2202#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2201#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2200#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2199#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2198#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2197#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2196#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2195#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2194#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2193#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2192#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2191#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2190#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2189#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2188#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2187#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2186#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2185#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2184#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2183#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2182#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2181#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2180#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2179#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2178#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2177#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2176#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2175#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2174#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2173#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2172#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2171#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2170#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2169#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2168#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2167#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2166#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2165#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2164#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2163#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2162#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2161#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2160#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2159#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2158#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2157#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2156#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2155#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2154#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2153#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2152#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2151#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2150#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2149#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2148#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2147#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2146#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2145#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2144#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2143#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2142#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2141#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2140#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2139#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2138#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2137#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2136#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2135#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2134#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2133#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2132#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2131#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2130#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2129#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2128#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2127#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2126#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2125#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2124#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2123#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2122#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2121#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2120#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2119#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2118#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2117#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2116#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2115#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2114#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2113#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2112#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2111#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2110#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2109#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2108#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2107#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2106#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2105#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2104#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2103#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2102#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2101#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2100#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2099#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2098#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2097#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2096#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2095#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2094#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2093#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2092#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2091#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2090#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2089#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2088#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2087#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2086#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2085#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2084#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2083#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2082#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2081#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2080#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2079#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2078#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2077#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2076#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2075#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2074#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2073#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2072#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2071#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2070#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2069#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2068#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2067#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2066#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2065#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2064#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2063#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2062#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2061#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2060#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2059#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2058#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2057#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2056#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2055#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2054#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2053#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2052#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2051#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2050#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2049#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2048#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2047#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2046#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2045#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2044#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2043#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2042#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2041#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2040#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2039#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2038#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2037#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2036#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2035#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2034#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2033#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2032#L18-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet3#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2031#L18-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2030#L18-3 assume !(main_~i~0#1 < 1048); 2026#L18-4 main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 2022#L23-2 [2023-02-15 23:12:39,331 INFO L750 eck$LassoCheckResult]: Loop: 2022#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 2018#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 2019#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1; 2029#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 2022#L23-2 [2023-02-15 23:12:39,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:12:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371207, now seen corresponding path program 6 times [2023-02-15 23:12:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:12:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113192683] [2023-02-15 23:12:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:12:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:12:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:12:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:12:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:12:43,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113192683] [2023-02-15 23:12:43,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113192683] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:12:43,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840919955] [2023-02-15 23:12:43,475 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:12:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:12:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:12:43,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:12:43,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process