./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.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_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dfa849b43716e8587b0fc4953cadbe3968c4e3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:41,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:02:41,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:02:41,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:02:41,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:02:41,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:02:41,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:02:41,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:02:41,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:02:41,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:02:41,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:02:41,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:02:41,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:02:41,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:02:41,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:02:41,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:02:41,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:02:41,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:02:41,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:02:41,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:02:41,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:02:41,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:02:41,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:02:41,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:02:41,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:02:41,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:02:41,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:02:41,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:02:41,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:02:41,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:02:41,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:02:41,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:02:41,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:02:41,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:02:41,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:02:41,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:02:41,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:02:41,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:02:41,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:02:41,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:02:41,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:02:41,690 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:41,721 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:02:41,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:02:41,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:02:41,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:02:41,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:02:41,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:02:41,724 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:02:41,725 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:02:41,725 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:02:41,725 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:02:41,725 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:02:41,726 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:02:41,726 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:02:41,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:02:41,726 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:02:41,726 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:02:41,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:02:41,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:02:41,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:02:41,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:02:41,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:02:41,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:02:41,727 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:02:41,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:02:41,728 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:02:41,728 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:02:41,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:02:41,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:02:41,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:02:41,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:02:41,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:02:41,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:02:41,730 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:02:41,730 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 -> 04dfa849b43716e8587b0fc4953cadbe3968c4e3 [2021-08-31 02:02:42,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:02:42,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:02:42,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:02:42,048 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:02:42,049 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:02:42,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2021-08-31 02:02:42,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7296f8222/5299ba09746d4a40937219d8f2a92962/FLAGfdd582d50 [2021-08-31 02:02:42,432 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:02:42,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2021-08-31 02:02:42,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7296f8222/5299ba09746d4a40937219d8f2a92962/FLAGfdd582d50 [2021-08-31 02:02:42,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7296f8222/5299ba09746d4a40937219d8f2a92962 [2021-08-31 02:02:42,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:02:42,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:02:42,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:42,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:02:42,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:02:42,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:42" (1/1) ... [2021-08-31 02:02:42,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21348a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:42, skipping insertion in model container [2021-08-31 02:02:42,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:02:42" (1/1) ... [2021-08-31 02:02:42,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:02:42,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:02:42,589 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_15-1.c[5654,5667] [2021-08-31 02:02:42,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:42,596 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:02:42,615 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_15-1.c[5654,5667] [2021-08-31 02:02:42,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:02:42,625 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:02:42,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:42 WrapperNode [2021-08-31 02:02:42,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:02:42,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:42,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:02:42,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:02:42,632 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:42" (1/1) ... [2021-08-31 02:02:42,637 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:42" (1/1) ... [2021-08-31 02:02:42,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:02:42,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:02:42,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:02:42,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:02:42,662 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:42" (1/1) ... [2021-08-31 02:02:42,663 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:42" (1/1) ... [2021-08-31 02:02:42,675 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:42" (1/1) ... [2021-08-31 02:02:42,677 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:42" (1/1) ... [2021-08-31 02:02:42,680 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:42" (1/1) ... [2021-08-31 02:02:42,690 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:42" (1/1) ... [2021-08-31 02:02:42,695 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:42" (1/1) ... [2021-08-31 02:02:42,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:02:42,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:02:42,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:02:42,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:02:42,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:42" (1/1) ... [2021-08-31 02:02:42,711 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:02:42,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:02:42,728 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:42,751 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:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:02:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:02:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:02:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:02:42,956 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:02:42,957 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 02:02:42,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:42 BoogieIcfgContainer [2021-08-31 02:02:42,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:02:42,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:02:42,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:02:42,963 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:02:42,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:42,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:02:42" (1/3) ... [2021-08-31 02:02:42,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5cf3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:42, skipping insertion in model container [2021-08-31 02:02:42,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:42,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:02:42" (2/3) ... [2021-08-31 02:02:42,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5cf3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:02:42, skipping insertion in model container [2021-08-31 02:02:42,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:02:42,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:02:42" (3/3) ... [2021-08-31 02:02:42,967 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2021-08-31 02:02:43,008 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:02:43,008 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:02:43,008 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:02:43,008 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:02:43,008 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:02:43,009 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:02:43,009 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:02:43,009 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:02:43,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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:43,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-31 02:02:43,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,046 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,046 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,046 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:02:43,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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:43,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-31 02:02:43,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,059 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,059 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,066 INFO L791 eck$LassoCheckResult]: Stem: 43#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 34#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 22#L225-1true [2021-08-31 02:02:43,067 INFO L793 eck$LassoCheckResult]: Loop: 22#L225-1true assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33#L58true 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 29#L93true assume 0 != main_~p1~0;main_~lk1~0 := 1; 27#L93-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 14#L97-1true assume !(0 != main_~p3~0); 17#L101-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 50#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 45#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 24#L117-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 31#L121-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 18#L125-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 36#L129-1true assume !(0 != main_~p11~0); 4#L133-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 7#L137-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 40#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 55#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 48#L149-1true assume !(0 != main_~p1~0); 47#L155-1true assume 0 != main_~p2~0; 9#L161true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 20#L160true assume !(0 != main_~p3~0); 12#L165-1true assume !(0 != main_~p4~0); 42#L170-1true assume !(0 != main_~p5~0); 46#L175-1true assume !(0 != main_~p6~0); 19#L180-1true assume !(0 != main_~p7~0); 39#L185-1true assume !(0 != main_~p8~0); 26#L190-1true assume !(0 != main_~p9~0); 41#L195-1true assume !(0 != main_~p10~0); 16#L200-1true assume !(0 != main_~p11~0); 44#L205-1true assume !(0 != main_~p12~0); 25#L210-1true assume !(0 != main_~p13~0); 6#L215-1true assume 0 != main_~p14~0; 15#L221true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 54#L220true assume !(0 != main_~p15~0); 22#L225-1true [2021-08-31 02:02:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,073 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:02:43,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5336544] [2021-08-31 02:02:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,163 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2021-08-31 02:02:43,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011302640] [2021-08-31 02:02:43,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:43,287 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:43,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:43,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011302640] [2021-08-31 02:02:43,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011302640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:43,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:43,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:43,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351978904] [2021-08-31 02:02:43,292 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:43,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:43,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:43,321 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:43,642 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-08-31 02:02:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:43,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-08-31 02:02:43,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-08-31 02:02:43,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2021-08-31 02:02:43,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-08-31 02:02:43,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-08-31 02:02:43,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2021-08-31 02:02:43,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:43,658 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-08-31 02:02:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2021-08-31 02:02:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-08-31 02:02:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 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:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2021-08-31 02:02:43,681 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-08-31 02:02:43,681 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-08-31 02:02:43,681 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:02:43,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2021-08-31 02:02:43,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-08-31 02:02:43,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,684 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,684 INFO L791 eck$LassoCheckResult]: Stem: 218#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 212#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 174#L225-1 [2021-08-31 02:02:43,684 INFO L793 eck$LassoCheckResult]: Loop: 174#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 210#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 211#L93 assume !(0 != main_~p1~0); 206#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 186#L97-1 assume !(0 != main_~p3~0); 187#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 191#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 220#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 182#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 183#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 201#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 192#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 193#L129-1 assume !(0 != main_~p11~0); 168#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 169#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 172#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 215#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 226#L149-1 assume !(0 != main_~p1~0); 227#L155-1 assume 0 != main_~p2~0; 262#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 261#L160 assume !(0 != main_~p3~0); 259#L165-1 assume !(0 != main_~p4~0); 256#L170-1 assume !(0 != main_~p5~0); 255#L175-1 assume !(0 != main_~p6~0); 253#L180-1 assume !(0 != main_~p7~0); 250#L185-1 assume !(0 != main_~p8~0); 249#L190-1 assume !(0 != main_~p9~0); 216#L195-1 assume !(0 != main_~p10~0); 188#L200-1 assume !(0 != main_~p11~0); 189#L205-1 assume !(0 != main_~p12~0); 241#L210-1 assume !(0 != main_~p13~0); 239#L215-1 assume 0 != main_~p14~0; 184#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 185#L220 assume !(0 != main_~p15~0); 174#L225-1 [2021-08-31 02:02:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,685 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 02:02:43,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902009046] [2021-08-31 02:02:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,698 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2021-08-31 02:02:43,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751738500] [2021-08-31 02:02:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:43,771 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:43,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:43,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751738500] [2021-08-31 02:02:43,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751738500] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:43,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:43,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:43,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257192674] [2021-08-31 02:02:43,779 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:43,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:43,783 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:43,935 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2021-08-31 02:02:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:43,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2021-08-31 02:02:43,946 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-08-31 02:02:43,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2021-08-31 02:02:43,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-08-31 02:02:43,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-08-31 02:02:43,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2021-08-31 02:02:43,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:43,953 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-08-31 02:02:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2021-08-31 02:02:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-08-31 02:02:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2021-08-31 02:02:43,963 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-08-31 02:02:43,963 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-08-31 02:02:43,964 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:02:43,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2021-08-31 02:02:43,965 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-08-31 02:02:43,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:43,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:43,965 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:43,965 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:43,966 INFO L791 eck$LassoCheckResult]: Stem: 503#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 495#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 496#L225-1 [2021-08-31 02:02:43,966 INFO L793 eck$LassoCheckResult]: Loop: 496#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 521#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 518#L93 assume !(0 != main_~p1~0); 519#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 513#L97-1 assume !(0 != main_~p3~0); 514#L101-1 assume !(0 != main_~p4~0); 589#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 588#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 587#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 586#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 585#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 584#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 583#L129-1 assume !(0 != main_~p11~0); 582#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 581#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 580#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 579#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 578#L149-1 assume !(0 != main_~p1~0); 577#L155-1 assume 0 != main_~p2~0; 576#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 573#L160 assume !(0 != main_~p3~0); 569#L165-1 assume !(0 != main_~p4~0); 565#L170-1 assume !(0 != main_~p5~0); 562#L175-1 assume !(0 != main_~p6~0); 558#L180-1 assume !(0 != main_~p7~0); 553#L185-1 assume !(0 != main_~p8~0); 550#L190-1 assume !(0 != main_~p9~0); 546#L195-1 assume !(0 != main_~p10~0); 542#L200-1 assume !(0 != main_~p11~0); 538#L205-1 assume !(0 != main_~p12~0); 534#L210-1 assume !(0 != main_~p13~0); 530#L215-1 assume 0 != main_~p14~0; 528#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 526#L220 assume !(0 != main_~p15~0); 496#L225-1 [2021-08-31 02:02:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 02:02:43,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821860300] [2021-08-31 02:02:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,983 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:43,993 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2021-08-31 02:02:43,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:43,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818092056] [2021-08-31 02:02:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:43,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,026 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:44,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818092056] [2021-08-31 02:02:44,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818092056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169408352] [2021-08-31 02:02:44,027 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,028 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:44,157 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2021-08-31 02:02:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:44,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2021-08-31 02:02:44,161 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-08-31 02:02:44,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2021-08-31 02:02:44,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-08-31 02:02:44,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-08-31 02:02:44,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2021-08-31 02:02:44,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:44,169 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-08-31 02:02:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2021-08-31 02:02:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-08-31 02:02:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2021-08-31 02:02:44,199 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-08-31 02:02:44,199 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-08-31 02:02:44,199 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:02:44,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2021-08-31 02:02:44,201 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-08-31 02:02:44,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:44,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:44,202 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:44,202 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:44,202 INFO L791 eck$LassoCheckResult]: Stem: 1060#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1053#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1054#L225-1 [2021-08-31 02:02:44,203 INFO L793 eck$LassoCheckResult]: Loop: 1054#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1078#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 1079#L93 assume !(0 != main_~p1~0); 1205#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1223#L97-1 assume !(0 != main_~p3~0); 1220#L101-1 assume !(0 != main_~p4~0); 1217#L105-1 assume !(0 != main_~p5~0); 1215#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1214#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1212#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1210#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1208#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1206#L129-1 assume !(0 != main_~p11~0); 1203#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1200#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1197#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1193#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1167#L149-1 assume !(0 != main_~p1~0); 1165#L155-1 assume 0 != main_~p2~0; 1162#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1160#L160 assume !(0 != main_~p3~0); 1156#L165-1 assume !(0 != main_~p4~0); 1153#L170-1 assume !(0 != main_~p5~0); 1132#L175-1 assume !(0 != main_~p6~0); 1128#L180-1 assume !(0 != main_~p7~0); 1122#L185-1 assume !(0 != main_~p8~0); 1118#L190-1 assume !(0 != main_~p9~0); 1117#L195-1 assume !(0 != main_~p10~0); 1241#L200-1 assume !(0 != main_~p11~0); 1103#L205-1 assume !(0 != main_~p12~0); 1102#L210-1 assume !(0 != main_~p13~0); 1091#L215-1 assume 0 != main_~p14~0; 1092#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1086#L220 assume !(0 != main_~p15~0); 1054#L225-1 [2021-08-31 02:02:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,204 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-31 02:02:44,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356824698] [2021-08-31 02:02:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,227 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:44,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,247 INFO L82 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2021-08-31 02:02:44,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385077327] [2021-08-31 02:02:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,265 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:44,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385077327] [2021-08-31 02:02:44,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385077327] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353442456] [2021-08-31 02:02:44,267 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,268 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:44,388 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2021-08-31 02:02:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:44,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2021-08-31 02:02:44,395 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-08-31 02:02:44,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2021-08-31 02:02:44,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-08-31 02:02:44,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-08-31 02:02:44,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2021-08-31 02:02:44,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:44,403 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-08-31 02:02:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2021-08-31 02:02:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-08-31 02:02:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2021-08-31 02:02:44,414 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-08-31 02:02:44,414 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-08-31 02:02:44,414 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:02:44,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2021-08-31 02:02:44,418 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-08-31 02:02:44,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:44,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:44,421 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:44,421 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:44,422 INFO L791 eck$LassoCheckResult]: Stem: 2165#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2154#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 2155#L225-1 [2021-08-31 02:02:44,422 INFO L793 eck$LassoCheckResult]: Loop: 2155#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2351#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 2348#L93 assume !(0 != main_~p1~0); 2349#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2338#L97-1 assume !(0 != main_~p3~0); 2339#L101-1 assume !(0 != main_~p4~0); 2327#L105-1 assume !(0 != main_~p5~0); 2329#L109-1 assume !(0 != main_~p6~0); 2315#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2316#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2303#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2304#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2291#L129-1 assume !(0 != main_~p11~0); 2292#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2279#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2280#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2267#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2268#L149-1 assume !(0 != main_~p1~0); 2399#L155-1 assume 0 != main_~p2~0; 2398#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2397#L160 assume !(0 != main_~p3~0); 2393#L165-1 assume !(0 != main_~p4~0); 2391#L170-1 assume !(0 != main_~p5~0); 2389#L175-1 assume !(0 != main_~p6~0); 2386#L180-1 assume !(0 != main_~p7~0); 2381#L185-1 assume !(0 != main_~p8~0); 2378#L190-1 assume !(0 != main_~p9~0); 2374#L195-1 assume !(0 != main_~p10~0); 2370#L200-1 assume !(0 != main_~p11~0); 2366#L205-1 assume !(0 != main_~p12~0); 2362#L210-1 assume !(0 != main_~p13~0); 2359#L215-1 assume 0 != main_~p14~0; 2357#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2356#L220 assume !(0 != main_~p15~0); 2155#L225-1 [2021-08-31 02:02:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-31 02:02:44,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930468408] [2021-08-31 02:02:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,440 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2021-08-31 02:02:44,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909708271] [2021-08-31 02:02:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,479 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:44,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909708271] [2021-08-31 02:02:44,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909708271] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111157349] [2021-08-31 02:02:44,480 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,485 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:44,598 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2021-08-31 02:02:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:44,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2021-08-31 02:02:44,612 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-08-31 02:02:44,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-08-31 02:02:44,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-08-31 02:02:44,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-08-31 02:02:44,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2021-08-31 02:02:44,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:44,620 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-08-31 02:02:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2021-08-31 02:02:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-08-31 02:02:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-08-31 02:02:44,642 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-08-31 02:02:44,642 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-08-31 02:02:44,642 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:02:44,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2021-08-31 02:02:44,647 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-08-31 02:02:44,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:44,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:44,648 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:44,649 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:44,649 INFO L791 eck$LassoCheckResult]: Stem: 4312#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4301#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 4302#L225-1 [2021-08-31 02:02:44,649 INFO L793 eck$LassoCheckResult]: Loop: 4302#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4635#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 4632#L93 assume !(0 != main_~p1~0); 4595#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4352#L97-1 assume !(0 != main_~p3~0); 4353#L101-1 assume !(0 != main_~p4~0); 4588#L105-1 assume !(0 != main_~p5~0); 4586#L109-1 assume !(0 != main_~p6~0); 4580#L113-1 assume !(0 != main_~p7~0); 4576#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4572#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4569#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4566#L129-1 assume !(0 != main_~p11~0); 4563#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4559#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4556#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4553#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4548#L149-1 assume !(0 != main_~p1~0); 4546#L155-1 assume 0 != main_~p2~0; 4543#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4540#L160 assume !(0 != main_~p3~0); 4535#L165-1 assume !(0 != main_~p4~0); 4536#L170-1 assume !(0 != main_~p5~0); 4686#L175-1 assume !(0 != main_~p6~0); 4682#L180-1 assume !(0 != main_~p7~0); 4678#L185-1 assume !(0 != main_~p8~0); 4674#L190-1 assume !(0 != main_~p9~0); 4668#L195-1 assume !(0 != main_~p10~0); 4663#L200-1 assume !(0 != main_~p11~0); 4658#L205-1 assume !(0 != main_~p12~0); 4653#L210-1 assume !(0 != main_~p13~0); 4648#L215-1 assume 0 != main_~p14~0; 4645#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4642#L220 assume !(0 != main_~p15~0); 4302#L225-1 [2021-08-31 02:02:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-31 02:02:44,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318823419] [2021-08-31 02:02:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,662 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,676 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2021-08-31 02:02:44,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874391894] [2021-08-31 02:02:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,726 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:44,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874391894] [2021-08-31 02:02:44,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874391894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792496616] [2021-08-31 02:02:44,727 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,728 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:44,829 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2021-08-31 02:02:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:44,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2021-08-31 02:02:44,851 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-08-31 02:02:44,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-08-31 02:02:44,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-08-31 02:02:44,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-08-31 02:02:44,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2021-08-31 02:02:44,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:44,867 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-08-31 02:02:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2021-08-31 02:02:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-08-31 02:02:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-08-31 02:02:44,930 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-08-31 02:02:44,930 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-08-31 02:02:44,930 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 02:02:44,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2021-08-31 02:02:44,942 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-08-31 02:02:44,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:44,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:44,944 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:44,944 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:44,944 INFO L791 eck$LassoCheckResult]: Stem: 8565#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8557#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 8558#L225-1 [2021-08-31 02:02:44,945 INFO L793 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8705#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 8706#L93 assume !(0 != main_~p1~0); 8830#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8829#L97-1 assume !(0 != main_~p3~0); 8827#L101-1 assume !(0 != main_~p4~0); 8824#L105-1 assume !(0 != main_~p5~0); 8820#L109-1 assume !(0 != main_~p6~0); 8816#L113-1 assume !(0 != main_~p7~0); 8812#L117-1 assume !(0 != main_~p8~0); 8810#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8808#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8806#L129-1 assume !(0 != main_~p11~0); 8804#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8802#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8800#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8798#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8795#L149-1 assume !(0 != main_~p1~0); 8796#L155-1 assume 0 != main_~p2~0; 8785#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8786#L160 assume !(0 != main_~p3~0); 8777#L165-1 assume !(0 != main_~p4~0); 8778#L170-1 assume !(0 != main_~p5~0); 8766#L175-1 assume !(0 != main_~p6~0); 8768#L180-1 assume !(0 != main_~p7~0); 8756#L185-1 assume !(0 != main_~p8~0); 8757#L190-1 assume !(0 != main_~p9~0); 8747#L195-1 assume !(0 != main_~p10~0); 8746#L200-1 assume !(0 != main_~p11~0); 8735#L205-1 assume !(0 != main_~p12~0); 8734#L210-1 assume !(0 != main_~p13~0); 8722#L215-1 assume 0 != main_~p14~0; 8723#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8715#L220 assume !(0 != main_~p15~0); 8558#L225-1 [2021-08-31 02:02:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-31 02:02:44,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494732268] [2021-08-31 02:02:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,955 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:44,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2021-08-31 02:02:44,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:44,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840902846] [2021-08-31 02:02:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:44,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:44,991 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:44,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:44,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840902846] [2021-08-31 02:02:44,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840902846] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:44,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:44,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:44,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977392385] [2021-08-31 02:02:44,992 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:44,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:44,992 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:45,132 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2021-08-31 02:02:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:45,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2021-08-31 02:02:45,167 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-08-31 02:02:45,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-08-31 02:02:45,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-08-31 02:02:45,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-08-31 02:02:45,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2021-08-31 02:02:45,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:45,211 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-08-31 02:02:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2021-08-31 02:02:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-08-31 02:02:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-08-31 02:02:45,374 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-08-31 02:02:45,374 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-08-31 02:02:45,375 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 02:02:45,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2021-08-31 02:02:45,396 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-08-31 02:02:45,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:45,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:45,397 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:45,397 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:45,397 INFO L791 eck$LassoCheckResult]: Stem: 16967#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16953#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 16954#L225-1 [2021-08-31 02:02:45,397 INFO L793 eck$LassoCheckResult]: Loop: 16954#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17157#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 17155#L93 assume !(0 != main_~p1~0); 17151#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17147#L97-1 assume !(0 != main_~p3~0); 17140#L101-1 assume !(0 != main_~p4~0); 17132#L105-1 assume !(0 != main_~p5~0); 17127#L109-1 assume !(0 != main_~p6~0); 17120#L113-1 assume !(0 != main_~p7~0); 17112#L117-1 assume !(0 != main_~p8~0); 17104#L121-1 assume !(0 != main_~p9~0); 17099#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17095#L129-1 assume !(0 != main_~p11~0); 17091#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17087#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17083#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17079#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17073#L149-1 assume !(0 != main_~p1~0); 17074#L155-1 assume 0 != main_~p2~0; 17211#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17206#L160 assume !(0 != main_~p3~0); 17201#L165-1 assume !(0 != main_~p4~0); 17197#L170-1 assume !(0 != main_~p5~0); 17193#L175-1 assume !(0 != main_~p6~0); 17191#L180-1 assume !(0 != main_~p7~0); 17189#L185-1 assume !(0 != main_~p8~0); 17185#L190-1 assume !(0 != main_~p9~0); 17182#L195-1 assume !(0 != main_~p10~0); 17178#L200-1 assume !(0 != main_~p11~0); 17174#L205-1 assume !(0 != main_~p12~0); 17170#L210-1 assume !(0 != main_~p13~0); 17166#L215-1 assume 0 != main_~p14~0; 17164#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17162#L220 assume !(0 != main_~p15~0); 16954#L225-1 [2021-08-31 02:02:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-31 02:02:45,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:45,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364022604] [2021-08-31 02:02:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:45,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:45,403 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:45,423 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2021-08-31 02:02:45,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:45,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834210393] [2021-08-31 02:02:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:45,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:45,457 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:45,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:45,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834210393] [2021-08-31 02:02:45,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834210393] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:45,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:45,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:45,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924137841] [2021-08-31 02:02:45,459 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:45,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:45,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:45,460 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:45,579 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2021-08-31 02:02:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:45,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2021-08-31 02:02:45,654 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-08-31 02:02:45,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-08-31 02:02:45,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-08-31 02:02:45,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-08-31 02:02:45,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2021-08-31 02:02:45,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:45,753 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-08-31 02:02:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2021-08-31 02:02:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-08-31 02:02:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-08-31 02:02:45,983 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-08-31 02:02:45,983 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-08-31 02:02:45,983 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 02:02:45,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2021-08-31 02:02:46,014 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-08-31 02:02:46,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:46,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:46,014 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:46,014 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:46,015 INFO L791 eck$LassoCheckResult]: Stem: 33550#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 33536#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 33537#L225-1 [2021-08-31 02:02:46,015 INFO L793 eck$LassoCheckResult]: Loop: 33537#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33841#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 33839#L93 assume !(0 != main_~p1~0); 33838#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33837#L97-1 assume !(0 != main_~p3~0); 33835#L101-1 assume !(0 != main_~p4~0); 33833#L105-1 assume !(0 != main_~p5~0); 33831#L109-1 assume !(0 != main_~p6~0); 33830#L113-1 assume !(0 != main_~p7~0); 33828#L117-1 assume !(0 != main_~p8~0); 33824#L121-1 assume !(0 != main_~p9~0); 33821#L125-1 assume !(0 != main_~p10~0); 33815#L129-1 assume !(0 != main_~p11~0); 33816#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33807#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33808#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33799#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33800#L149-1 assume !(0 != main_~p1~0); 33789#L155-1 assume 0 != main_~p2~0; 33790#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33781#L160 assume !(0 != main_~p3~0); 33780#L165-1 assume !(0 != main_~p4~0); 33720#L170-1 assume !(0 != main_~p5~0); 33721#L175-1 assume !(0 != main_~p6~0); 33711#L180-1 assume !(0 != main_~p7~0); 33712#L185-1 assume !(0 != main_~p8~0); 33699#L190-1 assume !(0 != main_~p9~0); 33701#L195-1 assume !(0 != main_~p10~0); 33851#L200-1 assume !(0 != main_~p11~0); 33849#L205-1 assume !(0 != main_~p12~0); 33847#L210-1 assume !(0 != main_~p13~0); 33845#L215-1 assume 0 != main_~p14~0; 33844#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33843#L220 assume !(0 != main_~p15~0); 33537#L225-1 [2021-08-31 02:02:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-31 02:02:46,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:46,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244597154] [2021-08-31 02:02:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:46,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:46,025 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:46,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2021-08-31 02:02:46,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:46,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888940809] [2021-08-31 02:02:46,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:46,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:46,053 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:46,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:46,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888940809] [2021-08-31 02:02:46,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888940809] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:46,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:46,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:46,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728961924] [2021-08-31 02:02:46,054 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:46,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:46,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:46,055 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:46,234 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2021-08-31 02:02:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:46,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2021-08-31 02:02:46,383 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-08-31 02:02:46,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-08-31 02:02:46,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-08-31 02:02:46,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-08-31 02:02:46,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2021-08-31 02:02:46,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:46,480 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-08-31 02:02:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2021-08-31 02:02:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-08-31 02:02:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-08-31 02:02:46,799 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-08-31 02:02:46,799 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-08-31 02:02:46,799 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 02:02:46,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2021-08-31 02:02:46,934 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-08-31 02:02:46,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:46,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:46,934 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:46,934 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:46,935 INFO L791 eck$LassoCheckResult]: Stem: 66321#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 66308#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 66309#L225-1 [2021-08-31 02:02:46,935 INFO L793 eck$LassoCheckResult]: Loop: 66309#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66490#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 66486#L93 assume !(0 != main_~p1~0); 66484#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66482#L97-1 assume !(0 != main_~p3~0); 66478#L101-1 assume !(0 != main_~p4~0); 66474#L105-1 assume !(0 != main_~p5~0); 66472#L109-1 assume !(0 != main_~p6~0); 66468#L113-1 assume !(0 != main_~p7~0); 66464#L117-1 assume !(0 != main_~p8~0); 66460#L121-1 assume !(0 != main_~p9~0); 66456#L125-1 assume !(0 != main_~p10~0); 66454#L129-1 assume !(0 != main_~p11~0); 66450#L133-1 assume !(0 != main_~p12~0); 66448#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66446#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66444#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66440#L149-1 assume !(0 != main_~p1~0); 66438#L155-1 assume 0 != main_~p2~0; 66436#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66433#L160 assume !(0 != main_~p3~0); 66428#L165-1 assume !(0 != main_~p4~0); 66424#L170-1 assume !(0 != main_~p5~0); 66421#L175-1 assume !(0 != main_~p6~0); 66422#L180-1 assume !(0 != main_~p7~0); 66521#L185-1 assume !(0 != main_~p8~0); 66517#L190-1 assume !(0 != main_~p9~0); 66513#L195-1 assume !(0 != main_~p10~0); 66510#L200-1 assume !(0 != main_~p11~0); 66505#L205-1 assume !(0 != main_~p12~0); 66502#L210-1 assume !(0 != main_~p13~0); 66499#L215-1 assume 0 != main_~p14~0; 66497#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66494#L220 assume !(0 != main_~p15~0); 66309#L225-1 [2021-08-31 02:02:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-31 02:02:46,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:46,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33447583] [2021-08-31 02:02:46,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:46,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:46,939 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:46,943 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:46,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:46,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2021-08-31 02:02:46,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:46,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148573989] [2021-08-31 02:02:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:46,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:46,960 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:46,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:46,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148573989] [2021-08-31 02:02:46,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148573989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:46,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:46,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:02:46,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860967035] [2021-08-31 02:02:46,961 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:46,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:46,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:46,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:46,962 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:47,145 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2021-08-31 02:02:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:47,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2021-08-31 02:02:47,415 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-08-31 02:02:47,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-08-31 02:02:47,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-08-31 02:02:47,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-08-31 02:02:47,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2021-08-31 02:02:47,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:47,663 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-08-31 02:02:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2021-08-31 02:02:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-08-31 02:02:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 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:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-08-31 02:02:48,341 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-08-31 02:02:48,341 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-08-31 02:02:48,341 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 02:02:48,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2021-08-31 02:02:48,465 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-08-31 02:02:48,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:48,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:48,466 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:48,466 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:48,466 INFO L791 eck$LassoCheckResult]: Stem: 131107#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 131095#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 131096#L225-1 [2021-08-31 02:02:48,467 INFO L793 eck$LassoCheckResult]: Loop: 131096#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 132419#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 132416#L93 assume !(0 != main_~p1~0); 132413#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 132411#L97-1 assume !(0 != main_~p3~0); 132408#L101-1 assume !(0 != main_~p4~0); 132404#L105-1 assume !(0 != main_~p5~0); 132400#L109-1 assume !(0 != main_~p6~0); 132396#L113-1 assume !(0 != main_~p7~0); 132392#L117-1 assume !(0 != main_~p8~0); 132388#L121-1 assume !(0 != main_~p9~0); 132384#L125-1 assume !(0 != main_~p10~0); 132381#L129-1 assume !(0 != main_~p11~0); 132378#L133-1 assume !(0 != main_~p12~0); 132379#L137-1 assume !(0 != main_~p13~0); 132483#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 132481#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 132476#L149-1 assume !(0 != main_~p1~0); 132474#L155-1 assume 0 != main_~p2~0; 132472#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 132304#L160 assume !(0 != main_~p3~0); 132303#L165-1 assume !(0 != main_~p4~0); 132269#L170-1 assume !(0 != main_~p5~0); 132270#L175-1 assume !(0 != main_~p6~0); 132246#L180-1 assume !(0 != main_~p7~0); 132247#L185-1 assume !(0 != main_~p8~0); 132158#L190-1 assume !(0 != main_~p9~0); 132160#L195-1 assume !(0 != main_~p10~0); 132436#L200-1 assume !(0 != main_~p11~0); 132431#L205-1 assume !(0 != main_~p12~0); 132429#L210-1 assume !(0 != main_~p13~0); 132428#L215-1 assume 0 != main_~p14~0; 132426#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 132424#L220 assume !(0 != main_~p15~0); 131096#L225-1 [2021-08-31 02:02:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-08-31 02:02:48,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:48,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032791971] [2021-08-31 02:02:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:48,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,472 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:48,502 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2021-08-31 02:02:48,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:48,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327779643] [2021-08-31 02:02:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:48,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:02:48,532 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:48,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:02:48,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327779643] [2021-08-31 02:02:48,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327779643] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:02:48,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:02:48,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 02:02:48,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615388298] [2021-08-31 02:02:48,535 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 02:02:48,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:02:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:02:48,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:02:48,536 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:02:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:02:49,075 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2021-08-31 02:02:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:02:49,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2021-08-31 02:02:49,504 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-08-31 02:02:49,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-08-31 02:02:49,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-08-31 02:02:49,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-08-31 02:02:49,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2021-08-31 02:02:49,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:02:49,795 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-08-31 02:02:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2021-08-31 02:02:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-08-31 02:02:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 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:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-08-31 02:02:50,875 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-08-31 02:02:50,875 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-08-31 02:02:50,875 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 02:02:50,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2021-08-31 02:02:51,326 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-08-31 02:02:51,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:02:51,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:02:51,328 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:02:51,328 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, 1, 1, 1, 1, 1, 1] [2021-08-31 02:02:51,328 INFO L791 eck$LassoCheckResult]: Stem: 259110#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 259098#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_#t~nondet21, main_#t~nondet22, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 259099#L225-1 [2021-08-31 02:02:51,328 INFO L793 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 260713#L58 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 260700#L93 assume !(0 != main_~p1~0); 260702#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 260686#L97-1 assume !(0 != main_~p3~0); 260687#L101-1 assume !(0 != main_~p4~0); 260670#L105-1 assume !(0 != main_~p5~0); 260672#L109-1 assume !(0 != main_~p6~0); 260644#L113-1 assume !(0 != main_~p7~0); 260646#L117-1 assume !(0 != main_~p8~0); 260618#L121-1 assume !(0 != main_~p9~0); 260620#L125-1 assume !(0 != main_~p10~0); 260839#L129-1 assume !(0 != main_~p11~0); 260837#L133-1 assume !(0 != main_~p12~0); 260833#L137-1 assume !(0 != main_~p13~0); 260830#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 260827#L145-1 assume !(0 != main_~p15~0); 260824#L149-1 assume !(0 != main_~p1~0); 260821#L155-1 assume 0 != main_~p2~0; 260818#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 260796#L160 assume !(0 != main_~p3~0); 260787#L165-1 assume !(0 != main_~p4~0); 260779#L170-1 assume !(0 != main_~p5~0); 260771#L175-1 assume !(0 != main_~p6~0); 260765#L180-1 assume !(0 != main_~p7~0); 260761#L185-1 assume !(0 != main_~p8~0); 260758#L190-1 assume !(0 != main_~p9~0); 260756#L195-1 assume !(0 != main_~p10~0); 260753#L200-1 assume !(0 != main_~p11~0); 260730#L205-1 assume !(0 != main_~p12~0); 260732#L210-1 assume !(0 != main_~p13~0); 260746#L215-1 assume 0 != main_~p14~0; 260738#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 260739#L220 assume !(0 != main_~p15~0); 259099#L225-1 [2021-08-31 02:02:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-08-31 02:02:51,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:51,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950390282] [2021-08-31 02:02:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:51,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:51,335 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:51,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:51,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2021-08-31 02:02:51,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:51,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126529844] [2021-08-31 02:02:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:51,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:51,343 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:51,348 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:02:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2021-08-31 02:02:51,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:02:51,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585125498] [2021-08-31 02:02:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:02:51,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:02:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:51,354 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:02:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:02:51,363 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:02:51,901 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:51,903 INFO L158 Benchmark]: Toolchain (without parser) took 9446.59ms. Allocated memory was 48.2MB in the beginning and 3.7GB in the end (delta: 3.7GB). Free memory was 24.5MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 688.4MB. Max. memory is 16.1GB. [2021-08-31 02:02:51,903 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 31.1MB in the beginning and 31.0MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:02:51,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.19ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.3MB in the beginning and 35.0MB in the end (delta: -10.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2021-08-31 02:02:51,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.15ms. Allocated memory is still 58.7MB. Free memory was 35.0MB in the beginning and 33.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:51,903 INFO L158 Benchmark]: Boogie Preprocessor took 49.41ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 31.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:02:51,904 INFO L158 Benchmark]: RCFGBuilder took 255.85ms. Allocated memory is still 58.7MB. Free memory was 31.8MB in the beginning and 33.8MB in the end (delta: -2.0MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2021-08-31 02:02:51,904 INFO L158 Benchmark]: BuchiAutomizer took 8942.67ms. Allocated memory was 58.7MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 33.8MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 685.3MB. Max. memory is 16.1GB. [2021-08-31 02:02:51,905 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.15ms. Allocated memory is still 48.2MB. Free memory was 31.1MB in the beginning and 31.0MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.19ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.3MB in the beginning and 35.0MB in the end (delta: -10.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.15ms. Allocated memory is still 58.7MB. Free memory was 35.0MB in the beginning and 33.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.41ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 31.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 255.85ms. Allocated memory is still 58.7MB. Free memory was 31.8MB in the beginning and 33.8MB in the end (delta: -2.0MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8942.67ms. Allocated memory was 58.7MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 33.8MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 685.3MB. 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 84994 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:51,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...