./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test27-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 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/ldv-regression/test27-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:20:41,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:20:41,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:20:41,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:20:41,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:20:41,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:20:41,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:20:41,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:20:41,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:20:41,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:20:41,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:20:41,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:20:41,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:20:41,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:20:41,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:20:41,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:20:41,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:20:41,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:20:41,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:20:41,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:20:41,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:20:41,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:20:41,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:20:41,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:20:41,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:20:41,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:20:41,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:20:41,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:20:41,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:20:41,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:20:41,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:20:41,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:20:41,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:20:41,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:20:41,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:20:41,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:20:41,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:20:41,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:20:41,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:20:41,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:20:41,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:20:41,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:20:41,601 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:20:41,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:20:41,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:20:41,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:20:41,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:20:41,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:20:41,603 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:20:41,604 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:20:41,604 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:20:41,604 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:20:41,604 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:20:41,604 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:20:41,604 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:20:41,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:20:41,605 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:20:41,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:20:41,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:20:41,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:20:41,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:20:41,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:20:41,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:20:41,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:20:41,606 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:20:41,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:20:41,606 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:20:41,606 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:20:41,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:20:41,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:20:41,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:20:41,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:20:41,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:20:41,608 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:20:41,608 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:20:41,608 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78863f43fa37191b47f0d738bb1bc2018c82b38cb68dad85c455cdbd7fd69aa4 [2021-12-21 22:20:41,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:20:41,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:20:41,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:20:41,806 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:20:41,807 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:20:41,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-1.c [2021-12-21 22:20:41,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742918e16/6d9435fd83da4c829aa1b122b8d49072/FLAG4ac9b6ba4 [2021-12-21 22:20:42,220 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:20:42,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-1.c [2021-12-21 22:20:42,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742918e16/6d9435fd83da4c829aa1b122b8d49072/FLAG4ac9b6ba4 [2021-12-21 22:20:42,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742918e16/6d9435fd83da4c829aa1b122b8d49072 [2021-12-21 22:20:42,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:20:42,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:20:42,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:20:42,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:20:42,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:20:42,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4460170f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42, skipping insertion in model container [2021-12-21 22:20:42,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:20:42,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:20:42,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-1.c[1154,1167] [2021-12-21 22:20:42,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:20:42,831 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:20:42,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-1.c[1154,1167] [2021-12-21 22:20:42,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:20:42,854 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:20:42,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42 WrapperNode [2021-12-21 22:20:42,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:20:42,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:20:42,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:20:42,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:20:42,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,887 INFO L137 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2021-12-21 22:20:42,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:20:42,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:20:42,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:20:42,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:20:42,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:20:42,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:20:42,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:20:42,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:20:42,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (1/1) ... [2021-12-21 22:20:42,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:42,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:42,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:20:42,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:20:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 22:20:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:20:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:20:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 22:20:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 22:20:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 22:20:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:20:42,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:20:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 22:20:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:20:43,068 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:20:43,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:20:43,313 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:20:43,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:20:43,317 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 22:20:43,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:20:43 BoogieIcfgContainer [2021-12-21 22:20:43,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:20:43,320 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:20:43,320 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:20:43,322 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:20:43,323 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:20:43,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:20:42" (1/3) ... [2021-12-21 22:20:43,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ef51a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:20:43, skipping insertion in model container [2021-12-21 22:20:43,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:20:43,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:42" (2/3) ... [2021-12-21 22:20:43,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ef51a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:20:43, skipping insertion in model container [2021-12-21 22:20:43,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:20:43,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:20:43" (3/3) ... [2021-12-21 22:20:43,326 INFO L388 chiAutomizerObserver]: Analyzing ICFG test27-1.c [2021-12-21 22:20:43,360 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:20:43,360 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:20:43,361 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:20:43,361 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:20:43,361 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:20:43,361 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:20:43,361 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:20:43,361 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:20:43,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:43,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:20:43,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:43,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:43,396 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:20:43,396 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:43,396 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:20:43,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:43,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:20:43,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:43,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:43,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:20:43,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:43,404 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 14#L29-3true [2021-12-21 22:20:43,404 INFO L793 eck$LassoCheckResult]: Loop: 14#L29-3true assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 16#L29-2true main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14#L29-3true [2021-12-21 22:20:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 22:20:43,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:43,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478378170] [2021-12-21 22:20:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:43,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:43,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:43,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:43,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-21 22:20:43,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:43,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263927946] [2021-12-21 22:20:43,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:43,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:43,581 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:43,595 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-21 22:20:43,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:43,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398708206] [2021-12-21 22:20:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:43,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:43,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:43,684 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:44,448 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:20:44,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:20:44,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:20:44,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:20:44,449 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:20:44,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:44,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:20:44,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:20:44,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-1.c_Iteration1_Lasso [2021-12-21 22:20:44,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:20:44,450 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:20:44,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:44,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:20:45,200 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:20:45,203 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:20:45,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:45,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:45,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:20:45,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 22:20:45,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:20:45,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:45,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:45,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:45,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:45,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:20:45,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:20:45,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:20:45,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-21 22:20:45,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:45,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:45,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:20:45,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 22:20:45,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:20:45,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:45,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:45,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:45,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:45,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:20:45,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:20:45,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:20:45,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-21 22:20:45,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:45,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:45,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:20:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 22:20:45,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:20:45,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:45,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:20:45,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:45,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:45,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:45,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:20:45,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:20:45,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:20:45,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-21 22:20:45,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:45,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:45,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:20:45,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-21 22:20:45,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:20:45,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:45,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:45,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:45,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:45,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:20:45,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:20:45,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:20:45,457 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-21 22:20:45,457 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-21 22:20:45,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:45,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:20:45,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:20:45,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-21 22:20:45,527 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:20:45,527 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:20:45,527 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2021-12-21 22:20:45,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:20:45,622 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2021-12-21 22:20:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:45,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:20:45,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:45,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:20:45,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:45,752 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 22:20:45,753 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 [2021-12-21 22:20:45,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:45,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 56 transitions. Complement of second has 8 states. [2021-12-21 22:20:45,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 22:20:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-12-21 22:20:45,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-21 22:20:45,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:20:45,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-21 22:20:45,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:20:45,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-21 22:20:45,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:20:45,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2021-12-21 22:20:45,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:45,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2021-12-21 22:20:45,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-21 22:20:45,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:45,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2021-12-21 22:20:45,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:45,818 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-12-21 22:20:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2021-12-21 22:20:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-21 22:20:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2021-12-21 22:20:45,833 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-12-21 22:20:45,833 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-12-21 22:20:45,833 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:20:45,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2021-12-21 22:20:45,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:45,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:45,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:45,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:20:45,834 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:45,835 INFO L791 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 202#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 203#L29-3 assume !(main_~j~0#1 < 10); 204#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 199#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 200#L43-3 [2021-12-21 22:20:45,835 INFO L793 eck$LassoCheckResult]: Loop: 200#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 207#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 200#L43-3 [2021-12-21 22:20:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2021-12-21 22:20:45,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:45,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041797758] [2021-12-21 22:20:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:45,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:45,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:20:45,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041797758] [2021-12-21 22:20:45,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041797758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:20:45,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:20:45,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:20:45,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954355793] [2021-12-21 22:20:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:20:45,881 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:20:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2021-12-21 22:20:45,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627528917] [2021-12-21 22:20:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:45,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:45,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:45,889 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:45,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:20:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:20:45,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:20:45,912 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:20:45,920 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-12-21 22:20:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:20:45,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2021-12-21 22:20:45,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:45,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2021-12-21 22:20:45,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 22:20:45,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:45,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-12-21 22:20:45,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:45,922 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-21 22:20:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-12-21 22:20:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-12-21 22:20:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-12-21 22:20:45,924 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-21 22:20:45,924 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-21 22:20:45,924 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:20:45,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-12-21 22:20:45,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:45,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:45,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:45,925 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:20:45,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:45,925 INFO L791 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 228#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 229#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 230#L29-3 assume !(main_~j~0#1 < 10); 231#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 224#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 225#L43-3 [2021-12-21 22:20:45,925 INFO L793 eck$LassoCheckResult]: Loop: 225#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 232#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 225#L43-3 [2021-12-21 22:20:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2021-12-21 22:20:45,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882543306] [2021-12-21 22:20:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:45,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:45,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:20:45,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882543306] [2021-12-21 22:20:45,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882543306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:20:45,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326855163] [2021-12-21 22:20:45,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:45,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:20:45,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:45,966 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:20:45,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 22:20:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:46,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 22:20:46,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:46,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:20:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:46,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326855163] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:20:46,112 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:20:46,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-21 22:20:46,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300545360] [2021-12-21 22:20:46,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:20:46,113 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:20:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2021-12-21 22:20:46,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:46,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507092510] [2021-12-21 22:20:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:46,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,124 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:46,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:20:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 22:20:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:20:46,147 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:20:46,170 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2021-12-21 22:20:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 22:20:46,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2021-12-21 22:20:46,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:46,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2021-12-21 22:20:46,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 22:20:46,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:46,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2021-12-21 22:20:46,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:46,173 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-21 22:20:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2021-12-21 22:20:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-21 22:20:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-12-21 22:20:46,175 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-21 22:20:46,175 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-21 22:20:46,175 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:20:46,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-12-21 22:20:46,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:46,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:46,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:46,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2021-12-21 22:20:46,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:46,176 INFO L791 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 296#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 297#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 298#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 299#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 304#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 308#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 307#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 306#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 305#L29-3 assume !(main_~j~0#1 < 10); 302#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 294#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 295#L43-3 [2021-12-21 22:20:46,176 INFO L793 eck$LassoCheckResult]: Loop: 295#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 303#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 295#L43-3 [2021-12-21 22:20:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,177 INFO L85 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 2 times [2021-12-21 22:20:46,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:46,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436983413] [2021-12-21 22:20:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:46,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:46,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:20:46,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436983413] [2021-12-21 22:20:46,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436983413] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:20:46,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210145122] [2021-12-21 22:20:46,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:20:46,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:20:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:46,271 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:20:46,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 22:20:46,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 22:20:46,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:20:46,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:20:46,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:46,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:20:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:46,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210145122] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:20:46,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:20:46,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-21 22:20:46,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680789722] [2021-12-21 22:20:46,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:20:46,495 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:20:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2021-12-21 22:20:46,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:46,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499115366] [2021-12-21 22:20:46,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:46,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:46,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:20:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 22:20:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 22:20:46,527 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:20:46,569 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-12-21 22:20:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 22:20:46,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2021-12-21 22:20:46,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:46,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2021-12-21 22:20:46,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 22:20:46,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:46,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2021-12-21 22:20:46,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:46,571 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-21 22:20:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2021-12-21 22:20:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-21 22:20:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-12-21 22:20:46,573 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-21 22:20:46,573 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-21 22:20:46,573 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:20:46,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2021-12-21 22:20:46,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:46,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:46,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:46,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2021-12-21 22:20:46,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:46,575 INFO L791 eck$LassoCheckResult]: Stem: 426#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 427#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 428#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 429#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 430#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 431#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 434#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 450#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 449#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 448#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 447#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 446#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 445#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 444#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 443#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 442#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 441#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 440#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 439#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 438#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 437#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 436#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 435#L29-3 assume !(main_~j~0#1 < 10); 432#L29-4 assume main_~i~0#1 > 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (main_~i~0#1 - 1), main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, 4 + main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, 4 + main_#t~mem13#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 424#L41 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 425#L43-3 [2021-12-21 22:20:46,575 INFO L793 eck$LassoCheckResult]: Loop: 425#L43-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 433#L43-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 425#L43-3 [2021-12-21 22:20:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 3 times [2021-12-21 22:20:46,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:46,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926020566] [2021-12-21 22:20:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:46,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,985 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2021-12-21 22:20:46,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:46,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839450174] [2021-12-21 22:20:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:46,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,989 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:46,992 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1328236761, now seen corresponding path program 1 times [2021-12-21 22:20:46,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:46,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009045431] [2021-12-21 22:20:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:46,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,095 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,193 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace