./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety/test-memleak_nexttime.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/memsafety/test-memleak_nexttime.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 60a24c4f5e174a9ae46b1f077c5e18d0598bd760 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:39:53,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:39:53,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:39:53,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:39:53,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:39:53,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:39:53,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:39:53,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:39:53,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:39:53,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:39:53,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:39:53,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:39:53,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:39:53,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:39:53,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:39:53,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:39:53,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:39:53,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:39:53,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:39:53,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:39:53,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:39:53,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:39:53,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:39:53,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:39:53,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:39:53,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:39:53,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:39:53,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:39:53,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:39:53,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:39:53,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:39:53,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:39:53,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:39:53,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:39:53,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:39:53,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:39:53,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:39:53,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:39:53,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:39:53,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:39:53,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:39:53,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:39:53,220 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:39:53,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:39:53,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:39:53,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:39:53,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:39:53,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:39:53,223 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:39:53,224 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:39:53,224 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:39:53,224 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:39:53,225 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:39:53,225 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:39:53,225 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:39:53,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:39:53,226 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:39:53,226 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:39:53,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:39:53,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:39:53,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:39:53,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:39:53,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:39:53,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:39:53,235 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:39:53,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:39:53,236 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:39:53,236 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:39:53,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:39:53,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:39:53,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:39:53,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:39:53,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:39:53,237 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:39:53,238 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:39:53,239 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 -> 60a24c4f5e174a9ae46b1f077c5e18d0598bd760 [2021-08-27 17:39:53,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:39:53,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:39:53,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:39:53,564 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:39:53,564 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:39:53,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2021-08-27 17:39:53,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3703cd55f/eefbc08fa70e48eb9bddf05377f09f15/FLAGd8ed349e8 [2021-08-27 17:39:54,121 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:39:54,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2021-08-27 17:39:54,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3703cd55f/eefbc08fa70e48eb9bddf05377f09f15/FLAGd8ed349e8 [2021-08-27 17:39:54,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3703cd55f/eefbc08fa70e48eb9bddf05377f09f15 [2021-08-27 17:39:54,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:39:54,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:39:54,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:39:54,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:39:54,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:39:54,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daab46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54, skipping insertion in model container [2021-08-27 17:39:54,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:39:54,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:39:54,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:39:54,808 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:39:54,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:39:54,878 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:39:54,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54 WrapperNode [2021-08-27 17:39:54,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:39:54,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:39:54,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:39:54,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:39:54,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:39:54,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:39:54,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:39:54,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:39:54,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:39:54,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:39:54,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:39:54,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:39:54,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (1/1) ... [2021-08-27 17:39:54,957 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:54,977 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-08-27 17:39:54,986 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-08-27 17:39:55,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-08-27 17:39:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-08-27 17:39:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-08-27 17:39:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-08-27 17:39:55,016 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-08-27 17:39:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 17:39:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:39:55,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:39:55,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:39:55,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 17:39:55,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:39:55,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-08-27 17:39:55,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:39:55,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:39:55,316 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 17:39:55,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:39:55,347 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-27 17:39:55,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:55 BoogieIcfgContainer [2021-08-27 17:39:55,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:39:55,350 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:39:55,350 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:39:55,352 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:39:55,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:55,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:39:54" (1/3) ... [2021-08-27 17:39:55,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@202d55c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:39:55, skipping insertion in model container [2021-08-27 17:39:55,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:55,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:54" (2/3) ... [2021-08-27 17:39:55,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@202d55c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:39:55, skipping insertion in model container [2021-08-27 17:39:55,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:55,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:55" (3/3) ... [2021-08-27 17:39:55,356 INFO L389 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime.i [2021-08-27 17:39:55,390 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:39:55,390 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:39:55,391 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:39:55,391 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:39:55,391 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:39:55,391 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:39:55,391 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:39:55,391 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:39:55,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 17:39:55,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2021-08-27 17:39:55,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:55,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:55,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:39:55,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 17:39:55,431 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:39:55,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 17:39:55,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2021-08-27 17:39:55,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:55,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:55,433 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:39:55,433 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 17:39:55,439 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 10#L-1true havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);havoc foo_#t~malloc5.base, foo_#t~malloc5.offset; 8#L644true call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 9##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 7#$Ultimate##0true #t~loopctr10 := 0; 5#L-1-1true [2021-08-27 17:39:55,439 INFO L793 eck$LassoCheckResult]: Loop: 5#L-1-1true assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 5#L-1-1true [2021-08-27 17:39:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2021-08-27 17:39:55,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:55,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730613539] [2021-08-27 17:39:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:55,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:55,590 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:55,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2021-08-27 17:39:55,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:55,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462851596] [2021-08-27 17:39:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:55,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:55,689 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:55,697 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2021-08-27 17:39:55,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:55,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013773881] [2021-08-27 17:39:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:55,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:55,722 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:55,770 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:57,808 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:39:57,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:39:57,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:39:57,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:39:57,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:39:57,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:57,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:39:57,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:39:57,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration1_Lasso [2021-08-27 17:39:57,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:39:57,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:39:57,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:57,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:57,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:57,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:57,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-08-27 17:39:57,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-08-27 17:39:58,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:58,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:39:59,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:39:59,192 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:39:59,194 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,200 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-08-27 17:39:59,209 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-08-27 17:39:59,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:39:59,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:39:59,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:39:59,224 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-08-27 17:39:59,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,262 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-08-27 17:39:59,262 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,264 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-08-27 17:39:59,265 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-08-27 17:39:59,268 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-08-27 17:39:59,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:39:59,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:39:59,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:39:59,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,322 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-08-27 17:39:59,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,323 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-08-27 17:39:59,332 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-08-27 17:39:59,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:39:59,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:39:59,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:39:59,342 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-08-27 17:39:59,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,374 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-08-27 17:39:59,374 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,375 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-08-27 17:39:59,383 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-08-27 17:39:59,385 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-08-27 17:39:59,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:39:59,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:39:59,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:39:59,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-08-27 17:39:59,413 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,414 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-08-27 17:39:59,415 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-08-27 17:39:59,416 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-08-27 17:39:59,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,465 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-08-27 17:39:59,465 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,466 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-08-27 17:39:59,467 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-08-27 17:39:59,469 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-08-27 17:39:59,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,523 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-08-27 17:39:59,523 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,524 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-08-27 17:39:59,534 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-08-27 17:39:59,540 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-08-27 17:39:59,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,567 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-08-27 17:39:59,567 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,568 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-08-27 17:39:59,569 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-08-27 17:39:59,570 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-08-27 17:39:59,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 17:39:59,612 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,613 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-08-27 17:39:59,618 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-08-27 17:39:59,619 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-08-27 17:39:59,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-08-27 17:39:59,648 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,649 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-08-27 17:39:59,650 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-08-27 17:39:59,651 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-08-27 17:39:59,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,694 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-08-27 17:39:59,695 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,696 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-08-27 17:39:59,703 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-08-27 17:39:59,706 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-08-27 17:39:59,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-08-27 17:39:59,736 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,737 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-08-27 17:39:59,738 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-08-27 17:39:59,739 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-08-27 17:39:59,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,772 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-08-27 17:39:59,773 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,773 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-08-27 17:39:59,774 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-08-27 17:39:59,775 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-08-27 17:39:59,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,806 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-08-27 17:39:59,806 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,807 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-08-27 17:39:59,808 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-08-27 17:39:59,809 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-08-27 17:39:59,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 17:39:59,868 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,881 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-08-27 17:39:59,882 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-08-27 17:39:59,884 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-08-27 17:39:59,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,916 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-08-27 17:39:59,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,917 INFO L229 MonitoredProcess]: Starting monitored process 17 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-08-27 17:39:59,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 17:39:59,919 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-08-27 17:39:59,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-08-27 17:39:59,947 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,948 INFO L229 MonitoredProcess]: Starting monitored process 18 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-08-27 17:39:59,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 17:39:59,951 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-08-27 17:39:59,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:39:59,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:39:59,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 17:39:59,980 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:59,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:59,980 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-08-27 17:39:59,981 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-08-27 17:39:59,982 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-08-27 17:39:59,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:39:59,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:39:59,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:39:59,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:39:59,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:39:59,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:00,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:00,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 17:40:00,032 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:00,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:00,033 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-08-27 17:40:00,038 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-08-27 17:40:00,043 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-08-27 17:40:00,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:00,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:00,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:00,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:00,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:00,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:00,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:00,072 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-08-27 17:40:00,072 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:00,073 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-08-27 17:40:00,076 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-08-27 17:40:00,077 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-08-27 17:40:00,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:00,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:00,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:00,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:00,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:00,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:00,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:00,129 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-08-27 17:40:00,130 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:00,131 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-08-27 17:40:00,132 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-08-27 17:40:00,134 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-08-27 17:40:00,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:00,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:00,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:00,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:00,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:00,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:00,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:00,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-08-27 17:40:00,195 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:00,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:00,196 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-08-27 17:40:00,198 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-08-27 17:40:00,198 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-08-27 17:40:00,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:00,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:00,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:00,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:00,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:00,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:00,235 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:40:00,286 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-08-27 17:40:00,286 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-08-27 17:40:00,287 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:00,312 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-08-27 17:40:00,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:40:00,365 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-08-27 17:40:00,386 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:40:00,386 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:40:00,387 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr10) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr10 Supporting invariants [] [2021-08-27 17:40:00,420 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-08-27 17:40:00,499 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2021-08-27 17:40:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:00,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:40:00,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:00,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:40:00,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:00,618 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2021-08-27 17:40:00,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:00,673 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-08-27 17:40:00,697 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 34 transitions. Complement of second has 6 states. [2021-08-27 17:40:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:40:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2021-08-27 17:40:00,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2021-08-27 17:40:00,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:40:00,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2021-08-27 17:40:00,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:40:00,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2021-08-27 17:40:00,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:40:00,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2021-08-27 17:40:00,705 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:00,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2021-08-27 17:40:00,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-08-27 17:40:00,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:40:00,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2021-08-27 17:40:00,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:00,710 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-08-27 17:40:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2021-08-27 17:40:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-08-27 17:40:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 17:40:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-08-27 17:40:00,731 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-08-27 17:40:00,731 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-08-27 17:40:00,731 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:40:00,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2021-08-27 17:40:00,732 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:00,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:00,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:00,733 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:40:00,733 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 17:40:00,733 INFO L791 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 209#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);havoc foo_#t~malloc5.base, foo_#t~malloc5.offset; 206#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 213##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 217#$Ultimate##0 #t~loopctr10 := 0; 216#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 207#L-1-3 [2021-08-27 17:40:00,733 INFO L793 eck$LassoCheckResult]: Loop: 207#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 207#L-1-3 [2021-08-27 17:40:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2021-08-27 17:40:00,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514162178] [2021-08-27 17:40:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:00,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:00,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514162178] [2021-08-27 17:40:00,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514162178] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:00,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:00,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:40:00,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516168310] [2021-08-27 17:40:00,788 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2021-08-27 17:40:00,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352520037] [2021-08-27 17:40:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,794 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,798 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:00,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:40:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:40:00,869 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:00,897 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2021-08-27 17:40:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:40:00,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2021-08-27 17:40:00,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:00,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2021-08-27 17:40:00,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:40:00,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:40:00,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2021-08-27 17:40:00,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:00,901 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-08-27 17:40:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2021-08-27 17:40:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-27 17:40:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 17:40:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2021-08-27 17:40:00,905 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-08-27 17:40:00,905 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-08-27 17:40:00,905 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:40:00,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2021-08-27 17:40:00,907 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:00,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:00,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:00,909 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:00,909 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 17:40:00,909 INFO L791 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 246#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);havoc foo_#t~malloc5.base, foo_#t~malloc5.offset; 250#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 255##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 260#$Ultimate##0 #t~loopctr10 := 0; 259#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 249#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 251#L-1-3 [2021-08-27 17:40:00,910 INFO L793 eck$LassoCheckResult]: Loop: 251#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 251#L-1-3 [2021-08-27 17:40:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2021-08-27 17:40:00,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582421122] [2021-08-27 17:40:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:00,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:00,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582421122] [2021-08-27 17:40:00,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582421122] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:00,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86352718] [2021-08-27 17:40:00,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,996 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:00,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:00,997 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:00,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-27 17:40:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:01,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:40:01,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:01,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86352718] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:01,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:01,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-27 17:40:01,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116071598] [2021-08-27 17:40:01,132 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2021-08-27 17:40:01,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838112870] [2021-08-27 17:40:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,143 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,152 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:01,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:40:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:40:01,206 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:01,246 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-08-27 17:40:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:40:01,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2021-08-27 17:40:01,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:01,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2021-08-27 17:40:01,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-08-27 17:40:01,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-27 17:40:01,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2021-08-27 17:40:01,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:01,248 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-08-27 17:40:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2021-08-27 17:40:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-27 17:40:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 17:40:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-08-27 17:40:01,251 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-08-27 17:40:01,251 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-08-27 17:40:01,251 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:40:01,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2021-08-27 17:40:01,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:01,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:01,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:01,252 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:01,252 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 17:40:01,252 INFO L791 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 313#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);havoc foo_#t~malloc5.base, foo_#t~malloc5.offset; 317#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 322##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 328#$Ultimate##0 #t~loopctr10 := 0; 327#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 316#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 318#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 326#L-1-3 [2021-08-27 17:40:01,252 INFO L793 eck$LassoCheckResult]: Loop: 326#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 326#L-1-3 [2021-08-27 17:40:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2021-08-27 17:40:01,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529993019] [2021-08-27 17:40:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:01,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:01,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529993019] [2021-08-27 17:40:01,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529993019] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:01,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657122057] [2021-08-27 17:40:01,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:40:01,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:01,310 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:01,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-27 17:40:01,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:40:01,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:01,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:40:01,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:01,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657122057] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:01,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:01,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-08-27 17:40:01,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031633985] [2021-08-27 17:40:01,464 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2021-08-27 17:40:01,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302445896] [2021-08-27 17:40:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,471 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:01,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 17:40:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-08-27 17:40:01,539 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:01,580 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-08-27 17:40:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:40:01,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2021-08-27 17:40:01,581 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:01,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2021-08-27 17:40:01,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 17:40:01,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-27 17:40:01,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2021-08-27 17:40:01,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:01,582 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-08-27 17:40:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2021-08-27 17:40:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-27 17:40:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 17:40:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-08-27 17:40:01,586 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-08-27 17:40:01,586 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-08-27 17:40:01,587 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:40:01,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2021-08-27 17:40:01,588 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:01,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:01,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:01,589 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:01,589 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 17:40:01,589 INFO L791 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 394#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);havoc foo_#t~malloc5.base, foo_#t~malloc5.offset; 391#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 398##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 407#$Ultimate##0 #t~loopctr10 := 0; 405#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 390#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 392#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 403#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 402#L-1-3 [2021-08-27 17:40:01,589 INFO L793 eck$LassoCheckResult]: Loop: 402#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 402#L-1-3 [2021-08-27 17:40:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2021-08-27 17:40:01,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752948684] [2021-08-27 17:40:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:01,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:01,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752948684] [2021-08-27 17:40:01,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752948684] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:01,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075755136] [2021-08-27 17:40:01,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:40:01,686 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:01,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:01,693 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-08-27 17:40:01,716 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-08-27 17:40:01,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-27 17:40:01,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:01,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:40:01,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:01,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075755136] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:01,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:01,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-08-27 17:40:01,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158553172] [2021-08-27 17:40:01,879 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2021-08-27 17:40:01,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552884906] [2021-08-27 17:40:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,889 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:01,892 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:01,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:01,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 17:40:01,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-08-27 17:40:01,950 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:01,986 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-08-27 17:40:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:40:01,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2021-08-27 17:40:01,987 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:01,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2021-08-27 17:40:01,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:01,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:01,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2021-08-27 17:40:01,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:01,988 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-27 17:40:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2021-08-27 17:40:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-08-27 17:40:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 17:40:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-08-27 17:40:01,990 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-27 17:40:01,990 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-27 17:40:01,991 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:40:01,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-08-27 17:40:01,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2021-08-27 17:40:01,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:01,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:01,992 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:01,992 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 17:40:01,992 INFO L791 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 479#L-1 havoc main_#res;havoc main_#t~memcpy~res7.base, main_#t~memcpy~res7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc5.base, foo_#t~malloc5.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc5.base, foo_#t~malloc5.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);havoc foo_#t~malloc5.base, foo_#t~malloc5.offset; 476#L644 call foo_#t~memcpy~res6.base, foo_#t~memcpy~res6.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 483##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 493#$Ultimate##0 #t~loopctr10 := 0; 491#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 475#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 477#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 489#L-1-1 assume #t~loopctr10 < size;call #t~mem11 := read~unchecked~int(src.base, src.offset + #t~loopctr10, 1);call write~unchecked~int(#t~mem11, dest.base, dest.offset + #t~loopctr10, 1);#t~loopctr10 := 1 + #t~loopctr10; 488#L-1-1 assume !(#t~loopctr10 < size);#t~loopctr12 := 0; 487#L-1-3 [2021-08-27 17:40:01,992 INFO L793 eck$LassoCheckResult]: Loop: 487#L-1-3 assume #t~loopctr12 < size;call #t~mem13.base, #t~mem13.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr12, 4);call write~unchecked~$Pointer$(#t~mem13.base, #t~mem13.offset, dest.base, dest.offset + #t~loopctr12, 4);#t~loopctr12 := 4 + #t~loopctr12; 487#L-1-3 [2021-08-27 17:40:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2021-08-27 17:40:01,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:01,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188700961] [2021-08-27 17:40:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:01,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,009 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,025 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2021-08-27 17:40:02,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:02,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761012523] [2021-08-27 17:40:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:02,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,030 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,032 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:02,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2021-08-27 17:40:02,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:02,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322495934] [2021-08-27 17:40:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:02,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,048 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:02,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:06,504 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:40:06,504 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:40:06,504 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:40:06,504 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:40:06,505 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:40:06,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:06,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:40:06,505 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:40:06,505 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime.i_Iteration6_Lasso [2021-08-27 17:40:06,505 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:40:06,505 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:40:06,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:06,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:07,291 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 17:40:07,293 INFO L168 Benchmark]: Toolchain (without parser) took 12846.36 ms. Allocated memory was 52.4 MB in the beginning and 192.9 MB in the end (delta: 140.5 MB). Free memory was 27.9 MB in the beginning and 158.0 MB in the end (delta: -130.1 MB). Peak memory consumption was 113.2 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:07,294 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 52.4 MB. Free memory was 34.3 MB in the beginning and 34.3 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:40:07,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.96 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 27.7 MB in the beginning and 41.1 MB in the end (delta: -13.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:07,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.01 ms. Allocated memory is still 67.1 MB. Free memory was 40.9 MB in the beginning and 39.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:07,294 INFO L168 Benchmark]: Boogie Preprocessor took 34.07 ms. Allocated memory is still 67.1 MB. Free memory was 39.1 MB in the beginning and 37.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:07,295 INFO L168 Benchmark]: RCFGBuilder took 399.10 ms. Allocated memory is still 67.1 MB. Free memory was 37.7 MB in the beginning and 36.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:07,295 INFO L168 Benchmark]: BuchiAutomizer took 11943.17 ms. Allocated memory was 67.1 MB in the beginning and 192.9 MB in the end (delta: 125.8 MB). Free memory was 36.4 MB in the beginning and 158.0 MB in the end (delta: -121.6 MB). Peak memory consumption was 106.8 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:07,296 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 52.4 MB. Free memory was 34.3 MB in the beginning and 34.3 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 418.96 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 27.7 MB in the beginning and 41.1 MB in the end (delta: -13.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.01 ms. Allocated memory is still 67.1 MB. Free memory was 40.9 MB in the beginning and 39.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.07 ms. Allocated memory is still 67.1 MB. Free memory was 39.1 MB in the beginning and 37.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 399.10 ms. Allocated memory is still 67.1 MB. Free memory was 37.7 MB in the beginning and 36.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 11943.17 ms. Allocated memory was 67.1 MB in the beginning and 192.9 MB in the end (delta: 125.8 MB). Free memory was 36.4 MB in the beginning and 158.0 MB in the end (delta: -121.6 MB). Peak memory consumption was 106.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 17:40:07,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:40:07,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-08-27 17:40:07,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-08-27 17:40:07,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...