./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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/ex3_forlist.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:09:17,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:09:17,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:09:17,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:09:17,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:09:17,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:09:17,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:09:17,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:09:17,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:09:17,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:09:17,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:09:17,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:09:17,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:09:17,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:09:17,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:09:17,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:09:17,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:09:17,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:09:17,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:09:17,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:09:17,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:09:17,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:09:17,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:09:17,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:09:17,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:09:17,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:09:17,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:09:17,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:09:17,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:09:17,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:09:17,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:09:17,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:09:17,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:09:17,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:09:17,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:09:17,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:09:17,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:09:17,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:09:17,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:09:17,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:09:17,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:09:17,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:09:17,285 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:09:17,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:09:17,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:09:17,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:09:17,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:09:17,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:09:17,287 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:09:17,287 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:09:17,287 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:09:17,288 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:09:17,288 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:09:17,295 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:09:17,295 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:09:17,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:09:17,296 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:09:17,296 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:09:17,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:09:17,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:09:17,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:09:17,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:09:17,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:09:17,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:09:17,297 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:09:17,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:09:17,297 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:09:17,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:09:17,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:09:17,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:09:17,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:09:17,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:09:17,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:09:17,299 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:09:17,300 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:09:17,300 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 -> 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 [2021-12-15 17:09:17,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:09:17,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:09:17,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:09:17,737 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:09:17,738 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:09:17,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-12-15 17:09:17,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d66b214/01ae886cfa8c4695b27075409368246d/FLAGf2324b8d5 [2021-12-15 17:09:18,435 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:09:18,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-12-15 17:09:18,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d66b214/01ae886cfa8c4695b27075409368246d/FLAGf2324b8d5 [2021-12-15 17:09:18,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d66b214/01ae886cfa8c4695b27075409368246d [2021-12-15 17:09:18,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:09:18,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:09:18,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:09:18,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:09:18,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:09:18,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:09:18" (1/1) ... [2021-12-15 17:09:18,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7351f70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:18, skipping insertion in model container [2021-12-15 17:09:18,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:09:18" (1/1) ... [2021-12-15 17:09:18,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:09:18,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:09:19,043 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/ex3_forlist.i[293,306] [2021-12-15 17:09:19,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:09:19,100 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:09:19,114 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/ex3_forlist.i[293,306] [2021-12-15 17:09:19,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:09:19,165 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:09:19,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19 WrapperNode [2021-12-15 17:09:19,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:09:19,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:09:19,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:09:19,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:09:19,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,247 INFO L137 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 138 [2021-12-15 17:09:19,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:09:19,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:09:19,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:09:19,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:09:19,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:09:19,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:09:19,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:09:19,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:09:19,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (1/1) ... [2021-12-15 17:09:19,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:19,374 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-15 17:09:19,411 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-15 17:09:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 17:09:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 17:09:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:09:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:09:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 17:09:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:09:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:09:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:09:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:09:19,551 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:09:19,567 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:09:19,920 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:09:19,928 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:09:19,930 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 17:09:19,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:09:19 BoogieIcfgContainer [2021-12-15 17:09:19,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:09:19,932 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:09:19,947 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:09:19,950 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:09:19,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:09:19,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:09:18" (1/3) ... [2021-12-15 17:09:19,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac6b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:09:19, skipping insertion in model container [2021-12-15 17:09:19,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:09:19,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:19" (2/3) ... [2021-12-15 17:09:19,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac6b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:09:19, skipping insertion in model container [2021-12-15 17:09:19,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:09:19,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:09:19" (3/3) ... [2021-12-15 17:09:19,954 INFO L388 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2021-12-15 17:09:20,015 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:09:20,016 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:09:20,016 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:09:20,016 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:09:20,029 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:09:20,029 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:09:20,030 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:09:20,030 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:09:20,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:09:20,085 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-12-15 17:09:20,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:20,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:20,098 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:09:20,099 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:09:20,099 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:09:20,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:09:20,116 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-12-15 17:09:20,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:20,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:20,117 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:09:20,117 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:09:20,122 INFO L791 eck$LassoCheckResult]: Stem: 19#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 36#L19-3true [2021-12-15 17:09:20,122 INFO L793 eck$LassoCheckResult]: Loop: 36#L19-3true assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 3#L19-2true init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 36#L19-3true [2021-12-15 17:09:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:09:20,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:20,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180085688] [2021-12-15 17:09:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:20,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:20,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:20,334 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-15 17:09:20,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:20,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878971807] [2021-12-15 17:09:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:20,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:20,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:20,431 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-15 17:09:20,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:20,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686194228] [2021-12-15 17:09:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:20,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:20,507 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:20,536 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:21,267 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:09:21,268 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:09:21,268 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:09:21,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:09:21,268 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:09:21,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:21,269 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:09:21,269 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:09:21,269 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2021-12-15 17:09:21,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:09:21,269 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:09:21,312 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-15 17:09:21,316 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-15 17:09:21,318 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-15 17:09:21,321 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-15 17:09:21,838 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-15 17:09:21,842 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-15 17:09:21,844 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-15 17:09:21,846 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-15 17:09:21,848 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-15 17:09:21,850 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-15 17:09:21,852 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-15 17:09:21,854 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-15 17:09:21,856 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-15 17:09:21,860 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-15 17:09:21,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-15 17:09:22,305 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:09:22,311 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:09:22,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,327 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-15 17:09:22,342 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-15 17:09:22,343 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-15 17:09:22,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:09:22,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:09:22,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:09:22,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,398 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-15 17:09:22,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,412 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-15 17:09:22,413 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-15 17:09:22,414 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-15 17:09:22,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:09:22,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:09:22,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:09:22,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:22,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,449 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-15 17:09:22,450 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-15 17:09:22,452 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-15 17:09:22,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,496 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-15 17:09:22,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,498 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-15 17:09:22,499 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-15 17:09:22,501 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-15 17:09:22,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,549 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-15 17:09:22,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,551 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-15 17:09:22,552 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-15 17:09:22,561 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-15 17:09:22,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,602 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-15 17:09:22,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:09:22,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:09:22,606 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-15 17:09:22,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:22,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,683 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:09:22,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:09:22,709 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-15 17:09:22,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:22,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,772 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:09:22,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-15 17:09:22,777 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-15 17:09:22,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-15 17:09:22,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:09:22,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-15 17:09:22,862 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-15 17:09:22,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:22,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,926 INFO L229 MonitoredProcess]: Starting monitored process 11 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-15 17:09:22,930 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-15 17:09:22,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:22,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:22,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:22,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:09:22,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:22,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:22,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:22,985 INFO L229 MonitoredProcess]: Starting monitored process 12 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-15 17:09:22,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:09:22,989 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-15 17:09:22,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:22,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:22,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:22,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:23,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:23,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:23,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:23,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:23,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:23,035 INFO L229 MonitoredProcess]: Starting monitored process 13 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-15 17:09:23,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:09:23,037 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-15 17:09:23,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:23,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:23,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:23,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:23,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:23,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:23,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:23,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:23,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:23,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:23,098 INFO L229 MonitoredProcess]: Starting monitored process 14 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-15 17:09:23,105 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-15 17:09:23,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:23,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:23,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:23,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:23,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:23,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:23,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:09:23,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:09:23,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:23,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:23,189 INFO L229 MonitoredProcess]: Starting monitored process 15 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-15 17:09:23,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:09:23,225 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-15 17:09:23,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:09:23,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:09:23,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:09:23,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:09:23,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:09:23,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:09:23,268 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:09:23,351 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2021-12-15 17:09:23,352 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-12-15 17:09:23,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:23,368 INFO L229 MonitoredProcess]: Starting monitored process 16 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-15 17:09:23,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:09:23,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:09:23,422 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:09:23,423 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:09:23,423 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0#1) = -2*ULTIMATE.start_init_~i~0#1 + 3 Supporting invariants [] [2021-12-15 17:09:23,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-15 17:09:23,542 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-12-15 17:09:23,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:23,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:09:23,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:09:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:23,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:09:23,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:09:23,653 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-15 17:09:23,701 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-15 17:09:23,703 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 17:09:23,814 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 95 states and 138 transitions. Complement of second has 7 states. [2021-12-15 17:09:23,828 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-15 17:09:23,834 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-15 17:09:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-12-15 17:09:23,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-15 17:09:23,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:09:23,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-15 17:09:23,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:09:23,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-15 17:09:23,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:09:23,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 138 transitions. [2021-12-15 17:09:23,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-15 17:09:23,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 28 states and 37 transitions. [2021-12-15 17:09:23,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-15 17:09:23,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-15 17:09:23,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-12-15 17:09:23,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:09:23,877 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-15 17:09:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-12-15 17:09:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 17:09:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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-15 17:09:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-12-15 17:09:23,911 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-15 17:09:23,912 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-15 17:09:23,912 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:09:23,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-12-15 17:09:23,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-15 17:09:23,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:23,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:23,914 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:09:23,914 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:09:23,915 INFO L791 eck$LassoCheckResult]: Stem: 282#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 271#L19-3 assume !(init_~i~0#1 < 2); 286#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 277#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 273#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 266#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 267#L27-3 [2021-12-15 17:09:23,915 INFO L793 eck$LassoCheckResult]: Loop: 267#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 288#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 272#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 267#L27-3 [2021-12-15 17:09:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2021-12-15 17:09:23,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:23,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985966981] [2021-12-15 17:09:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:23,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:23,992 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-15 17:09:23,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:09:23,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985966981] [2021-12-15 17:09:23,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985966981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:09:23,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:09:23,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:09:23,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394455220] [2021-12-15 17:09:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:09:23,997 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:09:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2021-12-15 17:09:23,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:23,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525854083] [2021-12-15 17:09:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:23,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,021 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:24,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:09:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:09:24,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:09:24,077 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-15 17:09:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:09:24,091 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-12-15 17:09:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:09:24,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2021-12-15 17:09:24,093 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-15 17:09:24,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2021-12-15 17:09:24,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-15 17:09:24,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-15 17:09:24,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2021-12-15 17:09:24,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:09:24,098 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-15 17:09:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2021-12-15 17:09:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-15 17:09:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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-15 17:09:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-12-15 17:09:24,103 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-12-15 17:09:24,103 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-12-15 17:09:24,103 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:09:24,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2021-12-15 17:09:24,106 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-15 17:09:24,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:24,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:24,107 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:09:24,107 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:09:24,107 INFO L791 eck$LassoCheckResult]: Stem: 345#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 334#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 324#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 325#L19-3 assume !(init_~i~0#1 < 2); 349#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 337#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 336#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 326#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 327#L27-3 [2021-12-15 17:09:24,107 INFO L793 eck$LassoCheckResult]: Loop: 327#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 351#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 335#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 327#L27-3 [2021-12-15 17:09:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2021-12-15 17:09:24,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702854732] [2021-12-15 17:09:24,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:24,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:24,172 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-15 17:09:24,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:09:24,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702854732] [2021-12-15 17:09:24,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702854732] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:09:24,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226022893] [2021-12-15 17:09:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:24,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:09:24,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:24,175 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:09:24,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 17:09:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:24,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:09:24,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:09:24,325 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-15 17:09:24,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:09:24,372 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-15 17:09:24,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226022893] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:09:24,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:09:24,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-15 17:09:24,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917076799] [2021-12-15 17:09:24,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:09:24,373 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:09:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2021-12-15 17:09:24,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:24,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289114561] [2021-12-15 17:09:24,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:24,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:24,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-15 17:09:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,400 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:24,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:09:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:09:24,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:09:24,473 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-15 17:09:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:09:24,493 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-12-15 17:09:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:09:24,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2021-12-15 17:09:24,498 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-15 17:09:24,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2021-12-15 17:09:24,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-15 17:09:24,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-15 17:09:24,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2021-12-15 17:09:24,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:09:24,500 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-15 17:09:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2021-12-15 17:09:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-15 17:09:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:09:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-12-15 17:09:24,518 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-15 17:09:24,518 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-15 17:09:24,518 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:09:24,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2021-12-15 17:09:24,519 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-15 17:09:24,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:24,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:24,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:09:24,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:09:24,520 INFO L791 eck$LassoCheckResult]: Stem: 459#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 445#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 446#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 438#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 439#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 466#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 467#L19-3 assume !(init_~i~0#1 < 2); 463#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 451#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 450#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 440#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 441#L27-3 [2021-12-15 17:09:24,520 INFO L793 eck$LassoCheckResult]: Loop: 441#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 465#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 449#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 441#L27-3 [2021-12-15 17:09:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2021-12-15 17:09:24,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:24,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093400875] [2021-12-15 17:09:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:24,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2021-12-15 17:09:24,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:24,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652688566] [2021-12-15 17:09:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:24,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:24,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:24,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:24,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2021-12-15 17:09:24,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:24,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145275354] [2021-12-15 17:09:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:24,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:09:24,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:09:24,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145275354] [2021-12-15 17:09:24,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145275354] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:09:24,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81142652] [2021-12-15 17:09:24,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:24,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:09:24,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:24,908 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:09:24,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 17:09:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:25,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-15 17:09:25,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:09:25,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-15 17:09:25,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:09:25,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 17:09:25,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-15 17:09:25,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:09:25,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 17:09:25,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:09:25,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 17:09:25,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:09:25,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 17:09:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:09:25,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 17:09:25,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:09:25,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 17:09:25,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 17:09:25,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 17:09:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:09:25,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:09:25,587 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_init_~i~0#1| 4)) v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_init_~i~0#1| 4)) v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))) is different from false [2021-12-15 17:09:25,636 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_init_~i~0#1_113| Int)) (or (< |v_ULTIMATE.start_init_~i~0#1_113| (+ |c_ULTIMATE.start_init_~i~0#1| 1)) (and (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_init_~i~0#1_113| 4)) v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_init_~i~0#1_113| 4)) v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))))) is different from false [2021-12-15 17:09:25,660 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:09:25,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2021-12-15 17:09:25,666 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:09:25,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 82 [2021-12-15 17:09:25,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2021-12-15 17:09:25,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 128 [2021-12-15 17:09:25,692 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:09:25,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 146 [2021-12-15 17:09:25,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 180 [2021-12-15 17:09:25,722 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:09:25,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 198 [2021-12-15 17:09:25,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 210 [2021-12-15 17:09:25,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 173 [2021-12-15 17:09:25,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2021-12-15 17:09:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-15 17:09:25,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81142652] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:09:25,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:09:25,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2021-12-15 17:09:25,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28435077] [2021-12-15 17:09:25,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:09:25,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:09:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-15 17:09:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=294, Unknown=2, NotChecked=74, Total=462 [2021-12-15 17:09:25,942 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 states have internal predecessors, (39), 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-15 17:09:38,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_init_~i~0#1| 4)))) (and (= |c_ULTIMATE.start_init_~i~0#1| 0) (forall ((|v_ULTIMATE.start_init_~i~0#1_113| Int)) (or (< |v_ULTIMATE.start_init_~i~0#1_113| (+ |c_ULTIMATE.start_init_~i~0#1| 1)) (and (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_init_~i~0#1_113| 4)) v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_init_~i~0#1_113| 4)) v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))))) (= |c_~#pp~0.offset| 0) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0) 0))) is different from false [2021-12-15 17:09:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:09:38,262 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-12-15 17:09:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 17:09:38,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2021-12-15 17:09:38,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-15 17:09:38,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2021-12-15 17:09:38,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-15 17:09:38,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-15 17:09:38,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-12-15 17:09:38,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:09:38,264 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-15 17:09:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-12-15 17:09:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-15 17:09:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:09:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-12-15 17:09:38,266 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-15 17:09:38,266 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-15 17:09:38,266 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:09:38,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2021-12-15 17:09:38,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-15 17:09:38,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:38,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:38,266 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:09:38,266 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:09:38,266 INFO L791 eck$LassoCheckResult]: Stem: 631#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 618#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 619#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 611#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 612#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 638#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 639#L19-3 assume !(init_~i~0#1 < 2); 635#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 623#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 622#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 613#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 614#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 637#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 633#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 632#L27-7 [2021-12-15 17:09:38,267 INFO L793 eck$LassoCheckResult]: Loop: 632#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 624#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 626#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 632#L27-7 [2021-12-15 17:09:38,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2021-12-15 17:09:38,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:38,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476463575] [2021-12-15 17:09:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:38,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:38,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:38,337 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2021-12-15 17:09:38,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:38,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664869439] [2021-12-15 17:09:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:38,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:38,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:38,358 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2021-12-15 17:09:38,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:38,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309632651] [2021-12-15 17:09:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:38,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:38,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:38,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:55,820 WARN L227 SmtUtils]: Spent 17.29s on a formula simplification. DAG size of input: 294 DAG size of output: 249 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-15 17:10:02,629 WARN L227 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 186 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-15 17:10:02,634 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:10:02,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:10:02,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:10:02,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:10:02,635 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:10:02,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:02,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:10:02,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:10:02,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2021-12-15 17:10:02,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:10:02,635 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:10:02,637 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-15 17:10:02,639 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-15 17:10:02,641 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-15 17:10:02,642 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-15 17:10:06,239 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-15 17:10:06,244 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-15 17:10:06,246 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-15 17:10:06,248 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-15 17:10:06,249 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-15 17:10:06,250 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-15 17:10:06,251 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-15 17:10:06,253 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-15 17:10:06,254 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-15 17:10:06,255 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-15 17:10:06,256 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-15 17:10:06,259 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-15 17:10:06,633 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:10:06,633 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:10:06,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:06,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:06,638 INFO L229 MonitoredProcess]: Starting monitored process 19 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-15 17:10:06,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-15 17:10:06,643 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-15 17:10:06,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:06,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:06,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:06,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:06,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:06,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:06,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:06,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:06,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-15 17:10:06,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:06,672 INFO L229 MonitoredProcess]: Starting monitored process 20 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-15 17:10:06,678 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-15 17:10:06,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-15 17:10:06,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:06,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:06,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:06,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:06,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:06,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:06,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:06,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:06,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:06,734 INFO L229 MonitoredProcess]: Starting monitored process 21 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-15 17:10:06,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-15 17:10:06,737 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-15 17:10:06,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:06,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:10:06,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:06,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:06,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:06,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:10:06,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:10:06,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:06,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:06,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:06,762 INFO L229 MonitoredProcess]: Starting monitored process 22 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-15 17:10:06,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-15 17:10:06,767 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-15 17:10:06,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:06,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:06,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:06,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:06,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:06,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:06,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:06,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:06,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:06,802 INFO L229 MonitoredProcess]: Starting monitored process 23 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-15 17:10:06,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-15 17:10:06,804 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-15 17:10:06,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:06,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:06,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:06,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:06,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:06,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:06,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:06,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:06,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:06,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:06,835 INFO L229 MonitoredProcess]: Starting monitored process 24 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-15 17:10:06,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-15 17:10:06,838 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-15 17:10:06,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:06,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:06,844 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-12-15 17:10:06,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:06,880 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2021-12-15 17:10:06,881 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2021-12-15 17:10:06,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:10:06,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:06,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:06,962 INFO L229 MonitoredProcess]: Starting monitored process 25 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-15 17:10:06,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-15 17:10:06,965 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-15 17:10:06,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:10:06,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:10:06,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:10:06,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:10:06,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:10:06,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:10:06,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:10:07,040 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2021-12-15 17:10:07,041 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-12-15 17:10:07,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:10:07,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:07,042 INFO L229 MonitoredProcess]: Starting monitored process 26 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-15 17:10:07,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:10:07,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-15 17:10:07,084 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:10:07,084 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:10:07,084 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1, v_rep(select #length 4)_2) = -16*ULTIMATE.start_f_~i~1#1 + 3*v_rep(select #length 4)_2 Supporting invariants [] [2021-12-15 17:10:07,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-15 17:10:07,248 INFO L297 tatePredicateManager]: 50 out of 53 supporting invariants were superfluous and have been removed [2021-12-15 17:10:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:07,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:10:07,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:07,450 WARN L261 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:10:07,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:07,488 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-15 17:10:07,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-15 17:10:07,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:07,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:10:07,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 88 transitions. Complement of second has 11 states. [2021-12-15 17:10:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:10:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2021-12-15 17:10:07,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-15 17:10:07,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:07,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-15 17:10:07,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:07,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-15 17:10:07,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:10:07,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2021-12-15 17:10:07,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-15 17:10:07,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2021-12-15 17:10:07,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-12-15 17:10:07,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:07,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2021-12-15 17:10:07,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:07,605 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2021-12-15 17:10:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2021-12-15 17:10:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2021-12-15 17:10:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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-15 17:10:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-15 17:10:07,606 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-15 17:10:07,606 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-15 17:10:07,606 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:10:07,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-12-15 17:10:07,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-15 17:10:07,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:07,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:07,607 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:07,607 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:10:07,607 INFO L791 eck$LassoCheckResult]: Stem: 1035#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1021#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1022#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1014#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1015#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1043#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1044#L19-3 assume !(init_~i~0#1 < 2); 1040#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1030#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1025#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1019#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1020#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1042#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1037#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1038#L27-7 assume !(f_~i~1#1 < 2); 1027#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1016#L38-3 [2021-12-15 17:10:07,607 INFO L793 eck$LassoCheckResult]: Loop: 1016#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1018#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1033#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1016#L38-3 [2021-12-15 17:10:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2021-12-15 17:10:07,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:07,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544213028] [2021-12-15 17:10:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:07,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 17:10:07,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:07,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544213028] [2021-12-15 17:10:07,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544213028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:10:07,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:10:07,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:10:07,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135074268] [2021-12-15 17:10:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:10:07,646 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 1 times [2021-12-15 17:10:07,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615767445] [2021-12-15 17:10:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:07,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:07,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:07,654 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:07,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:07,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:10:07,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:10:07,688 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-15 17:10:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:07,701 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-12-15 17:10:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:10:07,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-12-15 17:10:07,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-15 17:10:07,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-12-15 17:10:07,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-12-15 17:10:07,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-12-15 17:10:07,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-12-15 17:10:07,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:07,707 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-15 17:10:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-12-15 17:10:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2021-12-15 17:10:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-12-15 17:10:07,709 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-12-15 17:10:07,709 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-12-15 17:10:07,709 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:10:07,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2021-12-15 17:10:07,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-15 17:10:07,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:07,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:07,710 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:07,711 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:10:07,711 INFO L791 eck$LassoCheckResult]: Stem: 1118#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1107#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1097#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1098#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1126#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1127#L19-3 assume !(init_~i~0#1 < 2); 1123#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1109#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1108#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1099#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1100#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1125#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1120#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1121#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1110#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1111#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1101#L38-3 [2021-12-15 17:10:07,711 INFO L793 eck$LassoCheckResult]: Loop: 1101#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1103#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1116#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1101#L38-3 [2021-12-15 17:10:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2021-12-15 17:10:07,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:07,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499560597] [2021-12-15 17:10:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:07,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 17:10:07,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:07,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499560597] [2021-12-15 17:10:07,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499560597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:10:07,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:10:07,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 17:10:07,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505525903] [2021-12-15 17:10:07,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:10:07,840 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 2 times [2021-12-15 17:10:07,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:07,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646680416] [2021-12-15 17:10:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:07,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:07,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:07,845 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:07,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:07,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 17:10:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-15 17:10:07,903 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:10:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:08,080 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-12-15 17:10:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:10:08,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2021-12-15 17:10:08,081 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-15 17:10:08,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2021-12-15 17:10:08,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-12-15 17:10:08,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:08,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2021-12-15 17:10:08,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:08,082 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-12-15 17:10:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2021-12-15 17:10:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2021-12-15 17:10:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-15 17:10:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-12-15 17:10:08,084 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-12-15 17:10:08,084 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-12-15 17:10:08,084 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:10:08,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2021-12-15 17:10:08,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-15 17:10:08,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:08,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:08,085 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:08,085 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:10:08,085 INFO L791 eck$LassoCheckResult]: Stem: 1219#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1208#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1198#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1199#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1227#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1228#L19-3 assume !(init_~i~0#1 < 2); 1224#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1214#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1209#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1200#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1201#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1226#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1221#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1222#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1212#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1213#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1220#L27-7 assume !(f_~i~1#1 < 2); 1211#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1202#L38-3 [2021-12-15 17:10:08,085 INFO L793 eck$LassoCheckResult]: Loop: 1202#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1204#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1217#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1202#L38-3 [2021-12-15 17:10:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:08,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2021-12-15 17:10:08,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:08,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889160739] [2021-12-15 17:10:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:08,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 17:10:08,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:08,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889160739] [2021-12-15 17:10:08,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889160739] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899418004] [2021-12-15 17:10:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:08,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:08,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:08,127 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:08,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-15 17:10:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:08,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:10:08,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 17:10:08,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:10:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 17:10:08,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899418004] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:10:08,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:10:08,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-15 17:10:08,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187344416] [2021-12-15 17:10:08,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:10:08,315 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:10:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 3 times [2021-12-15 17:10:08,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:08,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904350040] [2021-12-15 17:10:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:08,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:08,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:08,321 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:08,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:08,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:10:08,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:10:08,358 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-15 17:10:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:10:08,373 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-12-15 17:10:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:10:08,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-12-15 17:10:08,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-15 17:10:08,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-12-15 17:10:08,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-12-15 17:10:08,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-15 17:10:08,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-12-15 17:10:08,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:10:08,376 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-15 17:10:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-12-15 17:10:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2021-12-15 17:10:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 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-15 17:10:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-15 17:10:08,378 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-15 17:10:08,378 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-15 17:10:08,378 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:10:08,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2021-12-15 17:10:08,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-15 17:10:08,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:10:08,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:10:08,379 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:10:08,379 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:10:08,379 INFO L791 eck$LassoCheckResult]: Stem: 1412#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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1399#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1391#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1392#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1421#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1422#L19-3 assume !(init_~i~0#1 < 2); 1417#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1403#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1402#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1393#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1394#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1419#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1414#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1415#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1406#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1407#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1413#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1404#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1405#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1395#L38-3 [2021-12-15 17:10:08,380 INFO L793 eck$LassoCheckResult]: Loop: 1395#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1397#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1410#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1395#L38-3 [2021-12-15 17:10:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2021-12-15 17:10:08,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:08,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797372771] [2021-12-15 17:10:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:08,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:08,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:08,416 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 4 times [2021-12-15 17:10:08,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:08,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345839910] [2021-12-15 17:10:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:08,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:08,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:10:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:10:08,421 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:10:08,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:10:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash 951949698, now seen corresponding path program 1 times [2021-12-15 17:10:08,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:10:08,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197577632] [2021-12-15 17:10:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:08,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:10:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 17:10:08,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:10:08,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197577632] [2021-12-15 17:10:08,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197577632] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:10:08,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577967504] [2021-12-15 17:10:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:10:08,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:10:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:10:08,695 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:10:08,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-15 17:10:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:10:08,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-15 17:10:08,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:10:09,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-15 17:10:09,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:10:09,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 17:10:09,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-15 17:10:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:10:09,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 17:10:09,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:10:09,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 17:10:09,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:10:09,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 17:10:09,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:10:09,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 17:10:09,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:10:09,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 17:10:09,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 17:10:09,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 17:10:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 17:10:09,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:10:09,507 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |c_ULTIMATE.start_f_~i~1#1| 4) |c_~#pp~0.offset|) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |c_ULTIMATE.start_f_~i~1#1| 4) |c_~#pp~0.offset|) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-15 17:10:09,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (< |v_ULTIMATE.start_f_~i~1#1_83| (+ |c_ULTIMATE.start_f_~i~1#1| 1)) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2021-12-15 17:10:09,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (< |v_ULTIMATE.start_f_~i~1#1_83| 1) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2021-12-15 17:10:09,661 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:10:09,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2021-12-15 17:10:09,665 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:10:09,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 82 [2021-12-15 17:10:09,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2021-12-15 17:10:09,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2021-12-15 17:10:09,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 162 [2021-12-15 17:10:09,685 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:10:09,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 180 [2021-12-15 17:10:09,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:10:09,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 198 [2021-12-15 17:10:09,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 210 [2021-12-15 17:10:09,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 173 [2021-12-15 17:10:09,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2021-12-15 17:10:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-12-15 17:10:09,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577967504] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:10:09,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:10:09,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 31 [2021-12-15 17:10:09,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852199895] [2021-12-15 17:10:09,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:10:09,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:10:09,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 17:10:09,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=674, Unknown=3, NotChecked=168, Total=992 [2021-12-15 17:10:09,903 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 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-15 17:10:22,024 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (< |v_ULTIMATE.start_f_~i~1#1_83| 1) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|))))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_malloc_#res#1.base| 0) (not (= |c_~#pstate~0.base| |c_~#pp~0.base|)) (<= 5 |c_~#pstate~0.base|) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_f_~i~1#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 1) (= |c_ULTIMATE.start_main_~a~0#1.base| 0) (= |c_~#pp~0.offset| 0) (<= |c_~#pp~0.base| 4) (= |c_ULTIMATE.start_f_~pointer#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_f_~pointer#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) is different from false [2021-12-15 17:10:34,031 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.base| 0) (= |c_~#pp~0.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (< |v_ULTIMATE.start_f_~i~1#1_83| (+ |c_ULTIMATE.start_f_~i~1#1| 1)) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_83| 4) |c_~#pp~0.offset|) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|))))) (= |c_ULTIMATE.start_f_~i~1#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 1)) is different from false