./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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/locks/test_locks_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 02:02:26,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:02:26,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:02:26,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:02:26,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:02:26,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:02:26,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:02:26,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:02:26,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:02:26,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:02:26,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:02:26,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:02:26,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:02:26,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:02:26,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:02:26,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:02:26,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:02:26,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:02:26,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:02:26,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:02:26,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:02:26,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:02:26,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:02:26,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:02:26,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:02:26,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:02:26,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:02:26,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:02:26,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:02:26,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:02:26,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:02:26,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:02:26,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:02:26,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:02:26,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:02:26,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:02:26,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:02:26,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:02:26,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:02:26,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:02:26,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:02:26,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 02:02:26,815 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:02:26,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:02:26,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:02:26,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:02:26,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:02:26,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:02:26,816 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:02:26,817 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:02:26,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:02:26,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:02:26,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:02:26,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:02:26,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:02:26,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:02:26,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:02:26,819 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:02:26,819 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 -> 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 [2021-08-31 02:02:27,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:02:27,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:02:27,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:02:27,176 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:02:27,176 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:02:27,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2021-08-31 02:02:27,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e599af27/070527f1f1f54c608eebb25d013ec893/FLAGc375b7835 [2021-08-31 02:02:27,633 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:02:27,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2021-08-31 02:02:27,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e599af27/070527f1f1f54c608eebb25d013ec893/FLAGc375b7835 [2021-08-31 02:02:28,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e599af27/070527f1f1f54c608eebb25d013ec893 [2021-08-31 02:02:28,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:02:28,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:02:28,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:28,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:02:28,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:02:28,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6973e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28, skipping insertion in model container [2021-08-31 02:02:28,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:02:28,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:02:28,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2021-08-31 02:02:28,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:28,199 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:02:28,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2021-08-31 02:02:28,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:28,295 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:02:28,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28 WrapperNode [2021-08-31 02:02:28,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:28,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:28,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:02:28,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:02:28,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:28,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:02:28,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:02:28,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:02:28,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:02:28,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:02:28,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:02:28,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:02:28,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (1/1) ... [2021-08-31 02:02:28,358 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:02:28,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:02:28,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:02:28,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 02:02:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:02:28,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:02:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:02:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:02:28,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:02:28,583 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 02:02:28,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:28 BoogieIcfgContainer [2021-08-31 02:02:28,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:02:28,586 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:02:28,586 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:02:28,588 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:02:28,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:28,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:02:28" (1/3) ... [2021-08-31 02:02:28,590 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6909a1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:28, skipping insertion in model container [2021-08-31 02:02:28,590 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:28,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:28" (2/3) ... [2021-08-31 02:02:28,591 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6909a1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:28, skipping insertion in model container [2021-08-31 02:02:28,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:28,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:28" (3/3) ... [2021-08-31 02:02:28,592 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2021-08-31 02:02:28,691 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:02:28,691 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:02:28,691 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:02:28,691 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:02:28,691 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:02:28,692 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:02:28,692 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:02:28,692 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:02:28,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-08-31 02:02:28,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-08-31 02:02:28,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:28,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:28,751 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:28,752 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:28,752 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:02:28,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-08-31 02:02:28,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-08-31 02:02:28,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:28,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:28,759 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:28,759 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:28,766 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 14#L197-1true [2021-08-31 02:02:28,768 INFO L793 eck$LassoCheckResult]: Loop: 14#L197-1true assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 44#L52true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29#L83true assume 0 != main_~p1~0;main_~lk1~0 := 1; 16#L83-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L87-1true assume !(0 != main_~p3~0); 4#L91-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 46#L95-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 17#L99-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 11#L103-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 26#L107-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 15#L111-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 33#L115-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 35#L119-1true assume !(0 != main_~p11~0); 47#L123-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 27#L127-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 36#L131-1true assume !(0 != main_~p1~0); 13#L137-1true assume !(0 != main_~p2~0); 8#L142-1true assume !(0 != main_~p3~0); 37#L147-1true assume !(0 != main_~p4~0); 12#L152-1true assume !(0 != main_~p5~0); 21#L157-1true assume !(0 != main_~p6~0); 18#L162-1true assume !(0 != main_~p7~0); 19#L167-1true assume !(0 != main_~p8~0); 24#L172-1true assume !(0 != main_~p9~0); 32#L177-1true assume !(0 != main_~p10~0); 48#L182-1true assume !(0 != main_~p11~0); 45#L187-1true assume !(0 != main_~p12~0); 39#L192-1true assume !(0 != main_~p13~0); 14#L197-1true [2021-08-31 02:02:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:28,776 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:02:28,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:28,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572451331] [2021-08-31 02:02:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:28,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:28,871 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:28,918 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2021-08-31 02:02:28,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:28,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412852258] [2021-08-31 02:02:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:28,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:29,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:29,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412852258] [2021-08-31 02:02:29,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412852258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:29,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:29,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:29,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630229160] [2021-08-31 02:02:29,042 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:29,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:29,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:29,070 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:29,353 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2021-08-31 02:02:29,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:29,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2021-08-31 02:02:29,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-08-31 02:02:29,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2021-08-31 02:02:29,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2021-08-31 02:02:29,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2021-08-31 02:02:29,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2021-08-31 02:02:29,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:29,370 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-08-31 02:02:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2021-08-31 02:02:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-08-31 02:02:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 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-08-31 02:02:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2021-08-31 02:02:29,403 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-08-31 02:02:29,403 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-08-31 02:02:29,403 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:02:29,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2021-08-31 02:02:29,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-08-31 02:02:29,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:29,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:29,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:29,411 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:29,411 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 156#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 157#L197-1 [2021-08-31 02:02:29,411 INFO L793 eck$LassoCheckResult]: Loop: 157#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 209#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 208#L83 assume !(0 != main_~p1~0); 207#L83-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 206#L87-1 assume !(0 != main_~p3~0); 205#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 198#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 174#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 164#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 165#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 202#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 192#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 193#L119-1 assume !(0 != main_~p11~0); 201#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 185#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 186#L131-1 assume !(0 != main_~p1~0); 200#L137-1 assume !(0 != main_~p2~0); 231#L142-1 assume !(0 != main_~p3~0); 229#L147-1 assume !(0 != main_~p4~0); 227#L152-1 assume !(0 != main_~p5~0); 225#L157-1 assume !(0 != main_~p6~0); 223#L162-1 assume !(0 != main_~p7~0); 221#L167-1 assume !(0 != main_~p8~0); 218#L172-1 assume !(0 != main_~p9~0); 217#L177-1 assume !(0 != main_~p10~0); 215#L182-1 assume !(0 != main_~p11~0); 212#L187-1 assume !(0 != main_~p12~0); 211#L192-1 assume !(0 != main_~p13~0); 157#L197-1 [2021-08-31 02:02:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:29,413 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 02:02:29,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:29,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709342278] [2021-08-31 02:02:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:29,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:29,426 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:29,449 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2021-08-31 02:02:29,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:29,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426717171] [2021-08-31 02:02:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:29,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:29,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:29,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426717171] [2021-08-31 02:02:29,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426717171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:29,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:29,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:29,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941264121] [2021-08-31 02:02:29,493 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:29,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:29,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:29,496 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:29,658 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2021-08-31 02:02:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:29,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2021-08-31 02:02:29,670 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-08-31 02:02:29,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2021-08-31 02:02:29,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2021-08-31 02:02:29,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2021-08-31 02:02:29,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2021-08-31 02:02:29,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:29,676 INFO L681 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-08-31 02:02:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2021-08-31 02:02:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-08-31 02:02:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 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-08-31 02:02:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2021-08-31 02:02:29,690 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-08-31 02:02:29,690 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-08-31 02:02:29,690 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:02:29,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2021-08-31 02:02:29,691 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-08-31 02:02:29,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:29,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:29,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:29,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:29,692 INFO L791 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 407#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 406#L197-1 [2021-08-31 02:02:29,692 INFO L793 eck$LassoCheckResult]: Loop: 406#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 422#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 454#L83 assume !(0 != main_~p1~0); 515#L83-2 assume !(0 != main_~p2~0); 413#L87-1 assume !(0 != main_~p3~0); 401#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 402#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 425#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 414#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 415#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 467#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 468#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 463#L119-1 assume !(0 != main_~p11~0); 464#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 437#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 438#L131-1 assume !(0 != main_~p1~0); 509#L137-1 assume !(0 != main_~p2~0); 553#L142-1 assume !(0 != main_~p3~0); 551#L147-1 assume !(0 != main_~p4~0); 549#L152-1 assume !(0 != main_~p5~0); 547#L157-1 assume !(0 != main_~p6~0); 545#L162-1 assume !(0 != main_~p7~0); 543#L167-1 assume !(0 != main_~p8~0); 540#L172-1 assume !(0 != main_~p9~0); 539#L177-1 assume !(0 != main_~p10~0); 537#L182-1 assume !(0 != main_~p11~0); 523#L187-1 assume !(0 != main_~p12~0); 451#L192-1 assume !(0 != main_~p13~0); 406#L197-1 [2021-08-31 02:02:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:29,697 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 02:02:29,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:29,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462950645] [2021-08-31 02:02:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:29,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:29,721 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:29,747 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2021-08-31 02:02:29,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:29,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304566052] [2021-08-31 02:02:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:29,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:29,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:29,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304566052] [2021-08-31 02:02:29,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304566052] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:29,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:29,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:29,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269836911] [2021-08-31 02:02:29,771 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:29,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:29,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:29,772 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:29,894 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2021-08-31 02:02:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:29,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2021-08-31 02:02:29,901 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-08-31 02:02:29,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2021-08-31 02:02:29,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2021-08-31 02:02:29,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2021-08-31 02:02:29,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2021-08-31 02:02:29,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:29,909 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-08-31 02:02:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2021-08-31 02:02:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2021-08-31 02:02:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 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-08-31 02:02:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2021-08-31 02:02:29,933 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-08-31 02:02:29,933 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-08-31 02:02:29,933 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:02:29,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2021-08-31 02:02:29,935 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-08-31 02:02:29,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:29,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:29,935 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:29,935 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:29,936 INFO L791 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 893#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 894#L197-1 [2021-08-31 02:02:29,936 INFO L793 eck$LassoCheckResult]: Loop: 894#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 1033#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1031#L83 assume !(0 != main_~p1~0); 1029#L83-2 assume !(0 != main_~p2~0); 1030#L87-1 assume !(0 != main_~p3~0); 1101#L91-1 assume !(0 != main_~p4~0); 1100#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1097#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1094#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1091#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1088#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1086#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1083#L119-1 assume !(0 != main_~p11~0); 1081#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1077#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1073#L131-1 assume !(0 != main_~p1~0); 1068#L137-1 assume !(0 != main_~p2~0); 1021#L142-1 assume !(0 != main_~p3~0); 1020#L147-1 assume !(0 != main_~p4~0); 1060#L152-1 assume !(0 != main_~p5~0); 1056#L157-1 assume !(0 != main_~p6~0); 1052#L162-1 assume !(0 != main_~p7~0); 1048#L167-1 assume !(0 != main_~p8~0); 1044#L172-1 assume !(0 != main_~p9~0); 1042#L177-1 assume !(0 != main_~p10~0); 1039#L182-1 assume !(0 != main_~p11~0); 1036#L187-1 assume !(0 != main_~p12~0); 1035#L192-1 assume !(0 != main_~p13~0); 894#L197-1 [2021-08-31 02:02:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 02:02:29,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:29,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581810786] [2021-08-31 02:02:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:29,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:29,943 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:29,951 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2021-08-31 02:02:29,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:29,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835357203] [2021-08-31 02:02:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:29,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:29,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:29,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835357203] [2021-08-31 02:02:29,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835357203] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:29,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:29,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:29,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299899048] [2021-08-31 02:02:29,970 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:29,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:29,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:29,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:29,971 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:30,085 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2021-08-31 02:02:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:30,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2021-08-31 02:02:30,091 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-08-31 02:02:30,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2021-08-31 02:02:30,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2021-08-31 02:02:30,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2021-08-31 02:02:30,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2021-08-31 02:02:30,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:30,099 INFO L681 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-08-31 02:02:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2021-08-31 02:02:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2021-08-31 02:02:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 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-08-31 02:02:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2021-08-31 02:02:30,113 INFO L704 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-08-31 02:02:30,113 INFO L587 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-08-31 02:02:30,114 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:02:30,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2021-08-31 02:02:30,117 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-08-31 02:02:30,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:30,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:30,120 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:30,120 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:30,120 INFO L791 eck$LassoCheckResult]: Stem: 1873#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1843#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 1844#L197-1 [2021-08-31 02:02:30,120 INFO L793 eck$LassoCheckResult]: Loop: 1844#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 1950#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1948#L83 assume !(0 != main_~p1~0); 1944#L83-2 assume !(0 != main_~p2~0); 1942#L87-1 assume !(0 != main_~p3~0); 1938#L91-1 assume !(0 != main_~p4~0); 1935#L95-1 assume !(0 != main_~p5~0); 1933#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1931#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1929#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1927#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1925#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1923#L119-1 assume !(0 != main_~p11~0); 1921#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1919#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1916#L131-1 assume !(0 != main_~p1~0); 1917#L137-1 assume !(0 != main_~p2~0); 1994#L142-1 assume !(0 != main_~p3~0); 1989#L147-1 assume !(0 != main_~p4~0); 1985#L152-1 assume !(0 != main_~p5~0); 1982#L157-1 assume !(0 != main_~p6~0); 1978#L162-1 assume !(0 != main_~p7~0); 1974#L167-1 assume !(0 != main_~p8~0); 1969#L172-1 assume !(0 != main_~p9~0); 1966#L177-1 assume !(0 != main_~p10~0); 1962#L182-1 assume !(0 != main_~p11~0); 1957#L187-1 assume !(0 != main_~p12~0); 1954#L192-1 assume !(0 != main_~p13~0); 1844#L197-1 [2021-08-31 02:02:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-31 02:02:30,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:30,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531043188] [2021-08-31 02:02:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:30,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:30,134 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:30,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:30,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2021-08-31 02:02:30,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:30,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074958343] [2021-08-31 02:02:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:30,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:30,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:30,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074958343] [2021-08-31 02:02:30,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074958343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:30,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:30,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:30,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975552382] [2021-08-31 02:02:30,182 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:30,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:30,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:30,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:30,183 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:30,320 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2021-08-31 02:02:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:30,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2021-08-31 02:02:30,339 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-08-31 02:02:30,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-08-31 02:02:30,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2021-08-31 02:02:30,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2021-08-31 02:02:30,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2021-08-31 02:02:30,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:30,353 INFO L681 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-08-31 02:02:30,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2021-08-31 02:02:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2021-08-31 02:02:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 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-08-31 02:02:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-08-31 02:02:30,391 INFO L704 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-08-31 02:02:30,391 INFO L587 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-08-31 02:02:30,391 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:02:30,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2021-08-31 02:02:30,399 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-08-31 02:02:30,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:30,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:30,400 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:30,400 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:30,400 INFO L791 eck$LassoCheckResult]: Stem: 3735#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3709#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 3710#L197-1 [2021-08-31 02:02:30,400 INFO L793 eck$LassoCheckResult]: Loop: 3710#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 3841#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3837#L83 assume !(0 != main_~p1~0); 3830#L83-2 assume !(0 != main_~p2~0); 3825#L87-1 assume !(0 != main_~p3~0); 3818#L91-1 assume !(0 != main_~p4~0); 3810#L95-1 assume !(0 != main_~p5~0); 3804#L99-1 assume !(0 != main_~p6~0); 3799#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3796#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3793#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3790#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3787#L119-1 assume !(0 != main_~p11~0); 3784#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3780#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 3781#L131-1 assume !(0 != main_~p1~0); 3908#L137-1 assume !(0 != main_~p2~0); 3904#L142-1 assume !(0 != main_~p3~0); 3894#L147-1 assume !(0 != main_~p4~0); 3889#L152-1 assume !(0 != main_~p5~0); 3887#L157-1 assume !(0 != main_~p6~0); 3886#L162-1 assume !(0 != main_~p7~0); 3884#L167-1 assume !(0 != main_~p8~0); 3877#L172-1 assume !(0 != main_~p9~0); 3866#L177-1 assume !(0 != main_~p10~0); 3858#L182-1 assume !(0 != main_~p11~0); 3853#L187-1 assume !(0 != main_~p12~0); 3850#L192-1 assume !(0 != main_~p13~0); 3710#L197-1 [2021-08-31 02:02:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-31 02:02:30,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:30,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229545880] [2021-08-31 02:02:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:30,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:30,409 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:30,417 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:30,418 INFO L82 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2021-08-31 02:02:30,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:30,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798851691] [2021-08-31 02:02:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:30,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:30,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:30,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798851691] [2021-08-31 02:02:30,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798851691] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:30,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:30,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:30,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823784454] [2021-08-31 02:02:30,439 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:30,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:30,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:30,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:30,440 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:30,588 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2021-08-31 02:02:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:30,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2021-08-31 02:02:30,607 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-08-31 02:02:30,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-08-31 02:02:30,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2021-08-31 02:02:30,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2021-08-31 02:02:30,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2021-08-31 02:02:30,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:30,626 INFO L681 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-08-31 02:02:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2021-08-31 02:02:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-08-31 02:02:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 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-08-31 02:02:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-08-31 02:02:30,678 INFO L704 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-08-31 02:02:30,678 INFO L587 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-08-31 02:02:30,678 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 02:02:30,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2021-08-31 02:02:30,690 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-08-31 02:02:30,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:30,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:30,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:30,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:30,691 INFO L791 eck$LassoCheckResult]: Stem: 7410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7383#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 7384#L197-1 [2021-08-31 02:02:30,692 INFO L793 eck$LassoCheckResult]: Loop: 7384#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 7625#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 7624#L83 assume !(0 != main_~p1~0); 7593#L83-2 assume !(0 != main_~p2~0); 7590#L87-1 assume !(0 != main_~p3~0); 7582#L91-1 assume !(0 != main_~p4~0); 7531#L95-1 assume !(0 != main_~p5~0); 7490#L99-1 assume !(0 != main_~p6~0); 7491#L103-1 assume !(0 != main_~p7~0); 7731#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7726#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7724#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7722#L119-1 assume !(0 != main_~p11~0); 7718#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7712#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 7705#L131-1 assume !(0 != main_~p1~0); 7654#L137-1 assume !(0 != main_~p2~0); 7651#L142-1 assume !(0 != main_~p3~0); 7648#L147-1 assume !(0 != main_~p4~0); 7646#L152-1 assume !(0 != main_~p5~0); 7644#L157-1 assume !(0 != main_~p6~0); 7642#L162-1 assume !(0 != main_~p7~0); 7641#L167-1 assume !(0 != main_~p8~0); 7638#L172-1 assume !(0 != main_~p9~0); 7637#L177-1 assume !(0 != main_~p10~0); 7635#L182-1 assume !(0 != main_~p11~0); 7632#L187-1 assume !(0 != main_~p12~0); 7631#L192-1 assume !(0 != main_~p13~0); 7384#L197-1 [2021-08-31 02:02:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-31 02:02:30,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:30,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692727092] [2021-08-31 02:02:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:30,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:30,698 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:30,704 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2021-08-31 02:02:30,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:30,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131778673] [2021-08-31 02:02:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:30,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:30,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:30,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131778673] [2021-08-31 02:02:30,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131778673] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:30,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:30,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:30,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356632412] [2021-08-31 02:02:30,758 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:30,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:30,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:30,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:30,759 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:30,910 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2021-08-31 02:02:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:30,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2021-08-31 02:02:30,973 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-08-31 02:02:31,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-08-31 02:02:31,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2021-08-31 02:02:31,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2021-08-31 02:02:31,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2021-08-31 02:02:31,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:31,016 INFO L681 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-08-31 02:02:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2021-08-31 02:02:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2021-08-31 02:02:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 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-08-31 02:02:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-08-31 02:02:31,136 INFO L704 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-08-31 02:02:31,136 INFO L587 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-08-31 02:02:31,137 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 02:02:31,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2021-08-31 02:02:31,187 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-08-31 02:02:31,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:31,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:31,191 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:31,192 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:31,192 INFO L791 eck$LassoCheckResult]: Stem: 14651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14625#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 14626#L197-1 [2021-08-31 02:02:31,192 INFO L793 eck$LassoCheckResult]: Loop: 14626#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 15042#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 15039#L83 assume !(0 != main_~p1~0); 15035#L83-2 assume !(0 != main_~p2~0); 15032#L87-1 assume !(0 != main_~p3~0); 15029#L91-1 assume !(0 != main_~p4~0); 15025#L95-1 assume !(0 != main_~p5~0); 15021#L99-1 assume !(0 != main_~p6~0); 15022#L103-1 assume !(0 != main_~p7~0); 15100#L107-1 assume !(0 != main_~p8~0); 15098#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 15096#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 15094#L119-1 assume !(0 != main_~p11~0); 15092#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 15090#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 15087#L131-1 assume !(0 != main_~p1~0); 15083#L137-1 assume !(0 != main_~p2~0); 15080#L142-1 assume !(0 != main_~p3~0); 15075#L147-1 assume !(0 != main_~p4~0); 15071#L152-1 assume !(0 != main_~p5~0); 15069#L157-1 assume !(0 != main_~p6~0); 15068#L162-1 assume !(0 != main_~p7~0); 15066#L167-1 assume !(0 != main_~p8~0); 15062#L172-1 assume !(0 != main_~p9~0); 15059#L177-1 assume !(0 != main_~p10~0); 15055#L182-1 assume !(0 != main_~p11~0); 15050#L187-1 assume !(0 != main_~p12~0); 15047#L192-1 assume !(0 != main_~p13~0); 14626#L197-1 [2021-08-31 02:02:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-31 02:02:31,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:31,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757249181] [2021-08-31 02:02:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:31,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:31,210 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:31,230 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:31,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:31,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2021-08-31 02:02:31,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:31,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649791236] [2021-08-31 02:02:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:31,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:31,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:31,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649791236] [2021-08-31 02:02:31,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649791236] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:31,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:31,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:31,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933478823] [2021-08-31 02:02:31,270 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:31,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:31,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:31,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:31,274 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:31,509 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2021-08-31 02:02:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:31,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2021-08-31 02:02:31,593 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-08-31 02:02:31,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-08-31 02:02:31,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2021-08-31 02:02:31,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2021-08-31 02:02:31,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2021-08-31 02:02:31,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:31,689 INFO L681 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-08-31 02:02:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2021-08-31 02:02:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2021-08-31 02:02:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 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-08-31 02:02:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-08-31 02:02:31,873 INFO L704 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-08-31 02:02:31,873 INFO L587 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-08-31 02:02:31,873 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 02:02:31,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2021-08-31 02:02:31,912 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-08-31 02:02:31,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:31,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:31,913 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:31,914 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:31,914 INFO L791 eck$LassoCheckResult]: Stem: 28933#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 28907#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 28908#L197-1 [2021-08-31 02:02:31,915 INFO L793 eck$LassoCheckResult]: Loop: 28908#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 29641#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29642#L83 assume !(0 != main_~p1~0); 29625#L83-2 assume !(0 != main_~p2~0); 29627#L87-1 assume !(0 != main_~p3~0); 29609#L91-1 assume !(0 != main_~p4~0); 29611#L95-1 assume !(0 != main_~p5~0); 29776#L99-1 assume !(0 != main_~p6~0); 29773#L103-1 assume !(0 != main_~p7~0); 29769#L107-1 assume !(0 != main_~p8~0); 29762#L111-1 assume !(0 != main_~p9~0); 29757#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29753#L119-1 assume !(0 != main_~p11~0); 29749#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29745#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29738#L131-1 assume !(0 != main_~p1~0); 29728#L137-1 assume !(0 != main_~p2~0); 29722#L142-1 assume !(0 != main_~p3~0); 29714#L147-1 assume !(0 != main_~p4~0); 29710#L152-1 assume !(0 != main_~p5~0); 29421#L157-1 assume !(0 != main_~p6~0); 29423#L162-1 assume !(0 != main_~p7~0); 29693#L167-1 assume !(0 != main_~p8~0); 29694#L172-1 assume !(0 != main_~p9~0); 29684#L177-1 assume !(0 != main_~p10~0); 29683#L182-1 assume !(0 != main_~p11~0); 29788#L187-1 assume !(0 != main_~p12~0); 29656#L192-1 assume !(0 != main_~p13~0); 28908#L197-1 [2021-08-31 02:02:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-31 02:02:31,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:31,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839313035] [2021-08-31 02:02:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:31,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:31,928 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:31,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:31,940 INFO L82 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2021-08-31 02:02:31,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:31,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548536961] [2021-08-31 02:02:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:31,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:31,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:31,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548536961] [2021-08-31 02:02:31,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548536961] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:31,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:31,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:31,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839838143] [2021-08-31 02:02:31,978 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:31,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:31,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:31,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:31,979 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:32,179 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2021-08-31 02:02:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:32,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2021-08-31 02:02:32,319 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-08-31 02:02:32,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-08-31 02:02:32,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2021-08-31 02:02:32,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2021-08-31 02:02:32,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2021-08-31 02:02:32,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:32,453 INFO L681 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-08-31 02:02:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2021-08-31 02:02:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2021-08-31 02:02:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 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-08-31 02:02:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-08-31 02:02:32,868 INFO L704 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-08-31 02:02:32,869 INFO L587 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-08-31 02:02:32,869 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 02:02:32,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2021-08-31 02:02:32,948 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-08-31 02:02:32,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:32,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:32,950 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:32,950 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:32,950 INFO L791 eck$LassoCheckResult]: Stem: 57107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 57077#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 57078#L197-1 [2021-08-31 02:02:32,950 INFO L793 eck$LassoCheckResult]: Loop: 57078#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 57248#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57244#L83 assume !(0 != main_~p1~0); 57241#L83-2 assume !(0 != main_~p2~0); 57238#L87-1 assume !(0 != main_~p3~0); 57234#L91-1 assume !(0 != main_~p4~0); 57230#L95-1 assume !(0 != main_~p5~0); 57226#L99-1 assume !(0 != main_~p6~0); 57221#L103-1 assume !(0 != main_~p7~0); 57216#L107-1 assume !(0 != main_~p8~0); 57217#L111-1 assume !(0 != main_~p9~0); 57538#L115-1 assume !(0 != main_~p10~0); 57534#L119-1 assume !(0 != main_~p11~0); 57530#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57526#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57519#L131-1 assume !(0 != main_~p1~0); 57512#L137-1 assume !(0 != main_~p2~0); 57494#L142-1 assume !(0 != main_~p3~0); 57475#L147-1 assume !(0 != main_~p4~0); 57471#L152-1 assume !(0 != main_~p5~0); 57467#L157-1 assume !(0 != main_~p6~0); 57465#L162-1 assume !(0 != main_~p7~0); 57453#L167-1 assume !(0 != main_~p8~0); 57451#L172-1 assume !(0 != main_~p9~0); 57450#L177-1 assume !(0 != main_~p10~0); 57449#L182-1 assume !(0 != main_~p11~0); 57253#L187-1 assume !(0 != main_~p12~0); 57252#L192-1 assume !(0 != main_~p13~0); 57078#L197-1 [2021-08-31 02:02:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-31 02:02:32,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:32,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856682994] [2021-08-31 02:02:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:32,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:32,961 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:32,966 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2021-08-31 02:02:32,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:32,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59358527] [2021-08-31 02:02:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:32,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:32,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:32,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59358527] [2021-08-31 02:02:32,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59358527] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:32,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:32,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:32,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293786746] [2021-08-31 02:02:32,990 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:32,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:32,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:32,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:32,992 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:33,252 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2021-08-31 02:02:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:33,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2021-08-31 02:02:33,412 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-08-31 02:02:33,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-08-31 02:02:33,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2021-08-31 02:02:33,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2021-08-31 02:02:33,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2021-08-31 02:02:33,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:33,710 INFO L681 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-08-31 02:02:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2021-08-31 02:02:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2021-08-31 02:02:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 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-08-31 02:02:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-08-31 02:02:34,285 INFO L704 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-08-31 02:02:34,285 INFO L587 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-08-31 02:02:34,285 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 02:02:34,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2021-08-31 02:02:34,426 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-08-31 02:02:34,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:34,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:34,427 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:34,427 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:34,427 INFO L791 eck$LassoCheckResult]: Stem: 112669#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 112639#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 112640#L197-1 [2021-08-31 02:02:34,428 INFO L793 eck$LassoCheckResult]: Loop: 112640#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 113657#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113653#L83 assume !(0 != main_~p1~0); 113649#L83-2 assume !(0 != main_~p2~0); 113647#L87-1 assume !(0 != main_~p3~0); 113643#L91-1 assume !(0 != main_~p4~0); 113639#L95-1 assume !(0 != main_~p5~0); 113635#L99-1 assume !(0 != main_~p6~0); 113631#L103-1 assume !(0 != main_~p7~0); 113627#L107-1 assume !(0 != main_~p8~0); 113623#L111-1 assume !(0 != main_~p9~0); 113624#L115-1 assume !(0 != main_~p10~0); 113702#L119-1 assume !(0 != main_~p11~0); 113699#L123-1 assume !(0 != main_~p12~0); 113697#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113695#L131-1 assume !(0 != main_~p1~0); 113693#L137-1 assume !(0 != main_~p2~0); 113681#L142-1 assume !(0 != main_~p3~0); 113675#L147-1 assume !(0 != main_~p4~0); 113544#L152-1 assume !(0 != main_~p5~0); 113545#L157-1 assume !(0 != main_~p6~0); 113491#L162-1 assume !(0 != main_~p7~0); 113493#L167-1 assume !(0 != main_~p8~0); 113427#L172-1 assume !(0 != main_~p9~0); 113428#L177-1 assume !(0 != main_~p10~0); 113669#L182-1 assume !(0 != main_~p11~0); 113664#L187-1 assume !(0 != main_~p12~0); 113661#L192-1 assume !(0 != main_~p13~0); 112640#L197-1 [2021-08-31 02:02:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-08-31 02:02:34,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:34,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183051610] [2021-08-31 02:02:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:34,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:34,433 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:34,448 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2021-08-31 02:02:34,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:34,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839698276] [2021-08-31 02:02:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:34,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:02:34,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:34,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839698276] [2021-08-31 02:02:34,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839698276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:34,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:34,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 02:02:34,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689798990] [2021-08-31 02:02:34,460 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:34,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:34,461 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:34,927 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2021-08-31 02:02:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:34,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2021-08-31 02:02:35,475 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-08-31 02:02:35,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-08-31 02:02:35,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2021-08-31 02:02:35,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2021-08-31 02:02:35,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2021-08-31 02:02:35,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:35,834 INFO L681 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-08-31 02:02:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2021-08-31 02:02:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2021-08-31 02:02:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 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-08-31 02:02:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-08-31 02:02:36,817 INFO L704 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-08-31 02:02:36,817 INFO L587 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-08-31 02:02:36,817 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 02:02:36,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2021-08-31 02:02:37,207 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-08-31 02:02:37,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:37,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:37,208 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:37,208 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:37,209 INFO L791 eck$LassoCheckResult]: Stem: 222245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 222217#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 222218#L197-1 [2021-08-31 02:02:37,209 INFO L793 eck$LassoCheckResult]: Loop: 222218#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 223381#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 223379#L83 assume !(0 != main_~p1~0); 223377#L83-2 assume !(0 != main_~p2~0); 223376#L87-1 assume !(0 != main_~p3~0); 223374#L91-1 assume !(0 != main_~p4~0); 223372#L95-1 assume !(0 != main_~p5~0); 223370#L99-1 assume !(0 != main_~p6~0); 223368#L103-1 assume !(0 != main_~p7~0); 223366#L107-1 assume !(0 != main_~p8~0); 223364#L111-1 assume !(0 != main_~p9~0); 223362#L115-1 assume !(0 != main_~p10~0); 223360#L119-1 assume !(0 != main_~p11~0); 223357#L123-1 assume !(0 != main_~p12~0); 223358#L127-1 assume !(0 != main_~p13~0); 223341#L131-1 assume !(0 != main_~p1~0); 223343#L137-1 assume !(0 != main_~p2~0); 223327#L142-1 assume !(0 != main_~p3~0); 223326#L147-1 assume !(0 != main_~p4~0); 223309#L152-1 assume !(0 != main_~p5~0); 223310#L157-1 assume !(0 != main_~p6~0); 223291#L162-1 assume !(0 != main_~p7~0); 223293#L167-1 assume !(0 != main_~p8~0); 223278#L172-1 assume !(0 != main_~p9~0); 223279#L177-1 assume !(0 != main_~p10~0); 223267#L182-1 assume !(0 != main_~p11~0); 223266#L187-1 assume !(0 != main_~p12~0); 223382#L192-1 assume !(0 != main_~p13~0); 222218#L197-1 [2021-08-31 02:02:37,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-08-31 02:02:37,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:37,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328157454] [2021-08-31 02:02:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:37,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:37,213 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:37,231 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2021-08-31 02:02:37,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:37,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152675407] [2021-08-31 02:02:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:37,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:37,240 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:37,247 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2021-08-31 02:02:37,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:37,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395082705] [2021-08-31 02:02:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:37,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:37,256 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:37,271 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:37,838 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 02:02:37,840 INFO L158 Benchmark]: Toolchain (without parser) took 9794.01ms. Allocated memory was 60.8MB in the beginning and 4.5GB in the end (delta: 4.5GB). Free memory was 41.4MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 610.4MB. Max. memory is 16.1GB. [2021-08-31 02:02:37,840 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:02:37,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.11ms. Allocated memory is still 60.8MB. Free memory was 41.3MB in the beginning and 44.0MB in the end (delta: -2.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 02:02:37,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.97ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:02:37,841 INFO L158 Benchmark]: Boogie Preprocessor took 20.61ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 40.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:37,842 INFO L158 Benchmark]: RCFGBuilder took 233.92ms. Allocated memory is still 60.8MB. Free memory was 40.8MB in the beginning and 30.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 02:02:37,842 INFO L158 Benchmark]: BuchiAutomizer took 9253.39ms. Allocated memory was 60.8MB in the beginning and 4.5GB in the end (delta: 4.5GB). Free memory was 30.3MB in the beginning and 3.9GB in the end (delta: -3.9GB). Peak memory consumption was 601.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:37,843 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.11ms. Allocated memory is still 60.8MB. Free memory was 41.3MB in the beginning and 44.0MB in the end (delta: -2.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.97ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.61ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 40.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 233.92ms. Allocated memory is still 60.8MB. Free memory was 40.8MB in the beginning and 30.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9253.39ms. Allocated memory was 60.8MB in the beginning and 4.5GB in the end (delta: 4.5GB). Free memory was 30.3MB in the beginning and 3.9GB in the end (delta: -3.9GB). Peak memory consumption was 601.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 02:02:37,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...