./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a775ba6b744ab5ffb556747687a592ac2a696b9fe34bb3e21dc1471ba5c99e1a --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:26:09,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:26:09,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:26:09,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:26:09,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:26:09,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:26:09,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:26:09,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:26:09,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:26:09,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:26:09,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:26:09,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:26:09,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:26:09,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:26:09,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:26:09,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:26:09,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:26:09,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:26:09,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:26:09,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:26:09,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:26:09,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:26:09,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:26:09,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:26:09,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:26:09,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:26:09,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:26:09,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:26:09,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:26:09,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:26:09,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:26:09,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:26:09,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:26:09,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:26:09,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:26:09,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:26:09,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:26:09,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:26:09,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:26:09,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:26:09,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:26:09,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:26:09,244 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:26:09,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:26:09,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:26:09,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:26:09,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:26:09,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:26:09,247 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:26:09,247 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:26:09,247 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:26:09,248 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:26:09,248 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:26:09,248 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:26:09,249 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:26:09,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:26:09,249 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:26:09,249 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:26:09,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:26:09,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:26:09,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:26:09,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:26:09,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:26:09,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:26:09,250 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:26:09,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:26:09,252 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:26:09,252 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:26:09,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:26:09,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:26:09,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:26:09,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:26:09,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:26:09,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:26:09,255 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:26:09,255 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 -> a775ba6b744ab5ffb556747687a592ac2a696b9fe34bb3e21dc1471ba5c99e1a [2021-12-15 17:26:09,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:26:09,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:26:09,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:26:09,493 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:26:09,493 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:26:09,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-12-15 17:26:09,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dae8e6cb/457a311516a348a59c654844d28f922a/FLAG1c3043c6d [2021-12-15 17:26:09,965 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:26:09,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-12-15 17:26:09,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dae8e6cb/457a311516a348a59c654844d28f922a/FLAG1c3043c6d [2021-12-15 17:26:09,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dae8e6cb/457a311516a348a59c654844d28f922a [2021-12-15 17:26:09,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:26:09,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:26:09,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:09,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:26:10,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:26:10,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:26:09" (1/1) ... [2021-12-15 17:26:10,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b23acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10, skipping insertion in model container [2021-12-15 17:26:10,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:26:09" (1/1) ... [2021-12-15 17:26:10,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:26:10,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:26:10,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:10,326 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:26:10,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:10,382 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:26:10,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10 WrapperNode [2021-12-15 17:26:10,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:10,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:10,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:26:10,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:26:10,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,428 INFO L137 Inliner]: procedures = 117, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2021-12-15 17:26:10,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:10,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:26:10,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:26:10,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:26:10,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:26:10,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:26:10,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:26:10,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:26:10,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (1/1) ... [2021-12-15 17:26:10,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:10,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:10,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:10,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:26:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:26:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:26:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:26:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:26:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:26:10,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:26:10,625 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:26:10,627 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:26:10,741 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:26:10,757 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:26:10,759 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 17:26:10,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:10 BoogieIcfgContainer [2021-12-15 17:26:10,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:26:10,761 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:26:10,764 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:26:10,767 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:26:10,767 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:10,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:26:09" (1/3) ... [2021-12-15 17:26:10,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79fce6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:10, skipping insertion in model container [2021-12-15 17:26:10,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:10,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:10" (2/3) ... [2021-12-15 17:26:10,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79fce6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:10, skipping insertion in model container [2021-12-15 17:26:10,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:10,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:10" (3/3) ... [2021-12-15 17:26:10,770 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-1.i [2021-12-15 17:26:10,799 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:26:10,799 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:26:10,799 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:26:10,800 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:26:10,800 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:26:10,800 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:26:10,800 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:26:10,800 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:26:10,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:10,827 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-12-15 17:26:10,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:10,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:10,831 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:26:10,831 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:10,831 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:26:10,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:10,833 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-12-15 17:26:10,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:10,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:10,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:26:10,834 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:10,838 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 22#L536true assume !(main_~length~0#1 < 1); 8#L536-2true assume !(main_~n~1#1 < 1); 9#L539-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 5#L545-3true [2021-12-15 17:26:10,839 INFO L793 eck$LassoCheckResult]: Loop: 5#L545-3true assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 11#L545-2true main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 5#L545-3true [2021-12-15 17:26:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-12-15 17:26:10,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:10,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513466996] [2021-12-15 17:26:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:10,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:10,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:10,947 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:10,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:10,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-12-15 17:26:10,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:10,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108573167] [2021-12-15 17:26:10,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:10,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:10,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:10,981 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2021-12-15 17:26:10,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:10,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171505537] [2021-12-15 17:26:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:10,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:11,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:11,018 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:11,369 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:26:11,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:26:11,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:26:11,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:26:11,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:26:11,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:11,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:26:11,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:26:11,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration1_Lasso [2021-12-15 17:26:11,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:26:11,371 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:26:11,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,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-12-15 17:26:11,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-12-15 17:26:11,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-12-15 17:26:11,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-12-15 17:26:11,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:11,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-12-15 17:26:11,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-12-15 17:26:11,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-12-15 17:26:11,820 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:26:11,823 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:26:11,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:11,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:11,826 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:11,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:26:11,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:11,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:11,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:11,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:11,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:11,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:11,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:11,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:11,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:11,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-15 17:26:11,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:11,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:11,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:11,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:26:11,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:11,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:11,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:11,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:11,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:11,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:11,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:11,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:11,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-15 17:26:11,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:11,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:11,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:11,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-15 17:26:11,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:11,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:11,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:11,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:11,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:11,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:11,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:11,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:11,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:11,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:11,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:11,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:11,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-15 17:26:11,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:11,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:11,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:11,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:11,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:11,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:11,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:11,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:11,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:11,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:11,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:11,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:11,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:11,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-15 17:26:12,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:12,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:12,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:12,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:12,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:12,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:12,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:12,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:26:12,092 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-15 17:26:12,092 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-15 17:26:12,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:12,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:12,095 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:12,117 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:26:12,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:26:12,140 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:26:12,140 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:26:12,141 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0#1.offset >= 0] [2021-12-15 17:26:12,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:12,185 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2021-12-15 17:26:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:12,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:26:12,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:12,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:26:12,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:12,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:26:12,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:12,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 93 transitions. Complement of second has 7 states. [2021-12-15 17:26:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:26:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2021-12-15 17:26:12,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-15 17:26:12,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:12,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-15 17:26:12,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:12,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 5 letters. Loop has 4 letters. [2021-12-15 17:26:12,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:12,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 93 transitions. [2021-12-15 17:26:12,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:12,429 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-15 17:26:12,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 29 transitions. [2021-12-15 17:26:12,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-15 17:26:12,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-15 17:26:12,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2021-12-15 17:26:12,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:12,433 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-15 17:26:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2021-12-15 17:26:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-15 17:26:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-12-15 17:26:12,450 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-15 17:26:12,450 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-15 17:26:12,450 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:26:12,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-12-15 17:26:12,451 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-15 17:26:12,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:12,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:12,451 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:12,451 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:12,452 INFO L791 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 181#L536 assume !(main_~length~0#1 < 1); 173#L536-2 assume !(main_~n~1#1 < 1); 174#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 165#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 166#L545-4 main_~i~1#1 := 0; 177#L550-3 [2021-12-15 17:26:12,452 INFO L793 eck$LassoCheckResult]: Loop: 177#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 178#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 177#L550-3 [2021-12-15 17:26:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2021-12-15 17:26:12,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:12,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391648067] [2021-12-15 17:26:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:12,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:12,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:12,475 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2021-12-15 17:26:12,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:12,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91399379] [2021-12-15 17:26:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:12,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:12,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:12,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2021-12-15 17:26:12,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:12,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762726659] [2021-12-15 17:26:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:12,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:12,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:12,542 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:12,800 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:26:12,800 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:26:12,800 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:26:12,800 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:26:12,800 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:26:12,800 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:12,801 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:26:12,801 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:26:12,801 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration2_Lasso [2021-12-15 17:26:12,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:26:12,801 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:26:12,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:12,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:13,125 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:26:13,125 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:26:13,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:13,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:13,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:13,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:26:13,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:13,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:13,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:13,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:13,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:13,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:13,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:13,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:13,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:13,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:13,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:13,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:13,202 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:13,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-15 17:26:13,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:13,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:13,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:13,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:13,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:13,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:13,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:13,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:13,271 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-12-15 17:26:13,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:13,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:13,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:13,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-15 17:26:13,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:13,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:13,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:13,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:13,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:13,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:13,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:13,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:13,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:13,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:13,332 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:13,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:26:13,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:13,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:13,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:13,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:13,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:13,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:13,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:13,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:13,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:13,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:13,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:13,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:13,386 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:13,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:26:13,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:13,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:13,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:13,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:13,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:13,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:13,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:13,413 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:26:13,432 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:26:13,432 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-15 17:26:13,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:13,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:13,433 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:13,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:26:13,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:26:13,452 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:26:13,452 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:26:13,452 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~1#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~n~1#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2021-12-15 17:26:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:13,493 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-12-15 17:26:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:13,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:26:13,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:13,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:26:13,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:13,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:26:13,542 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:13,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 48 transitions. Complement of second has 6 states. [2021-12-15 17:26:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:26:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2021-12-15 17:26:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-15 17:26:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-15 17:26:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 4 letters. [2021-12-15 17:26:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:13,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 48 transitions. [2021-12-15 17:26:13,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:26:13,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 31 transitions. [2021-12-15 17:26:13,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-15 17:26:13,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:26:13,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2021-12-15 17:26:13,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:13,576 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-12-15 17:26:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2021-12-15 17:26:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-15 17:26:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2021-12-15 17:26:13,578 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-12-15 17:26:13,579 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-12-15 17:26:13,579 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:26:13,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2021-12-15 17:26:13,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:26:13,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:13,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:13,581 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:13,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:26:13,582 INFO L791 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 307#L536 assume !(main_~length~0#1 < 1); 298#L536-2 assume !(main_~n~1#1 < 1); 299#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 290#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 291#L545-4 main_~i~1#1 := 0; 302#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 300#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 301#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 296#L520-3 [2021-12-15 17:26:13,582 INFO L793 eck$LassoCheckResult]: Loop: 296#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 297#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 308#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 296#L520-3 [2021-12-15 17:26:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220888, now seen corresponding path program 1 times [2021-12-15 17:26:13,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:13,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787102343] [2021-12-15 17:26:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:13,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:13,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:13,619 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:13,619 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 1 times [2021-12-15 17:26:13,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:13,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755006576] [2021-12-15 17:26:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:13,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:13,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:13,645 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -587605024, now seen corresponding path program 1 times [2021-12-15 17:26:13,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:13,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136912677] [2021-12-15 17:26:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:13,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:13,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:13,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136912677] [2021-12-15 17:26:13,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136912677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:13,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:13,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 17:26:13,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423198706] [2021-12-15 17:26:13,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:13,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:26:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:26:13,890 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:13,974 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2021-12-15 17:26:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:26:13,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 49 transitions. [2021-12-15 17:26:13,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-15 17:26:13,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 49 transitions. [2021-12-15 17:26:13,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-15 17:26:13,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-15 17:26:13,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 49 transitions. [2021-12-15 17:26:13,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:13,978 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2021-12-15 17:26:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 49 transitions. [2021-12-15 17:26:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2021-12-15 17:26:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2021-12-15 17:26:13,981 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-12-15 17:26:13,981 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-12-15 17:26:13,981 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:26:13,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2021-12-15 17:26:13,982 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:26:13,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:13,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:13,985 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:13,985 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:26:13,985 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 386#L536 assume !(main_~length~0#1 < 1); 373#L536-2 assume !(main_~n~1#1 < 1); 375#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 365#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 366#L545-4 main_~i~1#1 := 0; 391#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 383#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 382#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 376#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 377#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 371#L520-3 [2021-12-15 17:26:13,985 INFO L793 eck$LassoCheckResult]: Loop: 371#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 372#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 387#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 371#L520-3 [2021-12-15 17:26:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash -294332618, now seen corresponding path program 1 times [2021-12-15 17:26:13,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:13,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518308479] [2021-12-15 17:26:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:13,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,039 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:14,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 2 times [2021-12-15 17:26:14,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52104835] [2021-12-15 17:26:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,053 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:14,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1860246402, now seen corresponding path program 1 times [2021-12-15 17:26:14,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999556775] [2021-12-15 17:26:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-15 17:26:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:14,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:14,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999556775] [2021-12-15 17:26:14,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999556775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:14,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:14,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 17:26:14,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189054711] [2021-12-15 17:26:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:14,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:26:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:26:14,271 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:14,323 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2021-12-15 17:26:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:26:14,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 73 transitions. [2021-12-15 17:26:14,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-15 17:26:14,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 73 transitions. [2021-12-15 17:26:14,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-15 17:26:14,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-15 17:26:14,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 73 transitions. [2021-12-15 17:26:14,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:14,331 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 73 transitions. [2021-12-15 17:26:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 73 transitions. [2021-12-15 17:26:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-12-15 17:26:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.4) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2021-12-15 17:26:14,337 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-12-15 17:26:14,337 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-12-15 17:26:14,337 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:26:14,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2021-12-15 17:26:14,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:26:14,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:14,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:14,338 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:14,338 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:14,338 INFO L791 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 472#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 489#L536 assume !(main_~length~0#1 < 1); 475#L536-2 assume main_~n~1#1 < 1;main_~n~1#1 := 1; 476#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 467#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 468#L545-4 main_~i~1#1 := 0; 483#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 479#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 480#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 473#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 474#L520-1 assume !(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1; 491#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 492#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 487#L528-2 [2021-12-15 17:26:14,338 INFO L793 eck$LassoCheckResult]: Loop: 487#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 488#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 487#L528-2 [2021-12-15 17:26:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952706, now seen corresponding path program 1 times [2021-12-15 17:26:14,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351606280] [2021-12-15 17:26:14,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:14,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351606280] [2021-12-15 17:26:14,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351606280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:14,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:14,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:26:14,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791142182] [2021-12-15 17:26:14,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:14,391 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:26:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 1 times [2021-12-15 17:26:14,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541506801] [2021-12-15 17:26:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,399 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:14,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:14,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:26:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:26:14,427 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 22 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:14,448 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2021-12-15 17:26:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:26:14,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2021-12-15 17:26:14,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-15 17:26:14,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2021-12-15 17:26:14,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-12-15 17:26:14,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-12-15 17:26:14,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2021-12-15 17:26:14,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:14,452 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-12-15 17:26:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2021-12-15 17:26:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-12-15 17:26:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-12-15 17:26:14,459 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-15 17:26:14,459 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-15 17:26:14,460 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:26:14,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2021-12-15 17:26:14,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:26:14,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:14,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:14,460 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:14,460 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:14,460 INFO L791 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 586#L536 assume !(main_~length~0#1 < 1); 573#L536-2 assume main_~n~1#1 < 1;main_~n~1#1 := 1; 574#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 576#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 591#L545-4 main_~i~1#1 := 0; 579#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 580#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 601#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 600#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 599#L520-1 assume !(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1; 592#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 589#L526 assume 0 != cstrlcpy_~siz#1 % 4294967296;call write~int(0, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, 1); 584#L528-2 [2021-12-15 17:26:14,460 INFO L793 eck$LassoCheckResult]: Loop: 584#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 585#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 584#L528-2 [2021-12-15 17:26:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952708, now seen corresponding path program 1 times [2021-12-15 17:26:14,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017304021] [2021-12-15 17:26:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,486 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,499 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 2 times [2021-12-15 17:26:14,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813821125] [2021-12-15 17:26:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,510 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1530728321, now seen corresponding path program 1 times [2021-12-15 17:26:14,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481859427] [2021-12-15 17:26:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:14,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:14,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481859427] [2021-12-15 17:26:14,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481859427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:14,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:14,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 17:26:14,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840064047] [2021-12-15 17:26:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:14,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:26:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:26:14,651 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. cyclomatic complexity: 22 Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:14,708 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2021-12-15 17:26:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:26:14,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2021-12-15 17:26:14,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-15 17:26:14,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 52 states and 65 transitions. [2021-12-15 17:26:14,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-12-15 17:26:14,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-12-15 17:26:14,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2021-12-15 17:26:14,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:14,714 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2021-12-15 17:26:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2021-12-15 17:26:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2021-12-15 17:26:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2021-12-15 17:26:14,718 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2021-12-15 17:26:14,718 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2021-12-15 17:26:14,718 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:26:14,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2021-12-15 17:26:14,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:26:14,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:14,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:14,720 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:14,720 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:26:14,720 INFO L791 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 700#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 715#L536 assume !(main_~length~0#1 < 1); 703#L536-2 assume !(main_~n~1#1 < 1); 705#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 706#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 722#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 723#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 724#L545-4 main_~i~1#1 := 0; 739#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 735#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 734#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 732#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 729#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 730#L520-3 [2021-12-15 17:26:14,720 INFO L793 eck$LassoCheckResult]: Loop: 730#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 740#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 736#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 730#L520-3 [2021-12-15 17:26:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2021-12-15 17:26:14,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666324147] [2021-12-15 17:26:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,752 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 3 times [2021-12-15 17:26:14,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533833562] [2021-12-15 17:26:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,759 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,766 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -796650908, now seen corresponding path program 1 times [2021-12-15 17:26:14,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:14,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730605100] [2021-12-15 17:26:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:14,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:14,802 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:15,870 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:26:15,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:26:15,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:26:15,871 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:26:15,871 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:26:15,871 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:15,871 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:26:15,871 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:26:15,871 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration7_Lasso [2021-12-15 17:26:15,871 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:26:15,871 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:26:15,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:15,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:26:17,149 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:26:17,149 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:26:17,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,160 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:26:17,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:17,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:17,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-15 17:26:17,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,207 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:26:17,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,250 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-12-15 17:26:17,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:26:17,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-15 17:26:17,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,283 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-12-15 17:26:17,286 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-12-15 17:26:17,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,308 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-12-15 17:26:17,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,310 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-12-15 17:26:17,311 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-12-15 17:26:17,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-15 17:26:17,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,336 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-15 17:26:17,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-15 17:26:17,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,363 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-15 17:26:17,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:17,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:17,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:17,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,396 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-15 17:26:17,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-15 17:26:17,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,422 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-15 17:26:17,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:17,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,455 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-15 17:26:17,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-15 17:26:17,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,479 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-15 17:26:17,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-15 17:26:17,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,510 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-15 17:26:17,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-15 17:26:17,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,539 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-15 17:26:17,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:17,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:17,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-15 17:26:17,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,570 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-15 17:26:17,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-15 17:26:17,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,602 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-15 17:26:17,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-15 17:26:17,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,629 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-15 17:26:17,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-15 17:26:17,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,659 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-15 17:26:17,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:17,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:17,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-15 17:26:17,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,692 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-15 17:26:17,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-15 17:26:17,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,725 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-15 17:26:17,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-15 17:26:17,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,765 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-15 17:26:17,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:17,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,798 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-15 17:26:17,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-15 17:26:17,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,836 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-15 17:26:17,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:26:17,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:26:17,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:26:17,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-15 17:26:17,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,863 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-15 17:26:17,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:17,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:17,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:26:17,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:17,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:17,905 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:17,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-15 17:26:17,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:26:17,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:26:17,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:26:17,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:26:17,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:26:17,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:26:17,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:26:17,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:26:18,040 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2021-12-15 17:26:18,040 INFO L444 ModelExtractionUtils]: 29 out of 73 variables were initially zero. Simplification set additionally 41 variables to zero. [2021-12-15 17:26:18,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:18,041 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:26:18,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-15 17:26:18,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:26:18,049 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:26:18,049 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:26:18,049 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3) = -1*ULTIMATE.start_cstrlcpy_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3 Supporting invariants [] [2021-12-15 17:26:18,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:18,147 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2021-12-15 17:26:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:18,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:26:18,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:18,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 17:26:18,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:18,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-15 17:26:18,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:18,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-15 17:26:18,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 83 transitions. Complement of second has 6 states. [2021-12-15 17:26:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:26:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-12-15 17:26:18,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-15 17:26:18,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:18,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-15 17:26:18,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:18,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-15 17:26:18,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:26:18,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 83 transitions. [2021-12-15 17:26:18,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:18,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 18 states and 22 transitions. [2021-12-15 17:26:18,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:26:18,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:26:18,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-12-15 17:26:18,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:18,341 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-15 17:26:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-12-15 17:26:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-15 17:26:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-15 17:26:18,341 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-15 17:26:18,341 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-15 17:26:18,341 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:26:18,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2021-12-15 17:26:18,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:18,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:18,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:18,342 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:18,342 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:18,342 INFO L791 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1006#L536 assume !(main_~length~0#1 < 1); 997#L536-2 assume !(main_~n~1#1 < 1); 998#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 991#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 992#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 993#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 994#L545-4 main_~i~1#1 := 0; 1001#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1002#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1003#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 999#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1000#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1008#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1007#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1004#L528-2 [2021-12-15 17:26:18,342 INFO L793 eck$LassoCheckResult]: Loop: 1004#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1005#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1004#L528-2 [2021-12-15 17:26:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -718415251, now seen corresponding path program 1 times [2021-12-15 17:26:18,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:18,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733557524] [2021-12-15 17:26:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:18,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:18,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:18,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733557524] [2021-12-15 17:26:18,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733557524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:18,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427378390] [2021-12-15 17:26:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:18,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:18,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:18,387 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:18,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-12-15 17:26:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:18,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:26:18,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:18,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:18,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427378390] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:18,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:18,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2021-12-15 17:26:18,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74205463] [2021-12-15 17:26:18,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:18,617 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:26:18,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 3 times [2021-12-15 17:26:18,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:18,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411049989] [2021-12-15 17:26:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:18,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:18,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:18,622 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:18,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 17:26:18,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-15 17:26:18,649 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:18,789 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-12-15 17:26:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 17:26:18,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2021-12-15 17:26:18,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-15 17:26:18,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 38 transitions. [2021-12-15 17:26:18,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-15 17:26:18,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-15 17:26:18,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2021-12-15 17:26:18,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:18,790 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-15 17:26:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2021-12-15 17:26:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-15 17:26:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-15 17:26:18,791 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-15 17:26:18,792 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-15 17:26:18,792 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:26:18,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2021-12-15 17:26:18,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:18,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:18,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:18,792 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:18,792 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:18,792 INFO L791 eck$LassoCheckResult]: Stem: 1173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1185#L536 assume !(main_~length~0#1 < 1); 1175#L536-2 assume !(main_~n~1#1 < 1); 1176#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1169#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1170#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1171#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1172#L545-4 main_~i~1#1 := 0; 1179#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1180#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1181#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1182#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1196#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1195#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1194#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1193#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1186#L526 assume 0 != cstrlcpy_~siz#1 % 4294967296;call write~int(0, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, 1); 1183#L528-2 [2021-12-15 17:26:18,792 INFO L793 eck$LassoCheckResult]: Loop: 1183#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1184#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1183#L528-2 [2021-12-15 17:26:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1571238007, now seen corresponding path program 1 times [2021-12-15 17:26:18,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:18,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301282955] [2021-12-15 17:26:18,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:18,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:18,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:18,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301282955] [2021-12-15 17:26:18,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301282955] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:18,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425378111] [2021-12-15 17:26:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:18,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:18,858 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:18,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-12-15 17:26:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:18,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:26:18,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 17:26:18,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 17:26:18,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425378111] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:18,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-15 17:26:18,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2021-12-15 17:26:18,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558539120] [2021-12-15 17:26:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:18,990 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:26:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 4 times [2021-12-15 17:26:18,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197568706] [2021-12-15 17:26:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:18,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:18,993 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:18,995 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:19,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:19,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:26:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-15 17:26:19,026 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:19,031 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-15 17:26:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:26:19,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-12-15 17:26:19,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:19,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 27 transitions. [2021-12-15 17:26:19,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:26:19,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:26:19,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2021-12-15 17:26:19,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:19,033 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-15 17:26:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2021-12-15 17:26:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-15 17:26:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-15 17:26:19,034 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-15 17:26:19,034 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-15 17:26:19,034 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:26:19,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-12-15 17:26:19,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:19,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:19,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:19,035 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:19,035 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:19,035 INFO L791 eck$LassoCheckResult]: Stem: 1345#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1357#L536 assume !(main_~length~0#1 < 1); 1347#L536-2 assume !(main_~n~1#1 < 1); 1348#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1341#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1342#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1343#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1344#L545-4 main_~i~1#1 := 0; 1351#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1352#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1353#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1354#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1360#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1364#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1363#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1362#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1361#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1349#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1350#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1359#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1358#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1355#L528-2 [2021-12-15 17:26:19,035 INFO L793 eck$LassoCheckResult]: Loop: 1355#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1356#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1355#L528-2 [2021-12-15 17:26:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1995057991, now seen corresponding path program 2 times [2021-12-15 17:26:19,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:19,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841237029] [2021-12-15 17:26:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:19,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:19,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841237029] [2021-12-15 17:26:19,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841237029] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020890090] [2021-12-15 17:26:19,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:26:19,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:19,200 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:19,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-12-15 17:26:19,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:26:19,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:26:19,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 17:26:19,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:19,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:19,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020890090] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:19,618 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:19,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-12-15 17:26:19,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900801751] [2021-12-15 17:26:19,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:19,619 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:26:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 5 times [2021-12-15 17:26:19,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:19,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124374998] [2021-12-15 17:26:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:19,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:19,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:19,624 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:19,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-15 17:26:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-12-15 17:26:19,651 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:19,955 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-12-15 17:26:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 17:26:19,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2021-12-15 17:26:19,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:19,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 39 transitions. [2021-12-15 17:26:19,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:26:19,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:26:19,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2021-12-15 17:26:19,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:19,956 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-15 17:26:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2021-12-15 17:26:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-15 17:26:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2021-12-15 17:26:19,957 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-15 17:26:19,957 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-15 17:26:19,957 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:26:19,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2021-12-15 17:26:19,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:19,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:19,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:19,958 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:19,958 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:19,958 INFO L791 eck$LassoCheckResult]: Stem: 1592#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1604#L536 assume !(main_~length~0#1 < 1); 1594#L536-2 assume !(main_~n~1#1 < 1); 1595#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1588#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1589#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1590#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1591#L545-4 main_~i~1#1 := 0; 1598#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1599#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1600#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1601#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1607#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1623#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1622#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1621#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1620#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1619#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1618#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1617#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1616#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1615#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1614#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1613#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1612#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1611#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1610#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1609#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1608#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1596#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1597#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1606#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1605#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1602#L528-2 [2021-12-15 17:26:19,958 INFO L793 eck$LassoCheckResult]: Loop: 1602#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1603#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1602#L528-2 [2021-12-15 17:26:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -812594565, now seen corresponding path program 3 times [2021-12-15 17:26:19,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:19,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814075619] [2021-12-15 17:26:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:19,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:20,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:20,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814075619] [2021-12-15 17:26:20,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814075619] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:20,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237681518] [2021-12-15 17:26:20,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:26:20,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:20,123 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:20,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-12-15 17:26:20,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-15 17:26:20,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:26:20,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-15 17:26:20,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:20,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:21,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237681518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:21,080 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:21,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2021-12-15 17:26:21,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540757869] [2021-12-15 17:26:21,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:21,081 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:26:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 6 times [2021-12-15 17:26:21,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:21,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277744720] [2021-12-15 17:26:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:21,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:21,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:21,085 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:21,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:21,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-15 17:26:21,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1320, Unknown=0, NotChecked=0, Total=1640 [2021-12-15 17:26:21,124 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. cyclomatic complexity: 6 Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:21,948 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2021-12-15 17:26:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-15 17:26:21,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 82 transitions. [2021-12-15 17:26:21,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:21,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 58 states and 61 transitions. [2021-12-15 17:26:21,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:26:21,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:26:21,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 61 transitions. [2021-12-15 17:26:21,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:21,950 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-12-15 17:26:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 61 transitions. [2021-12-15 17:26:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-12-15 17:26:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-12-15 17:26:21,951 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-12-15 17:26:21,951 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-12-15 17:26:21,951 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:26:21,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 61 transitions. [2021-12-15 17:26:21,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:21,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:21,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:21,953 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:21,953 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:21,953 INFO L791 eck$LassoCheckResult]: Stem: 1984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1985#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1996#L536 assume !(main_~length~0#1 < 1); 1986#L536-2 assume !(main_~n~1#1 < 1); 1987#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1980#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1981#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1982#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1983#L545-4 main_~i~1#1 := 0; 1990#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1991#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1992#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1993#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1999#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2037#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2036#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2035#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2034#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2033#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2032#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2031#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2030#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2029#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2028#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2027#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2026#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2025#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2024#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2023#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2022#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2021#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2020#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2019#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2018#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2017#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2016#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2015#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2014#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2013#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2012#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2011#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2010#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2009#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2008#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2007#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2006#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2005#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2004#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2003#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2002#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2001#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2000#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1988#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1989#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1998#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1997#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1994#L528-2 [2021-12-15 17:26:21,953 INFO L793 eck$LassoCheckResult]: Loop: 1994#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1995#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1994#L528-2 [2021-12-15 17:26:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1273987131, now seen corresponding path program 4 times [2021-12-15 17:26:21,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:21,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421984300] [2021-12-15 17:26:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:21,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:22,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:22,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421984300] [2021-12-15 17:26:22,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421984300] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:22,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453511642] [2021-12-15 17:26:22,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 17:26:22,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:22,334 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:22,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-12-15 17:26:22,583 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 17:26:22,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:26:22,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-15 17:26:22,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:23,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:24,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453511642] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:24,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:24,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 77 [2021-12-15 17:26:24,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316556127] [2021-12-15 17:26:24,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:24,746 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:26:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 7 times [2021-12-15 17:26:24,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:24,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273832496] [2021-12-15 17:26:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:24,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:24,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:24,752 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:24,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-12-15 17:26:24,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1270, Invalid=4582, Unknown=0, NotChecked=0, Total=5852 [2021-12-15 17:26:24,779 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. cyclomatic complexity: 6 Second operand has 77 states, 77 states have (on average 2.051948051948052) internal successors, (158), 77 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:26,802 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2021-12-15 17:26:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-12-15 17:26:26,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 132 transitions. [2021-12-15 17:26:26,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:26,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 104 states and 107 transitions. [2021-12-15 17:26:26,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:26:26,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:26:26,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 107 transitions. [2021-12-15 17:26:26,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:26,805 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 107 transitions. [2021-12-15 17:26:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 107 transitions. [2021-12-15 17:26:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-15 17:26:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 103 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2021-12-15 17:26:26,809 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 107 transitions. [2021-12-15 17:26:26,809 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 107 transitions. [2021-12-15 17:26:26,809 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-15 17:26:26,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 107 transitions. [2021-12-15 17:26:26,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:26:26,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:26,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:26,811 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:26,811 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:26:26,811 INFO L791 eck$LassoCheckResult]: Stem: 2656#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 2668#L536 assume !(main_~length~0#1 < 1); 2658#L536-2 assume !(main_~n~1#1 < 1); 2659#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 2652#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 2653#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 2654#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 2655#L545-4 main_~i~1#1 := 0; 2662#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2663#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2664#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2665#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2671#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2755#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2754#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2753#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2752#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2751#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2750#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2749#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2748#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2747#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2746#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2745#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2744#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2743#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2742#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2741#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2740#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2739#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2738#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2737#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2736#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2735#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2734#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2733#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2732#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2731#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2730#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2729#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2728#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2727#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2726#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2725#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2724#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2723#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2722#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2721#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2720#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2719#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2718#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2717#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2716#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2715#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2714#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2713#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2712#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2711#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2710#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2709#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2708#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2707#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2706#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2705#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2704#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2703#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2702#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2701#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2700#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2699#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2698#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2697#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2696#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2695#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2694#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2693#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2692#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2691#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2690#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2689#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2688#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2687#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2686#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2685#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2684#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2683#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2682#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2681#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2680#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2679#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2678#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2677#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2676#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2675#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2674#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2673#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2672#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 2660#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 2661#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 2670#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 2669#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 2666#L528-2 [2021-12-15 17:26:26,811 INFO L793 eck$LassoCheckResult]: Loop: 2666#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 2667#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 2666#L528-2 [2021-12-15 17:26:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash -139953673, now seen corresponding path program 5 times [2021-12-15 17:26:26,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:26,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129889404] [2021-12-15 17:26:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:26,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:27,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:27,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129889404] [2021-12-15 17:26:27,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129889404] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:27,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375315417] [2021-12-15 17:26:27,863 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 17:26:27,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:27,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:27,865 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:27,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-12-15 17:26:49,397 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2021-12-15 17:26:49,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:26:49,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-15 17:26:49,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:51,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:26:55,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375315417] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:55,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:55,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 146 [2021-12-15 17:26:55,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749967127] [2021-12-15 17:26:55,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:55,881 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:26:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:55,881 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 8 times [2021-12-15 17:26:55,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:55,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487109700] [2021-12-15 17:26:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:55,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:55,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:55,885 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:55,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2021-12-15 17:26:55,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4628, Invalid=16542, Unknown=0, NotChecked=0, Total=21170 [2021-12-15 17:26:55,924 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. cyclomatic complexity: 6 Second operand has 146 states, 146 states have (on average 2.0273972602739727) internal successors, (296), 146 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:27:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:27:02,641 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2021-12-15 17:27:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-12-15 17:27:02,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 247 transitions. [2021-12-15 17:27:02,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:27:02,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 196 states and 199 transitions. [2021-12-15 17:27:02,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:27:02,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:27:02,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 199 transitions. [2021-12-15 17:27:02,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:27:02,644 INFO L681 BuchiCegarLoop]: Abstraction has 196 states and 199 transitions. [2021-12-15 17:27:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 199 transitions. [2021-12-15 17:27:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-15 17:27:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.0153061224489797) internal successors, (199), 195 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:27:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2021-12-15 17:27:02,659 INFO L704 BuchiCegarLoop]: Abstraction has 196 states and 199 transitions. [2021-12-15 17:27:02,659 INFO L587 BuchiCegarLoop]: Abstraction has 196 states and 199 transitions. [2021-12-15 17:27:02,659 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-15 17:27:02,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 199 transitions. [2021-12-15 17:27:02,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:27:02,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:27:02,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:27:02,661 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:27:02,666 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:27:02,666 INFO L791 eck$LassoCheckResult]: Stem: 3903#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3904#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 3915#L536 assume !(main_~length~0#1 < 1); 3905#L536-2 assume !(main_~n~1#1 < 1); 3906#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 3899#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 3900#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 3901#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 3902#L545-4 main_~i~1#1 := 0; 3909#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3910#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3911#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3912#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3918#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4094#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4093#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4092#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4091#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4090#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4089#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4088#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4087#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4086#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4085#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4084#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4083#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4082#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4081#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4080#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4079#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4078#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4077#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4076#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4075#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4074#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4073#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4072#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4071#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4070#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4069#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4068#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4067#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4066#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4065#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4064#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4063#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4062#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4061#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4060#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4059#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4058#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4057#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4056#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4055#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4054#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4053#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4052#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4051#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4050#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4049#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4048#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4047#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4046#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4045#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4044#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4043#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4042#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4041#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4040#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4039#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4038#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4037#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4036#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4035#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4034#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4033#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4032#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4031#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4030#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4029#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4028#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4027#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4026#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4025#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4024#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4023#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4022#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4021#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4020#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4019#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4018#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4017#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4016#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4015#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4014#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4013#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4012#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4011#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4010#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4009#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4008#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4007#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4006#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4005#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4004#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4003#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4002#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4001#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4000#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3999#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3998#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3997#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3996#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3995#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3994#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3993#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3992#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3991#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3990#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3989#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3988#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3987#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3986#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3985#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3984#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3983#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3982#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3981#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3980#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3979#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3978#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3977#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3976#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3975#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3974#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3973#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3972#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3971#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3970#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3969#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3968#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3967#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3966#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3965#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3964#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3963#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3962#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3961#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3960#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3959#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3958#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3957#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3956#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3955#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3954#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3953#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3952#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3951#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3950#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3949#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3948#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3947#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3946#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3945#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3944#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3943#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3942#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3941#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3940#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3939#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3938#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3937#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3936#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3935#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3934#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3933#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3932#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3931#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3930#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3929#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3928#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3927#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3926#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3925#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3924#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3923#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3922#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3921#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3920#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3919#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 3907#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 3908#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 3917#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 3916#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 3913#L528-2 [2021-12-15 17:27:02,667 INFO L793 eck$LassoCheckResult]: Loop: 3913#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 3914#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 3913#L528-2 [2021-12-15 17:27:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:27:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1293645787, now seen corresponding path program 6 times [2021-12-15 17:27:02,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:27:02,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709313631] [2021-12-15 17:27:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:27:02,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:27:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:27:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8101 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:27:06,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:27:06,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709313631] [2021-12-15 17:27:06,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709313631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:27:06,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252770132] [2021-12-15 17:27:06,055 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 17:27:06,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:27:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:06,056 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:27:06,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process