./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 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/systemc/toy.cil.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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:39:12,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:39:12,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:39:12,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:39:12,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:39:12,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:39:12,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:39:12,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:39:12,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:39:12,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:39:12,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:39:12,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:39:12,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:39:12,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:39:12,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:39:12,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:39:12,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:39:12,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:39:12,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:39:12,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:39:12,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:39:12,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:39:12,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:39:12,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:39:12,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:39:12,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:39:12,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:39:12,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:39:12,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:39:12,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:39:12,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:39:12,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:39:12,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:39:12,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:39:12,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:39:12,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:39:12,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:39:12,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:39:12,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:39:12,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:39:12,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:39:12,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:39:12,836 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:39:12,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:39:12,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:39:12,837 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:39:12,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:39:12,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:39:12,838 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:39:12,839 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:39:12,839 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:39:12,839 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:39:12,840 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:39:12,840 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:39:12,840 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:39:12,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:39:12,840 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:39:12,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:39:12,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:39:12,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:39:12,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:39:12,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:39:12,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:39:12,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:39:12,842 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:39:12,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:39:12,842 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:39:12,842 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:39:12,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:39:12,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:39:12,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:39:12,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:39:12,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:39:12,843 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:39:12,844 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:39:12,844 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2021-12-21 22:39:13,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:39:13,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:39:13,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:39:13,101 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:39:13,101 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:39:13,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2021-12-21 22:39:13,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeabf2652/f59fbd4c656a437ca54fb56ea3757c68/FLAG6c9e0569f [2021-12-21 22:39:13,458 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:39:13,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2021-12-21 22:39:13,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeabf2652/f59fbd4c656a437ca54fb56ea3757c68/FLAG6c9e0569f [2021-12-21 22:39:13,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeabf2652/f59fbd4c656a437ca54fb56ea3757c68 [2021-12-21 22:39:13,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:39:13,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:39:13,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:39:13,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:39:13,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:39:13,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:39:13" (1/1) ... [2021-12-21 22:39:13,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745f1537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:13, skipping insertion in model container [2021-12-21 22:39:13,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:39:13" (1/1) ... [2021-12-21 22:39:13,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:39:13,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:39:14,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2021-12-21 22:39:14,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:39:14,194 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:39:14,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2021-12-21 22:39:14,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:39:14,268 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:39:14,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14 WrapperNode [2021-12-21 22:39:14,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:39:14,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:39:14,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:39:14,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:39:14,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,320 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 357 [2021-12-21 22:39:14,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:39:14,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:39:14,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:39:14,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:39:14,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:39:14,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:39:14,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:39:14,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:39:14,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (1/1) ... [2021-12-21 22:39:14,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:14,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:14,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:39:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:39:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:39:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:39:14,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:39:14,510 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:39:14,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:39:14,781 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:39:14,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:39:14,787 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-21 22:39:14,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:39:14 BoogieIcfgContainer [2021-12-21 22:39:14,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:39:14,790 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:39:14,790 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:39:14,798 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:39:14,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:39:14,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:39:13" (1/3) ... [2021-12-21 22:39:14,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2072be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:39:14, skipping insertion in model container [2021-12-21 22:39:14,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:39:14,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:39:14" (2/3) ... [2021-12-21 22:39:14,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2072be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:39:14, skipping insertion in model container [2021-12-21 22:39:14,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:39:14,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:39:14" (3/3) ... [2021-12-21 22:39:14,802 INFO L388 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2021-12-21 22:39:14,860 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:39:14,865 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:39:14,866 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:39:14,866 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:39:14,866 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:39:14,866 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:39:14,866 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:39:14,866 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:39:14,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:14,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2021-12-21 22:39:14,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:14,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:14,919 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:14,921 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] [2021-12-21 22:39:14,921 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:39:14,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:14,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2021-12-21 22:39:14,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:14,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:14,935 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:14,936 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] [2021-12-21 22:39:14,942 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 104#L408true assume !(1 == ~c_req_up~0); 89#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 127#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 125#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 63#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 120#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 42#L439-1true assume !(0 == ~e_f~0); 6#L444-1true assume !(0 == ~e_g~0); 100#L449-1true assume !(0 == ~e_e~0); 56#L454-1true assume !(0 == ~e_c~0); 109#L459-1true assume !(0 == ~e_wl~0); 24#L464-1true assume !(1 == ~wl_pc~0); 41#L476true assume !(2 == ~wl_pc~0); 23#L477true assume !(1 == ~c1_pc~0); 17#L487true assume !(1 == ~c2_pc~0); 91#L496true assume !(1 == ~wb_pc~0); 28#L505true assume !(1 == ~e_c~0); 34#L514-1true assume !(1 == ~e_e~0); 133#L519-1true assume !(1 == ~e_f~0); 38#L524-1true assume !(1 == ~e_g~0); 131#L529-1true assume !(1 == ~e_c~0); 3#L534-1true assume !(1 == ~e_wl~0); 5#L676-1true [2021-12-21 22:39:14,943 INFO L793 eck$LassoCheckResult]: Loop: 5#L676-1true assume !false; 33#L546true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 74#L381true assume !true; 126#L397true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 40#L552true assume !(1 == ~c_req_up~0); 62#L552-2true start_simulation_~kernel_st~0#1 := 3; 13#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 16#L564-2true assume !(0 == ~e_g~0); 7#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 130#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 11#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 98#L584-1true assume 1 == ~wl_pc~0; 49#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 112#L597true assume !(1 == ~c1_pc~0); 26#L607true assume !(1 == ~c2_pc~0); 102#L616true assume !(1 == ~wb_pc~0); 122#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 61#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 55#L639-1true assume !(1 == ~e_f~0); 115#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 81#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 39#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L659-1true assume 0 == ~wl_st~0; 5#L676-1true [2021-12-21 22:39:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-12-21 22:39:14,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:14,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893575658] [2021-12-21 22:39:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:14,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893575658] [2021-12-21 22:39:15,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893575658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246138015] [2021-12-21 22:39:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,129 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 672584946, now seen corresponding path program 1 times [2021-12-21 22:39:15,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350415047] [2021-12-21 22:39:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350415047] [2021-12-21 22:39:15,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350415047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:39:15,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268781551] [2021-12-21 22:39:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,160 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:15,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:15,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 22:39:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 22:39:15,188 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:15,215 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2021-12-21 22:39:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 22:39:15,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2021-12-21 22:39:15,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2021-12-21 22:39:15,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-21 22:39:15,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-21 22:39:15,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2021-12-21 22:39:15,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:39:15,239 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-21 22:39:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2021-12-21 22:39:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-21 22:39:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2021-12-21 22:39:15,268 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-21 22:39:15,268 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-21 22:39:15,268 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:39:15,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2021-12-21 22:39:15,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:15,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:15,274 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:15,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:15,275 INFO L791 eck$LassoCheckResult]: Stem: 391#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 338#L408 assume !(1 == ~c_req_up~0); 302#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 384#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 393#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 366#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 367#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 346#L439-1 assume !(0 == ~e_f~0); 273#L444-1 assume !(0 == ~e_g~0); 274#L449-1 assume !(0 == ~e_e~0); 362#L454-1 assume !(0 == ~e_c~0); 363#L459-1 assume !(0 == ~e_wl~0); 309#L464-1 assume !(1 == ~wl_pc~0); 310#L476 assume !(2 == ~wl_pc~0); 307#L477 assume !(1 == ~c1_pc~0); 295#L487 assume !(1 == ~c2_pc~0); 297#L496 assume !(1 == ~wb_pc~0); 321#L505 assume !(1 == ~e_c~0); 322#L514-1 assume !(1 == ~e_e~0); 333#L519-1 assume !(1 == ~e_f~0); 340#L524-1 assume !(1 == ~e_g~0); 341#L529-1 assume !(1 == ~e_c~0); 270#L534-1 assume !(1 == ~e_wl~0); 271#L676-1 [2021-12-21 22:39:15,278 INFO L793 eck$LassoCheckResult]: Loop: 271#L676-1 assume !false; 272#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 294#L381 assume !false; 334#L299 assume !(0 == ~wl_st~0); 335#L303 assume !(0 == ~c1_st~0); 392#L306 assume !(0 == ~c2_st~0); 386#L309 assume !(0 == ~wb_st~0); 387#L312 assume !(0 == ~r_st~0); 394#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 342#L552 assume !(1 == ~c_req_up~0); 343#L552-2 start_simulation_~kernel_st~0#1 := 3; 290#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 291#L564-2 assume !(0 == ~e_g~0); 275#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 276#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 285#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 286#L584-1 assume 1 == ~wl_pc~0; 355#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 352#L597 assume !(1 == ~c1_pc~0); 315#L607 assume !(1 == ~c2_pc~0); 316#L616 assume !(1 == ~wb_pc~0); 375#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 365#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L639-1 assume !(1 == ~e_f~0); 361#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 376#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 339#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 303#L659-1 assume 0 == ~wl_st~0; 271#L676-1 [2021-12-21 22:39:15,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-12-21 22:39:15,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131884035] [2021-12-21 22:39:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131884035] [2021-12-21 22:39:15,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131884035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237889838] [2021-12-21 22:39:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,339 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 1 times [2021-12-21 22:39:15,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377008543] [2021-12-21 22:39:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377008543] [2021-12-21 22:39:15,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377008543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273524419] [2021-12-21 22:39:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,394 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:15,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:15,395 INFO L87 Difference]: Start difference. First operand 125 states and 219 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:15,419 INFO L93 Difference]: Finished difference Result 125 states and 218 transitions. [2021-12-21 22:39:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:15,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 218 transitions. [2021-12-21 22:39:15,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 218 transitions. [2021-12-21 22:39:15,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-21 22:39:15,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-21 22:39:15,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 218 transitions. [2021-12-21 22:39:15,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:39:15,425 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-21 22:39:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 218 transitions. [2021-12-21 22:39:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-21 22:39:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.744) internal successors, (218), 124 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2021-12-21 22:39:15,435 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-21 22:39:15,435 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-21 22:39:15,435 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:39:15,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 218 transitions. [2021-12-21 22:39:15,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:15,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:15,438 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:15,438 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:15,438 INFO L791 eck$LassoCheckResult]: Stem: 648#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 594#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 595#L408 assume !(1 == ~c_req_up~0); 559#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 641#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 650#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 623#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 624#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 603#L439-1 assume !(0 == ~e_f~0); 530#L444-1 assume !(0 == ~e_g~0); 531#L449-1 assume !(0 == ~e_e~0); 619#L454-1 assume !(0 == ~e_c~0); 620#L459-1 assume !(0 == ~e_wl~0); 566#L464-1 assume !(1 == ~wl_pc~0); 567#L476 assume !(2 == ~wl_pc~0); 564#L477 assume !(1 == ~c1_pc~0); 552#L487 assume !(1 == ~c2_pc~0); 554#L496 assume !(1 == ~wb_pc~0); 578#L505 assume !(1 == ~e_c~0); 579#L514-1 assume !(1 == ~e_e~0); 590#L519-1 assume !(1 == ~e_f~0); 597#L524-1 assume !(1 == ~e_g~0); 598#L529-1 assume !(1 == ~e_c~0); 527#L534-1 assume !(1 == ~e_wl~0); 528#L676-1 [2021-12-21 22:39:15,438 INFO L793 eck$LassoCheckResult]: Loop: 528#L676-1 assume !false; 529#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 551#L381 assume !false; 591#L299 assume !(0 == ~wl_st~0); 592#L303 assume !(0 == ~c1_st~0); 649#L306 assume !(0 == ~c2_st~0); 643#L309 assume !(0 == ~wb_st~0); 644#L312 assume !(0 == ~r_st~0); 651#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 599#L552 assume !(1 == ~c_req_up~0); 600#L552-2 start_simulation_~kernel_st~0#1 := 3; 547#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 548#L564-2 assume !(0 == ~e_g~0); 532#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 533#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 542#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 543#L584-1 assume 1 == ~wl_pc~0; 612#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 609#L597 assume !(1 == ~c1_pc~0); 572#L607 assume !(1 == ~c2_pc~0); 573#L616 assume !(1 == ~wb_pc~0); 632#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 622#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 617#L639-1 assume !(1 == ~e_f~0); 618#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 634#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 596#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 560#L659-1 assume 0 == ~wl_st~0; 528#L676-1 [2021-12-21 22:39:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-12-21 22:39:15,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397782114] [2021-12-21 22:39:15,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397782114] [2021-12-21 22:39:15,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397782114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826076532] [2021-12-21 22:39:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,485 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 2 times [2021-12-21 22:39:15,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790657626] [2021-12-21 22:39:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,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-12-21 22:39:15,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790657626] [2021-12-21 22:39:15,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790657626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7299850] [2021-12-21 22:39:15,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,534 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:15,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:15,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:15,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:15,534 INFO L87 Difference]: Start difference. First operand 125 states and 218 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:15,546 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2021-12-21 22:39:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:15,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 217 transitions. [2021-12-21 22:39:15,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 217 transitions. [2021-12-21 22:39:15,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-21 22:39:15,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-21 22:39:15,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 217 transitions. [2021-12-21 22:39:15,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:39:15,551 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-21 22:39:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 217 transitions. [2021-12-21 22:39:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-21 22:39:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.736) internal successors, (217), 124 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 217 transitions. [2021-12-21 22:39:15,555 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-21 22:39:15,555 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-21 22:39:15,555 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:39:15,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 217 transitions. [2021-12-21 22:39:15,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:15,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:15,557 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:15,557 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:15,557 INFO L791 eck$LassoCheckResult]: Stem: 905#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 851#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 852#L408 assume !(1 == ~c_req_up~0); 816#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 898#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 907#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 880#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 881#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 860#L439-1 assume !(0 == ~e_f~0); 787#L444-1 assume !(0 == ~e_g~0); 788#L449-1 assume !(0 == ~e_e~0); 876#L454-1 assume !(0 == ~e_c~0); 877#L459-1 assume !(0 == ~e_wl~0); 823#L464-1 assume !(1 == ~wl_pc~0); 824#L476 assume !(2 == ~wl_pc~0); 821#L477 assume !(1 == ~c1_pc~0); 809#L487 assume !(1 == ~c2_pc~0); 811#L496 assume !(1 == ~wb_pc~0); 835#L505 assume !(1 == ~e_c~0); 836#L514-1 assume !(1 == ~e_e~0); 847#L519-1 assume !(1 == ~e_f~0); 854#L524-1 assume !(1 == ~e_g~0); 855#L529-1 assume !(1 == ~e_c~0); 784#L534-1 assume !(1 == ~e_wl~0); 785#L676-1 [2021-12-21 22:39:15,557 INFO L793 eck$LassoCheckResult]: Loop: 785#L676-1 assume !false; 786#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 808#L381 assume !false; 848#L299 assume !(0 == ~wl_st~0); 849#L303 assume !(0 == ~c1_st~0); 906#L306 assume !(0 == ~c2_st~0); 900#L309 assume !(0 == ~wb_st~0); 901#L312 assume !(0 == ~r_st~0); 908#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 856#L552 assume !(1 == ~c_req_up~0); 857#L552-2 start_simulation_~kernel_st~0#1 := 3; 804#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 805#L564-2 assume !(0 == ~e_g~0); 789#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 790#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 799#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 800#L584-1 assume !(1 == ~wl_pc~0); 864#L596 assume !(2 == ~wl_pc~0); 866#L597 assume !(1 == ~c1_pc~0); 829#L607 assume !(1 == ~c2_pc~0); 830#L616 assume !(1 == ~wb_pc~0); 889#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 879#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 874#L639-1 assume !(1 == ~e_f~0); 875#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 891#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 853#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 817#L659-1 assume 0 == ~wl_st~0; 785#L676-1 [2021-12-21 22:39:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-12-21 22:39:15,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077436093] [2021-12-21 22:39:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077436093] [2021-12-21 22:39:15,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077436093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282288731] [2021-12-21 22:39:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,601 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 1 times [2021-12-21 22:39:15,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697953000] [2021-12-21 22:39:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697953000] [2021-12-21 22:39:15,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697953000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488931297] [2021-12-21 22:39:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,625 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:15,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:15,625 INFO L87 Difference]: Start difference. First operand 125 states and 217 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:15,632 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2021-12-21 22:39:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:15,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 216 transitions. [2021-12-21 22:39:15,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 216 transitions. [2021-12-21 22:39:15,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-21 22:39:15,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-21 22:39:15,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 216 transitions. [2021-12-21 22:39:15,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:39:15,636 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-21 22:39:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 216 transitions. [2021-12-21 22:39:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-21 22:39:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.728) internal successors, (216), 124 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 216 transitions. [2021-12-21 22:39:15,639 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-21 22:39:15,639 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-21 22:39:15,639 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:39:15,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 216 transitions. [2021-12-21 22:39:15,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-21 22:39:15,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:15,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:15,641 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:15,641 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:15,641 INFO L791 eck$LassoCheckResult]: Stem: 1162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1109#L408 assume !(1 == ~c_req_up~0); 1073#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1155#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1164#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1137#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1138#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1117#L439-1 assume !(0 == ~e_f~0); 1044#L444-1 assume !(0 == ~e_g~0); 1045#L449-1 assume !(0 == ~e_e~0); 1133#L454-1 assume !(0 == ~e_c~0); 1134#L459-1 assume !(0 == ~e_wl~0); 1080#L464-1 assume !(1 == ~wl_pc~0); 1081#L476 assume !(2 == ~wl_pc~0); 1078#L477 assume !(1 == ~c1_pc~0); 1066#L487 assume !(1 == ~c2_pc~0); 1068#L496 assume !(1 == ~wb_pc~0); 1092#L505 assume !(1 == ~e_c~0); 1093#L514-1 assume !(1 == ~e_e~0); 1104#L519-1 assume !(1 == ~e_f~0); 1111#L524-1 assume !(1 == ~e_g~0); 1112#L529-1 assume !(1 == ~e_c~0); 1041#L534-1 assume !(1 == ~e_wl~0); 1042#L676-1 [2021-12-21 22:39:15,641 INFO L793 eck$LassoCheckResult]: Loop: 1042#L676-1 assume !false; 1043#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1065#L381 assume !false; 1105#L299 assume !(0 == ~wl_st~0); 1106#L303 assume !(0 == ~c1_st~0); 1163#L306 assume !(0 == ~c2_st~0); 1157#L309 assume !(0 == ~wb_st~0); 1158#L312 assume !(0 == ~r_st~0); 1165#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1113#L552 assume !(1 == ~c_req_up~0); 1114#L552-2 start_simulation_~kernel_st~0#1 := 3; 1061#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1062#L564-2 assume !(0 == ~e_g~0); 1046#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1047#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1056#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1057#L584-1 assume !(1 == ~wl_pc~0); 1121#L596 assume !(2 == ~wl_pc~0); 1123#L597 assume !(1 == ~c1_pc~0); 1086#L607 assume !(1 == ~c2_pc~0); 1087#L616 assume !(1 == ~wb_pc~0); 1146#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1136#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1131#L639-1 assume !(1 == ~e_f~0); 1132#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1148#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1110#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1074#L659-1 assume 0 == ~wl_st~0; 1042#L676-1 [2021-12-21 22:39:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-12-21 22:39:15,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753659751] [2021-12-21 22:39:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:15,650 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:15,682 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 2 times [2021-12-21 22:39:15,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181488869] [2021-12-21 22:39:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181488869] [2021-12-21 22:39:15,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181488869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485147718] [2021-12-21 22:39:15,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,722 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:15,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:15,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:15,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:15,723 INFO L87 Difference]: Start difference. First operand 125 states and 216 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:15,755 INFO L93 Difference]: Finished difference Result 159 states and 276 transitions. [2021-12-21 22:39:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:15,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 276 transitions. [2021-12-21 22:39:15,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2021-12-21 22:39:15,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 276 transitions. [2021-12-21 22:39:15,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2021-12-21 22:39:15,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2021-12-21 22:39:15,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 276 transitions. [2021-12-21 22:39:15,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:39:15,758 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-21 22:39:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 276 transitions. [2021-12-21 22:39:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-12-21 22:39:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.7358490566037736) internal successors, (276), 158 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 276 transitions. [2021-12-21 22:39:15,762 INFO L704 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-21 22:39:15,762 INFO L587 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-21 22:39:15,762 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:39:15,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 276 transitions. [2021-12-21 22:39:15,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2021-12-21 22:39:15,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:15,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:15,763 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:15,763 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:15,763 INFO L791 eck$LassoCheckResult]: Stem: 1458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1400#L408 assume !(1 == ~c_req_up~0); 1364#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1450#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1461#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1429#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1430#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1408#L439-1 assume 0 == ~e_f~0;~e_f~0 := 1; 1334#L444-1 assume !(0 == ~e_g~0); 1335#L449-1 assume !(0 == ~e_e~0); 1425#L454-1 assume !(0 == ~e_c~0); 1426#L459-1 assume !(0 == ~e_wl~0); 1371#L464-1 assume !(1 == ~wl_pc~0); 1372#L476 assume !(2 == ~wl_pc~0); 1369#L477 assume !(1 == ~c1_pc~0); 1357#L487 assume !(1 == ~c2_pc~0); 1359#L496 assume !(1 == ~wb_pc~0); 1383#L505 assume !(1 == ~e_c~0); 1384#L514-1 assume !(1 == ~e_e~0); 1395#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1402#L524-1 assume !(1 == ~e_g~0); 1403#L529-1 assume !(1 == ~e_c~0); 1331#L534-1 assume !(1 == ~e_wl~0); 1332#L676-1 [2021-12-21 22:39:15,763 INFO L793 eck$LassoCheckResult]: Loop: 1332#L676-1 assume !false; 1333#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1356#L381 assume !false; 1396#L299 assume !(0 == ~wl_st~0); 1397#L303 assume !(0 == ~c1_st~0); 1460#L306 assume !(0 == ~c2_st~0); 1452#L309 assume !(0 == ~wb_st~0); 1453#L312 assume !(0 == ~r_st~0); 1462#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1404#L552 assume !(1 == ~c_req_up~0); 1405#L552-2 start_simulation_~kernel_st~0#1 := 3; 1351#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1352#L564-2 assume !(0 == ~e_g~0); 1489#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1488#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1487#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1486#L584-1 assume 1 == ~wl_pc~0; 1484#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1482#L597 assume !(1 == ~c1_pc~0); 1442#L607 assume !(1 == ~c2_pc~0); 1436#L616 assume !(1 == ~wb_pc~0); 1479#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1428#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1423#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1424#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1443#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1401#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1365#L659-1 assume 0 == ~wl_st~0; 1332#L676-1 [2021-12-21 22:39:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1276613851, now seen corresponding path program 1 times [2021-12-21 22:39:15,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632356462] [2021-12-21 22:39:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:15,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:15,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632356462] [2021-12-21 22:39:15,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632356462] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:15,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:15,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:15,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993295075] [2021-12-21 22:39:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:15,780 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1071613489, now seen corresponding path program 1 times [2021-12-21 22:39:15,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:15,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901926676] [2021-12-21 22:39:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:15,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:15,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:15,789 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:16,028 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:39:16,029 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:39:16,029 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:39:16,029 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:39:16,029 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:39:16,029 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,032 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:39:16,032 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:39:16,032 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2021-12-21 22:39:16,032 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:39:16,032 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:39:16,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:39:16,291 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:39:16,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:16,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:16,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:16,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:16,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 22:39:16,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:16,311 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:16,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-21 22:39:16,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:16,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:16,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:16,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:16,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 22:39:16,356 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:16,356 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:16,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:16,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:16,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:16,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 22:39:16,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:16,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:16,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:16,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:16,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:16,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-21 22:39:16,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:39:16,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:16,435 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:39:16,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:16,454 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:39:16,454 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:39:16,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:39:16,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:39:16,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:39:16,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:39:16,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:39:16,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2021-12-21 22:39:16,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:39:16,454 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:39:16,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:16,668 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:39:16,671 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:39:16,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:16,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:16,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-21 22:39:16,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:16,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:16,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:16,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:16,704 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 22:39:16,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:16,706 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:39:16,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:16,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:16,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:16,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:16,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:16,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-21 22:39:16,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:16,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:16,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:16,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:16,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:16,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:16,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:16,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:16,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:39:16,769 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 22:39:16,769 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 22:39:16,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:16,772 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:16,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-21 22:39:16,788 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:39:16,789 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 22:39:16,789 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:39:16,789 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-12-21 22:39:16,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-21 22:39:16,809 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 22:39:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:16,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:39:16,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:39:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:16,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:39:16,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:39:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:16,970 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-21 22:39:16,970 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 276 transitions. cyclomatic complexity: 118 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:17,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 276 transitions. cyclomatic complexity: 118. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 500 states and 860 transitions. Complement of second has 5 states. [2021-12-21 22:39:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-21 22:39:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2021-12-21 22:39:17,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2021-12-21 22:39:17,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:17,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2021-12-21 22:39:17,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:17,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2021-12-21 22:39:17,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:17,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 860 transitions. [2021-12-21 22:39:17,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 333 [2021-12-21 22:39:17,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 500 states and 860 transitions. [2021-12-21 22:39:17,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2021-12-21 22:39:17,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2021-12-21 22:39:17,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 500 states and 860 transitions. [2021-12-21 22:39:17,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:17,029 INFO L681 BuchiCegarLoop]: Abstraction has 500 states and 860 transitions. [2021-12-21 22:39:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states and 860 transitions. [2021-12-21 22:39:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 385. [2021-12-21 22:39:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 385 states have (on average 1.7246753246753246) internal successors, (664), 384 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 664 transitions. [2021-12-21 22:39:17,037 INFO L704 BuchiCegarLoop]: Abstraction has 385 states and 664 transitions. [2021-12-21 22:39:17,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:17,038 INFO L87 Difference]: Start difference. First operand 385 states and 664 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:17,055 INFO L93 Difference]: Finished difference Result 316 states and 521 transitions. [2021-12-21 22:39:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:17,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 521 transitions. [2021-12-21 22:39:17,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2021-12-21 22:39:17,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 521 transitions. [2021-12-21 22:39:17,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2021-12-21 22:39:17,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2021-12-21 22:39:17,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 521 transitions. [2021-12-21 22:39:17,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:17,059 INFO L681 BuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2021-12-21 22:39:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 521 transitions. [2021-12-21 22:39:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-12-21 22:39:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.6487341772151898) internal successors, (521), 315 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 521 transitions. [2021-12-21 22:39:17,063 INFO L704 BuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2021-12-21 22:39:17,064 INFO L587 BuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2021-12-21 22:39:17,064 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:39:17,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 521 transitions. [2021-12-21 22:39:17,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2021-12-21 22:39:17,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:17,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:17,065 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:17,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:17,066 INFO L791 eck$LassoCheckResult]: Stem: 3100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 2991#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 2992#L408 assume !(1 == ~c_req_up~0); 2928#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3086#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3105#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3043#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3044#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3004#L439-1 assume !(0 == ~e_f~0); 2874#L444-1 assume !(0 == ~e_g~0); 2875#L449-1 assume !(0 == ~e_e~0); 3036#L454-1 assume !(0 == ~e_c~0); 3037#L459-1 assume !(0 == ~e_wl~0); 2939#L464-1 assume !(1 == ~wl_pc~0); 2940#L476 assume !(2 == ~wl_pc~0); 2937#L477 assume !(1 == ~c1_pc~0); 2918#L487 assume !(1 == ~c2_pc~0); 2920#L496 assume !(1 == ~wb_pc~0); 2960#L505 assume !(1 == ~e_c~0); 2961#L514-1 assume !(1 == ~e_e~0); 2983#L519-1 assume !(1 == ~e_f~0); 2993#L524-1 assume !(1 == ~e_g~0); 2994#L529-1 assume !(1 == ~e_c~0); 2868#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2869#L676-1 [2021-12-21 22:39:17,066 INFO L793 eck$LassoCheckResult]: Loop: 2869#L676-1 assume !false; 2871#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 3134#L381 assume !false; 3133#L299 assume !(0 == ~wl_st~0); 3132#L303 assume !(0 == ~c1_st~0); 3131#L306 assume !(0 == ~c2_st~0); 3130#L309 assume !(0 == ~wb_st~0); 3129#L312 assume !(0 == ~r_st~0); 3115#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 3113#L552 assume !(1 == ~c_req_up~0); 3112#L552-2 start_simulation_~kernel_st~0#1 := 3; 3111#L564 assume !(0 == ~e_f~0); 2916#L564-2 assume !(0 == ~e_g~0); 2917#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3110#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2896#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2897#L584-1 assume !(1 == ~wl_pc~0); 3011#L596 assume !(2 == ~wl_pc~0); 3013#L597 assume !(1 == ~c1_pc~0); 3064#L607 assume !(1 == ~c2_pc~0); 3121#L616 assume !(1 == ~wb_pc~0); 3101#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3102#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3119#L639-1 assume !(1 == ~e_f~0); 3118#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3117#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2995#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2929#L659-1 assume 0 == ~wl_st~0; 2869#L676-1 [2021-12-21 22:39:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2021-12-21 22:39:17,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:17,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50508602] [2021-12-21 22:39:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:17,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:17,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:17,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50508602] [2021-12-21 22:39:17,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50508602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:17,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:17,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:17,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339618244] [2021-12-21 22:39:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:17,086 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash 34372350, now seen corresponding path program 1 times [2021-12-21 22:39:17,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:17,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773464998] [2021-12-21 22:39:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:17,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:17,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:17,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773464998] [2021-12-21 22:39:17,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773464998] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:17,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:17,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:39:17,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27564652] [2021-12-21 22:39:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:17,098 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:17,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:39:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:39:17,099 INFO L87 Difference]: Start difference. First operand 316 states and 521 transitions. cyclomatic complexity: 208 Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:17,160 INFO L93 Difference]: Finished difference Result 597 states and 967 transitions. [2021-12-21 22:39:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:39:17,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 967 transitions. [2021-12-21 22:39:17,189 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2021-12-21 22:39:17,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 597 states and 967 transitions. [2021-12-21 22:39:17,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2021-12-21 22:39:17,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2021-12-21 22:39:17,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 597 states and 967 transitions. [2021-12-21 22:39:17,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:17,193 INFO L681 BuchiCegarLoop]: Abstraction has 597 states and 967 transitions. [2021-12-21 22:39:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states and 967 transitions. [2021-12-21 22:39:17,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2021-12-21 22:39:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 1.6218487394957983) internal successors, (965), 594 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 965 transitions. [2021-12-21 22:39:17,203 INFO L704 BuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2021-12-21 22:39:17,203 INFO L587 BuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2021-12-21 22:39:17,203 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 22:39:17,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 965 transitions. [2021-12-21 22:39:17,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2021-12-21 22:39:17,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:17,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:17,206 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:17,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:17,207 INFO L791 eck$LassoCheckResult]: Stem: 4051#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3917#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 3918#L408 assume !(1 == ~c_req_up~0); 4041#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4153#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4152#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4151#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4150#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4149#L439-1 assume !(0 == ~e_f~0); 4148#L444-1 assume !(0 == ~e_g~0); 4147#L449-1 assume !(0 == ~e_e~0); 4146#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3969#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4045#L464-1 assume !(1 == ~wl_pc~0); 4091#L476 assume !(2 == ~wl_pc~0); 4090#L477 assume !(1 == ~c1_pc~0); 3840#L487 assume !(1 == ~c2_pc~0); 3842#L496 assume !(1 == ~wb_pc~0); 3883#L505 assume !(1 == ~e_c~0); 3884#L514-1 assume !(1 == ~e_e~0); 3908#L519-1 assume !(1 == ~e_f~0); 3919#L524-1 assume !(1 == ~e_g~0); 3920#L529-1 assume !(1 == ~e_c~0); 4069#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4207#L676-1 [2021-12-21 22:39:17,207 INFO L793 eck$LassoCheckResult]: Loop: 4207#L676-1 assume !false; 4200#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 4197#L381 assume !false; 4196#L299 assume !(0 == ~wl_st~0); 4195#L303 assume !(0 == ~c1_st~0); 4194#L306 assume !(0 == ~c2_st~0); 4193#L309 assume !(0 == ~wb_st~0); 4191#L312 assume !(0 == ~r_st~0); 4190#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4188#L552 assume !(1 == ~c_req_up~0); 4187#L552-2 start_simulation_~kernel_st~0#1 := 3; 4186#L564 assume !(0 == ~e_f~0); 4185#L564-2 assume !(0 == ~e_g~0); 4184#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4182#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4183#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4248#L584-1 assume 1 == ~wl_pc~0; 4241#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4239#L597 assume !(1 == ~c1_pc~0); 4237#L607 assume !(1 == ~c2_pc~0); 4233#L616 assume !(1 == ~wb_pc~0); 4229#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4227#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4225#L639-1 assume !(1 == ~e_f~0); 4223#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4221#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4218#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4212#L659-1 assume 0 == ~wl_st~0; 4207#L676-1 [2021-12-21 22:39:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash 584245653, now seen corresponding path program 1 times [2021-12-21 22:39:17,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:17,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550729882] [2021-12-21 22:39:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:17,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:17,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:17,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550729882] [2021-12-21 22:39:17,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550729882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:17,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:17,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:39:17,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885148685] [2021-12-21 22:39:17,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:17,231 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -514887371, now seen corresponding path program 1 times [2021-12-21 22:39:17,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:17,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048205466] [2021-12-21 22:39:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:17,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:17,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:17,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:17,415 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:39:17,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:39:17,415 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:39:17,415 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:39:17,415 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:39:17,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:39:17,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:39:17,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2021-12-21 22:39:17,416 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:39:17,416 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:39:17,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,615 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:39:17,615 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:39:17,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:17,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:17,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-21 22:39:17,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:17,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:17,640 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:17,640 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:17,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:17,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:17,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:17,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-21 22:39:17,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:17,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:17,687 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:17,688 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:17,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:17,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:17,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:17,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-21 22:39:17,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:17,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:17,742 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:17,742 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:17,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:17,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:17,777 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:17,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:17,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:17,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-21 22:39:17,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:17,800 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:17,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-21 22:39:17,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:17,817 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:17,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-21 22:39:17,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:17,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:17,827 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:17,827 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:17,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:17,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:17,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:17,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-21 22:39:17,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:17,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:17,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-21 22:39:17,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:17,871 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:17,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-21 22:39:17,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:39:17,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:17,889 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:39:17,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:17,906 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:39:17,906 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:39:17,906 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:39:17,906 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:39:17,906 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:39:17,906 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:17,906 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:39:17,906 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:39:17,906 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2021-12-21 22:39:17,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:39:17,906 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:39:17,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:17,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,112 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:39:18,112 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:39:18,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:18,113 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:18,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-21 22:39:18,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:18,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:18,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:18,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:18,134 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 22:39:18,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:18,135 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:39:18,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:18,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:18,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:18,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:18,167 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:18,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-21 22:39:18,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:18,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:18,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:18,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:18,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:18,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:18,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:18,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:18,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:18,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:18,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:18,202 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:18,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-21 22:39:18,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:18,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:18,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:18,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:18,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:18,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:18,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:18,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:18,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:18,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-21 22:39:18,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:18,236 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:18,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-21 22:39:18,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:18,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:18,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:18,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:18,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:18,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:18,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:18,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:18,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:18,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:18,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:18,262 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:18,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-21 22:39:18,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:18,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:18,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:18,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:18,271 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 22:39:18,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:18,271 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:39:18,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:18,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:18,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-21 22:39:18,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:18,291 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:18,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-21 22:39:18,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:18,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:18,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:18,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:18,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:18,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:18,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:18,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:18,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:39:18,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 22:39:18,304 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 22:39:18,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:18,305 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:18,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-21 22:39:18,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:39:18,307 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 22:39:18,307 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:39:18,307 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-12-21 22:39:18,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:18,325 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 22:39:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:18,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:39:18,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:39:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:18,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:39:18,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:39:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:18,453 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-21 22:39:18,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 595 states and 965 transitions. cyclomatic complexity: 375 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 595 states and 965 transitions. cyclomatic complexity: 375. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 933 states and 1520 transitions. Complement of second has 5 states. [2021-12-21 22:39:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-21 22:39:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2021-12-21 22:39:18,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 24 letters. Loop has 28 letters. [2021-12-21 22:39:18,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:18,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 52 letters. Loop has 28 letters. [2021-12-21 22:39:18,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:18,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 24 letters. Loop has 56 letters. [2021-12-21 22:39:18,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:18,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 933 states and 1520 transitions. [2021-12-21 22:39:18,493 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 533 [2021-12-21 22:39:18,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 933 states to 933 states and 1520 transitions. [2021-12-21 22:39:18,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2021-12-21 22:39:18,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 614 [2021-12-21 22:39:18,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 933 states and 1520 transitions. [2021-12-21 22:39:18,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:18,497 INFO L681 BuchiCegarLoop]: Abstraction has 933 states and 1520 transitions. [2021-12-21 22:39:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states and 1520 transitions. [2021-12-21 22:39:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 595. [2021-12-21 22:39:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 1.6218487394957983) internal successors, (965), 594 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 965 transitions. [2021-12-21 22:39:18,506 INFO L704 BuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2021-12-21 22:39:18,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:39:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:39:18,506 INFO L87 Difference]: Start difference. First operand 595 states and 965 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:18,552 INFO L93 Difference]: Finished difference Result 1015 states and 1639 transitions. [2021-12-21 22:39:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:39:18,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1639 transitions. [2021-12-21 22:39:18,556 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 498 [2021-12-21 22:39:18,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1639 transitions. [2021-12-21 22:39:18,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2021-12-21 22:39:18,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 618 [2021-12-21 22:39:18,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1639 transitions. [2021-12-21 22:39:18,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:18,561 INFO L681 BuchiCegarLoop]: Abstraction has 1015 states and 1639 transitions. [2021-12-21 22:39:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1639 transitions. [2021-12-21 22:39:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 600. [2021-12-21 22:39:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 600 states have (on average 1.61) internal successors, (966), 599 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 966 transitions. [2021-12-21 22:39:18,569 INFO L704 BuchiCegarLoop]: Abstraction has 600 states and 966 transitions. [2021-12-21 22:39:18,569 INFO L587 BuchiCegarLoop]: Abstraction has 600 states and 966 transitions. [2021-12-21 22:39:18,569 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-21 22:39:18,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 966 transitions. [2021-12-21 22:39:18,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 319 [2021-12-21 22:39:18,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:18,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:18,572 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:18,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:18,572 INFO L791 eck$LassoCheckResult]: Stem: 7409#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 7237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 7238#L408 assume !(1 == ~c_req_up~0); 7371#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7372#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7419#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7420#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7410#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7411#L439-1 assume !(0 == ~e_f~0); 7116#L444-1 assume !(0 == ~e_g~0); 7117#L449-1 assume !(0 == ~e_e~0); 7293#L454-1 assume !(0 == ~e_c~0); 7294#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7183#L464-1 assume !(1 == ~wl_pc~0); 7184#L476 assume !(2 == ~wl_pc~0); 7446#L477 assume !(1 == ~c1_pc~0); 7444#L487 assume !(1 == ~c2_pc~0); 7442#L496 assume !(1 == ~wb_pc~0); 7440#L505 assume !(1 == ~e_c~0); 7439#L514-1 assume !(1 == ~e_e~0); 7438#L519-1 assume !(1 == ~e_f~0); 7437#L524-1 assume !(1 == ~e_g~0); 7436#L529-1 assume !(1 == ~e_c~0); 7435#L534-1 assume !(1 == ~e_wl~0); 7111#L676-1 assume !false; 7113#L546 [2021-12-21 22:39:18,572 INFO L793 eck$LassoCheckResult]: Loop: 7113#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 7327#L381 assume !false; 7328#L299 assume !(0 == ~wl_st~0); 7414#L303 assume !(0 == ~c1_st~0); 7415#L306 assume !(0 == ~c2_st~0); 7426#L309 assume !(0 == ~wb_st~0); 7429#L312 assume !(0 == ~r_st~0); 7421#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7244#L552 assume !(1 == ~c_req_up~0); 7245#L552-2 start_simulation_~kernel_st~0#1 := 3; 7148#L564 assume !(0 == ~e_f~0); 7149#L564-2 assume !(0 == ~e_g~0); 7118#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7119#L574-1 assume !(0 == ~e_c~0); 7138#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7139#L584-1 assume 1 == ~wl_pc~0; 7654#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 7652#L597 assume !(1 == ~c1_pc~0); 7650#L607 assume !(1 == ~c2_pc~0); 7648#L616 assume !(1 == ~wb_pc~0); 7646#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 7645#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7644#L639-1 assume !(1 == ~e_f~0); 7643#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7535#L649-1 assume !(1 == ~e_c~0); 7532#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7173#L659-1 assume 0 == ~wl_st~0; 7112#L676-1 assume !false; 7113#L546 [2021-12-21 22:39:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash -79370950, now seen corresponding path program 1 times [2021-12-21 22:39:18,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:18,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936862405] [2021-12-21 22:39:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:18,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:18,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936862405] [2021-12-21 22:39:18,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936862405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:18,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:18,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:39:18,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944016009] [2021-12-21 22:39:18,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:18,588 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1109190157, now seen corresponding path program 1 times [2021-12-21 22:39:18,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:18,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686786666] [2021-12-21 22:39:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:18,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:18,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:18,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686786666] [2021-12-21 22:39:18,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686786666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:18,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:18,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:18,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991334529] [2021-12-21 22:39:18,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:18,598 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:18,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:39:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:39:18,598 INFO L87 Difference]: Start difference. First operand 600 states and 966 transitions. cyclomatic complexity: 371 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:18,633 INFO L93 Difference]: Finished difference Result 1248 states and 1981 transitions. [2021-12-21 22:39:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:39:18,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1981 transitions. [2021-12-21 22:39:18,638 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 710 [2021-12-21 22:39:18,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 1248 states and 1981 transitions. [2021-12-21 22:39:18,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2021-12-21 22:39:18,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 796 [2021-12-21 22:39:18,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1248 states and 1981 transitions. [2021-12-21 22:39:18,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:18,665 INFO L681 BuchiCegarLoop]: Abstraction has 1248 states and 1981 transitions. [2021-12-21 22:39:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states and 1981 transitions. [2021-12-21 22:39:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 800. [2021-12-21 22:39:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 800 states have (on average 1.58875) internal successors, (1271), 799 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1271 transitions. [2021-12-21 22:39:18,675 INFO L704 BuchiCegarLoop]: Abstraction has 800 states and 1271 transitions. [2021-12-21 22:39:18,675 INFO L587 BuchiCegarLoop]: Abstraction has 800 states and 1271 transitions. [2021-12-21 22:39:18,675 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-21 22:39:18,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 1271 transitions. [2021-12-21 22:39:18,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 465 [2021-12-21 22:39:18,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:18,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:18,678 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:18,678 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:18,678 INFO L791 eck$LassoCheckResult]: Stem: 9244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 9092#L408 assume !(1 == ~c_req_up~0); 9209#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9210#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9257#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9156#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9157#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9245#L439-1 assume !(0 == ~e_f~0); 8974#L444-1 assume !(0 == ~e_g~0); 8975#L449-1 assume !(0 == ~e_e~0); 9145#L454-1 assume !(0 == ~e_c~0); 9146#L459-1 assume !(0 == ~e_wl~0); 9039#L464-1 assume !(1 == ~wl_pc~0); 9040#L476 assume !(2 == ~wl_pc~0); 9036#L477 assume !(1 == ~c1_pc~0); 9038#L487 assume !(1 == ~c2_pc~0); 9211#L496 assume !(1 == ~wb_pc~0); 9212#L505 assume !(1 == ~e_c~0); 9271#L514-1 assume !(1 == ~e_e~0); 9266#L519-1 assume !(1 == ~e_f~0); 9097#L524-1 assume !(1 == ~e_g~0); 9098#L529-1 assume !(1 == ~e_c~0); 9265#L534-1 assume !(1 == ~e_wl~0); 9279#L676-1 assume !false; 9280#L546 [2021-12-21 22:39:18,678 INFO L793 eck$LassoCheckResult]: Loop: 9280#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 9711#L381 assume !false; 9710#L299 assume !(0 == ~wl_st~0); 9709#L303 assume !(0 == ~c1_st~0); 9708#L306 assume !(0 == ~c2_st~0); 9707#L309 assume !(0 == ~wb_st~0); 9609#L312 assume !(0 == ~r_st~0); 9254#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 9099#L552 assume !(1 == ~c_req_up~0); 9100#L552-2 start_simulation_~kernel_st~0#1 := 3; 9004#L564 assume !(0 == ~e_f~0); 9005#L564-2 assume !(0 == ~e_g~0); 8976#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 8977#L574-1 assume !(0 == ~e_c~0); 8996#L579-1 assume !(0 == ~e_wl~0); 8997#L584-1 assume !(1 == ~wl_pc~0); 9118#L596 assume !(2 == ~wl_pc~0); 9120#L597 assume !(1 == ~c1_pc~0); 9048#L607 assume !(1 == ~c2_pc~0); 9049#L616 assume !(1 == ~wb_pc~0); 9180#L625 assume !(1 == ~e_c~0); 9246#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 9767#L639-1 assume !(1 == ~e_f~0); 9766#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9765#L649-1 assume !(1 == ~e_c~0); 9764#L654-1 assume !(1 == ~e_wl~0); 9762#L659-1 assume 0 == ~wl_st~0; 9618#L676-1 assume !false; 9280#L546 [2021-12-21 22:39:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,678 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2021-12-21 22:39:18,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:18,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096566731] [2021-12-21 22:39:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:18,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:18,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:18,689 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash -864089630, now seen corresponding path program 1 times [2021-12-21 22:39:18,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:18,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-21 22:39:18,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236859796] [2021-12-21 22:39:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:18,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:18,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:18,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236859796] [2021-12-21 22:39:18,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236859796] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:18,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:18,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:18,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40479643] [2021-12-21 22:39:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:18,705 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:39:18,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:18,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:18,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:18,705 INFO L87 Difference]: Start difference. First operand 800 states and 1271 transitions. cyclomatic complexity: 476 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:18,722 INFO L93 Difference]: Finished difference Result 1241 states and 1961 transitions. [2021-12-21 22:39:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:18,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1241 states and 1961 transitions. [2021-12-21 22:39:18,728 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2021-12-21 22:39:18,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1241 states to 1241 states and 1961 transitions. [2021-12-21 22:39:18,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2021-12-21 22:39:18,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 799 [2021-12-21 22:39:18,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1241 states and 1961 transitions. [2021-12-21 22:39:18,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:18,733 INFO L681 BuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2021-12-21 22:39:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states and 1961 transitions. [2021-12-21 22:39:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2021-12-21 22:39:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1241 states have (on average 1.5801772763900082) internal successors, (1961), 1240 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1961 transitions. [2021-12-21 22:39:18,747 INFO L704 BuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2021-12-21 22:39:18,747 INFO L587 BuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2021-12-21 22:39:18,747 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-21 22:39:18,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1241 states and 1961 transitions. [2021-12-21 22:39:18,750 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2021-12-21 22:39:18,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:18,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:18,751 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:18,751 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] [2021-12-21 22:39:18,751 INFO L791 eck$LassoCheckResult]: Stem: 11289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 11136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 11137#L408 assume !(1 == ~c_req_up~0); 11253#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11254#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11298#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11299#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11290#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11291#L439-1 assume !(0 == ~e_f~0); 11021#L444-1 assume !(0 == ~e_g~0); 11022#L449-1 assume !(0 == ~e_e~0); 11187#L454-1 assume !(0 == ~e_c~0); 11188#L459-1 assume !(0 == ~e_wl~0); 11278#L464-1 assume !(1 == ~wl_pc~0); 11320#L476 assume !(2 == ~wl_pc~0); 11319#L477 assume !(1 == ~c1_pc~0); 11069#L487 assume !(1 == ~c2_pc~0); 11071#L496 assume !(1 == ~wb_pc~0); 11105#L505 assume !(1 == ~e_c~0); 11106#L514-1 assume !(1 == ~e_e~0); 11310#L519-1 assume !(1 == ~e_f~0); 11141#L524-1 assume !(1 == ~e_g~0); 11142#L529-1 assume !(1 == ~e_c~0); 11309#L534-1 assume !(1 == ~e_wl~0); 11451#L676-1 assume !false; 11452#L546 [2021-12-21 22:39:18,751 INFO L793 eck$LassoCheckResult]: Loop: 11452#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 11815#L381 assume !false; 11813#L299 assume !(0 == ~wl_st~0); 11129#L303 assume !(0 == ~c1_st~0); 11294#L306 assume !(0 == ~c2_st~0); 11258#L309 assume !(0 == ~wb_st~0); 11259#L312 assume !(0 == ~r_st~0); 11300#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 11143#L552 assume !(1 == ~c_req_up~0); 11144#L552-2 start_simulation_~kernel_st~0#1 := 3; 11051#L564 assume !(0 == ~e_f~0); 11052#L564-2 assume !(0 == ~e_g~0); 11023#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 11024#L574-1 assume !(0 == ~e_c~0); 11043#L579-1 assume !(0 == ~e_wl~0); 11044#L584-1 assume !(1 == ~wl_pc~0); 11162#L596 assume 2 == ~wl_pc~0; 11163#L598 assume 1 == ~e_e~0;~wl_st~0 := 0; 12136#L597 assume !(1 == ~c1_pc~0); 12132#L607 assume !(1 == ~c2_pc~0); 12128#L616 assume !(1 == ~wb_pc~0); 11292#L625 assume !(1 == ~e_c~0); 11193#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 11183#L639-1 assume !(1 == ~e_f~0); 11184#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 11231#L649-1 assume !(1 == ~e_c~0); 11232#L654-1 assume !(1 == ~e_wl~0); 12078#L659-1 assume 0 == ~wl_st~0; 12075#L676-1 assume !false; 11452#L546 [2021-12-21 22:39:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2021-12-21 22:39:18,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:18,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200756057] [2021-12-21 22:39:18,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:18,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:18,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:18,762 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1766031718, now seen corresponding path program 1 times [2021-12-21 22:39:18,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:18,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486211253] [2021-12-21 22:39:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:18,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:18,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:18,768 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:18,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1128637889, now seen corresponding path program 1 times [2021-12-21 22:39:18,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:18,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367434545] [2021-12-21 22:39:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:18,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:18,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367434545] [2021-12-21 22:39:18,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367434545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:18,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:18,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:18,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260797096] [2021-12-21 22:39:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:18,920 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:39:18,920 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:39:18,920 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:39:18,920 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:39:18,920 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:39:18,920 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:18,920 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:39:18,920 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:39:18,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2021-12-21 22:39:18,920 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:39:18,920 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:39:18,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:18,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,137 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:39:19,137 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:39:19,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,138 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-21 22:39:19,141 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:19,141 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:19,162 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:19,162 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:19,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:19,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,180 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-21 22:39:19,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:19,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:19,197 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:19,197 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:19,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-21 22:39:19,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,214 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-21 22:39:19,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:19,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:19,231 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:39:19,231 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:39:19,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-21 22:39:19,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,248 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-21 22:39:19,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:39:19,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:19,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-21 22:39:19,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,273 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-21 22:39:19,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:39:19,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:39:19,292 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:39:19,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-21 22:39:19,307 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:39:19,307 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:39:19,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:39:19,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:39:19,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:39:19,308 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,308 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:39:19,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:39:19,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2021-12-21 22:39:19,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:39:19,308 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:39:19,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:39:19,511 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:39:19,511 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:39:19,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,528 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-21 22:39:19,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:19,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:19,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:19,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:19,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:19,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:19,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:19,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:19,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:19,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-21 22:39:19,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,575 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-21 22:39:19,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:19,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:19,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:19,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:19,582 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-21 22:39:19,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:19,582 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:39:19,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:19,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:19,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:19,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,608 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-21 22:39:19,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:19,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:19,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:19,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:19,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:19,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:19,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:19,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:19,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:39:19,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:19,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,648 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:39:19,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:39:19,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:39:19,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:39:19,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:39:19,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:39:19,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:39:19,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:39:19,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-21 22:39:19,679 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:39:19,680 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 22:39:19,680 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 22:39:19,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:39:19,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:39:19,682 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:39:19,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-21 22:39:19,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:39:19,683 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 22:39:19,683 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:39:19,683 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2021-12-21 22:39:19,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:19,701 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 22:39:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:19,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:39:19,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:39:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:19,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:39:19,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:39:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:19,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-21 22:39:19,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1241 states and 1961 transitions. cyclomatic complexity: 725 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:19,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1241 states and 1961 transitions. cyclomatic complexity: 725. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3166 states and 4998 transitions. Complement of second has 5 states. [2021-12-21 22:39:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-21 22:39:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2021-12-21 22:39:19,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 29 letters. [2021-12-21 22:39:19,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:19,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 54 letters. Loop has 29 letters. [2021-12-21 22:39:19,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:19,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 58 letters. [2021-12-21 22:39:19,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:39:19,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3166 states and 4998 transitions. [2021-12-21 22:39:19,910 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2021-12-21 22:39:19,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3166 states to 3166 states and 4998 transitions. [2021-12-21 22:39:19,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2021-12-21 22:39:19,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1401 [2021-12-21 22:39:19,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3166 states and 4998 transitions. [2021-12-21 22:39:19,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:19,923 INFO L681 BuchiCegarLoop]: Abstraction has 3166 states and 4998 transitions. [2021-12-21 22:39:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states and 4998 transitions. [2021-12-21 22:39:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3149. [2021-12-21 22:39:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3149 states have (on average 1.577961257542077) internal successors, (4969), 3148 states have internal predecessors, (4969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4969 transitions. [2021-12-21 22:39:19,963 INFO L704 BuchiCegarLoop]: Abstraction has 3149 states and 4969 transitions. [2021-12-21 22:39:19,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:19,963 INFO L87 Difference]: Start difference. First operand 3149 states and 4969 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:20,009 INFO L93 Difference]: Finished difference Result 3149 states and 4917 transitions. [2021-12-21 22:39:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:20,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3149 states and 4917 transitions. [2021-12-21 22:39:20,024 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2021-12-21 22:39:20,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-21 22:39:20,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3149 states to 3149 states and 4917 transitions. [2021-12-21 22:39:20,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2021-12-21 22:39:20,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1384 [2021-12-21 22:39:20,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3149 states and 4917 transitions. [2021-12-21 22:39:20,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:20,040 INFO L681 BuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2021-12-21 22:39:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states and 4917 transitions. [2021-12-21 22:39:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2021-12-21 22:39:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3149 states have (on average 1.5614480787551603) internal successors, (4917), 3148 states have internal predecessors, (4917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4917 transitions. [2021-12-21 22:39:20,084 INFO L704 BuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2021-12-21 22:39:20,084 INFO L587 BuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2021-12-21 22:39:20,084 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-21 22:39:20,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3149 states and 4917 transitions. [2021-12-21 22:39:20,093 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2021-12-21 22:39:20,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:20,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:20,093 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:20,093 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:20,093 INFO L791 eck$LassoCheckResult]: Stem: 22170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22025#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 22026#L408 assume !(1 == ~c_req_up~0); 21962#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 22191#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 22176#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 22177#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 22187#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 22186#L439-1 assume !(0 == ~e_f~0); 21911#L444-1 assume !(0 == ~e_g~0); 21912#L449-1 assume !(0 == ~e_e~0); 22076#L454-1 assume !(0 == ~e_c~0); 22077#L459-1 assume !(0 == ~e_wl~0); 22162#L464-1 assume !(1 == ~wl_pc~0); 22198#L476 assume !(2 == ~wl_pc~0); 22197#L477 assume !(1 == ~c1_pc~0); 21952#L487 assume !(1 == ~c2_pc~0); 21954#L496 assume !(1 == ~wb_pc~0); 21993#L505 assume !(1 == ~e_c~0); 21994#L514-1 assume !(1 == ~e_e~0); 22017#L519-1 assume !(1 == ~e_f~0); 22027#L524-1 assume !(1 == ~e_g~0); 22028#L529-1 assume !(1 == ~e_c~0); 21905#L534-1 assume !(1 == ~e_wl~0); 21906#L676-1 assume !false; 22616#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 22107#L381 [2021-12-21 22:39:20,093 INFO L793 eck$LassoCheckResult]: Loop: 22107#L381 assume !false; 22018#L299 assume 0 == ~wl_st~0; 21977#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 21978#L325 assume !(0 != eval_~tmp~0#1); 22108#L321 assume !(0 == ~c1_st~0); 24723#L336 assume !(0 == ~c2_st~0); 24719#L351 assume !(0 == ~wb_st~0); 24714#L366 assume !(0 == ~r_st~0); 22107#L381 [2021-12-21 22:39:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2021-12-21 22:39:20,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195134261] [2021-12-21 22:39:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1282723830, now seen corresponding path program 1 times [2021-12-21 22:39:20,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913939426] [2021-12-21 22:39:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash 363769326, now seen corresponding path program 1 times [2021-12-21 22:39:20,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423131570] [2021-12-21 22:39:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:20,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:20,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423131570] [2021-12-21 22:39:20,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423131570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:20,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:20,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:20,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607175105] [2021-12-21 22:39:20,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:20,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:20,146 INFO L87 Difference]: Start difference. First operand 3149 states and 4917 transitions. cyclomatic complexity: 1783 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-12-21 22:39:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:20,172 INFO L93 Difference]: Finished difference Result 4634 states and 7109 transitions. [2021-12-21 22:39:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:20,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4634 states and 7109 transitions. [2021-12-21 22:39:20,187 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1978 [2021-12-21 22:39:20,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4634 states to 4634 states and 7109 transitions. [2021-12-21 22:39:20,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2042 [2021-12-21 22:39:20,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2042 [2021-12-21 22:39:20,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4634 states and 7109 transitions. [2021-12-21 22:39:20,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:20,205 INFO L681 BuchiCegarLoop]: Abstraction has 4634 states and 7109 transitions. [2021-12-21 22:39:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states and 7109 transitions. [2021-12-21 22:39:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4616. [2021-12-21 22:39:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4616 states, 4616 states have (on average 1.5361785095320624) internal successors, (7091), 4615 states have internal predecessors, (7091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 7091 transitions. [2021-12-21 22:39:20,256 INFO L704 BuchiCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2021-12-21 22:39:20,256 INFO L587 BuchiCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2021-12-21 22:39:20,256 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-21 22:39:20,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4616 states and 7091 transitions. [2021-12-21 22:39:20,285 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1970 [2021-12-21 22:39:20,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:20,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:20,286 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:20,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:20,286 INFO L791 eck$LassoCheckResult]: Stem: 29972#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 29819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 29820#L408 assume !(1 == ~c_req_up~0); 29751#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 29997#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 29979#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 29980#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 29994#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 29993#L439-1 assume !(0 == ~e_f~0); 29702#L444-1 assume !(0 == ~e_g~0); 29703#L449-1 assume !(0 == ~e_e~0); 29870#L454-1 assume !(0 == ~e_c~0); 29871#L459-1 assume !(0 == ~e_wl~0); 29962#L464-1 assume !(1 == ~wl_pc~0); 30004#L476 assume !(2 == ~wl_pc~0); 30003#L477 assume !(1 == ~c1_pc~0); 29741#L487 assume !(1 == ~c2_pc~0); 29743#L496 assume !(1 == ~wb_pc~0); 29782#L505 assume !(1 == ~e_c~0); 29783#L514-1 assume !(1 == ~e_e~0); 29809#L519-1 assume !(1 == ~e_f~0); 29821#L524-1 assume !(1 == ~e_g~0); 29822#L529-1 assume !(1 == ~e_c~0); 29991#L534-1 assume !(1 == ~e_wl~0); 32259#L676-1 assume !false; 32251#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 32249#L381 [2021-12-21 22:39:20,286 INFO L793 eck$LassoCheckResult]: Loop: 32249#L381 assume !false; 31538#L299 assume 0 == ~wl_st~0; 31539#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 31512#L325 assume !(0 != eval_~tmp~0#1); 31513#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 31619#L340 assume !(0 != eval_~tmp___0~0#1); 31621#L336 assume !(0 == ~c2_st~0); 31612#L351 assume !(0 == ~wb_st~0); 31609#L366 assume !(0 == ~r_st~0); 32249#L381 [2021-12-21 22:39:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2021-12-21 22:39:20,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308945425] [2021-12-21 22:39:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,295 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 1 times [2021-12-21 22:39:20,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598447271] [2021-12-21 22:39:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,298 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1659779318, now seen corresponding path program 1 times [2021-12-21 22:39:20,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178900268] [2021-12-21 22:39:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:20,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:20,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178900268] [2021-12-21 22:39:20,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178900268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:20,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:20,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:20,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697230965] [2021-12-21 22:39:20,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:20,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:20,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:20,337 INFO L87 Difference]: Start difference. First operand 4616 states and 7091 transitions. cyclomatic complexity: 2490 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:20,384 INFO L93 Difference]: Finished difference Result 7194 states and 10846 transitions. [2021-12-21 22:39:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:20,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7194 states and 10846 transitions. [2021-12-21 22:39:20,410 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3096 [2021-12-21 22:39:20,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7194 states to 7194 states and 10846 transitions. [2021-12-21 22:39:20,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3210 [2021-12-21 22:39:20,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3210 [2021-12-21 22:39:20,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7194 states and 10846 transitions. [2021-12-21 22:39:20,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:20,446 INFO L681 BuchiCegarLoop]: Abstraction has 7194 states and 10846 transitions. [2021-12-21 22:39:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states and 10846 transitions. [2021-12-21 22:39:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 7158. [2021-12-21 22:39:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7158 states, 7158 states have (on average 1.5101983794355964) internal successors, (10810), 7157 states have internal predecessors, (10810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 10810 transitions. [2021-12-21 22:39:20,540 INFO L704 BuchiCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2021-12-21 22:39:20,540 INFO L587 BuchiCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2021-12-21 22:39:20,541 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-21 22:39:20,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7158 states and 10810 transitions. [2021-12-21 22:39:20,558 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2021-12-21 22:39:20,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:20,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:20,558 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:20,559 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:20,559 INFO L791 eck$LassoCheckResult]: Stem: 41811#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 41642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 41643#L408 assume !(1 == ~c_req_up~0); 41572#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 41824#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 41825#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 41851#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 41846#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 41847#L439-1 assume !(0 == ~e_f~0); 41520#L444-1 assume !(0 == ~e_g~0); 41521#L449-1 assume !(0 == ~e_e~0); 41698#L454-1 assume !(0 == ~e_c~0); 41699#L459-1 assume !(0 == ~e_wl~0); 41874#L464-1 assume !(1 == ~wl_pc~0); 41873#L476 assume !(2 == ~wl_pc~0); 41868#L477 assume !(1 == ~c1_pc~0); 41867#L487 assume !(1 == ~c2_pc~0); 41860#L496 assume !(1 == ~wb_pc~0); 41859#L505 assume !(1 == ~e_c~0); 41631#L514-1 assume !(1 == ~e_e~0); 41632#L519-1 assume !(1 == ~e_f~0); 41644#L524-1 assume !(1 == ~e_g~0); 41645#L529-1 assume !(1 == ~e_c~0); 42624#L534-1 assume !(1 == ~e_wl~0); 44178#L676-1 assume !false; 44179#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 45904#L381 [2021-12-21 22:39:20,559 INFO L793 eck$LassoCheckResult]: Loop: 45904#L381 assume !false; 47756#L299 assume 0 == ~wl_st~0; 47755#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 47754#L325 assume !(0 != eval_~tmp~0#1); 47753#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 47737#L340 assume !(0 != eval_~tmp___0~0#1); 47752#L336 assume !(0 == ~c2_st~0); 47767#L351 assume !(0 == ~wb_st~0); 47759#L366 assume !(0 == ~r_st~0); 45904#L381 [2021-12-21 22:39:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2021-12-21 22:39:20,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050919130] [2021-12-21 22:39:20,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:20,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:20,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050919130] [2021-12-21 22:39:20,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050919130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:20,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:20,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:20,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047864916] [2021-12-21 22:39:20,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:20,579 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:39:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 2 times [2021-12-21 22:39:20,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38434899] [2021-12-21 22:39:20,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,615 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:20,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:20,643 INFO L87 Difference]: Start difference. First operand 7158 states and 10810 transitions. cyclomatic complexity: 3667 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:20,668 INFO L93 Difference]: Finished difference Result 7106 states and 10723 transitions. [2021-12-21 22:39:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:20,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7106 states and 10723 transitions. [2021-12-21 22:39:20,695 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2021-12-21 22:39:20,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7106 states to 7106 states and 10723 transitions. [2021-12-21 22:39:20,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3144 [2021-12-21 22:39:20,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3144 [2021-12-21 22:39:20,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7106 states and 10723 transitions. [2021-12-21 22:39:20,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:20,722 INFO L681 BuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2021-12-21 22:39:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states and 10723 transitions. [2021-12-21 22:39:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 7106. [2021-12-21 22:39:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7106 states, 7106 states have (on average 1.5090064734027582) internal successors, (10723), 7105 states have internal predecessors, (10723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 10723 transitions. [2021-12-21 22:39:20,805 INFO L704 BuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2021-12-21 22:39:20,805 INFO L587 BuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2021-12-21 22:39:20,805 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-21 22:39:20,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7106 states and 10723 transitions. [2021-12-21 22:39:20,820 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2021-12-21 22:39:20,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:20,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:20,820 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:20,820 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:20,821 INFO L791 eck$LassoCheckResult]: Stem: 56063#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 55907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 55908#L408 assume !(1 == ~c_req_up~0); 56029#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 56030#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 56073#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 55971#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 55972#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 56064#L439-1 assume !(0 == ~e_f~0); 55790#L444-1 assume !(0 == ~e_g~0); 55791#L449-1 assume !(0 == ~e_e~0); 55958#L454-1 assume !(0 == ~e_c~0); 55959#L459-1 assume !(0 == ~e_wl~0); 55854#L464-1 assume !(1 == ~wl_pc~0); 55855#L476 assume !(2 == ~wl_pc~0); 55851#L477 assume !(1 == ~c1_pc~0); 55853#L487 assume !(1 == ~c2_pc~0); 56031#L496 assume !(1 == ~wb_pc~0); 56032#L505 assume !(1 == ~e_c~0); 56086#L514-1 assume !(1 == ~e_e~0); 56080#L519-1 assume !(1 == ~e_f~0); 55911#L524-1 assume !(1 == ~e_g~0); 55912#L529-1 assume !(1 == ~e_c~0); 55784#L534-1 assume !(1 == ~e_wl~0); 55785#L676-1 assume !false; 58393#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 58394#L381 [2021-12-21 22:39:20,821 INFO L793 eck$LassoCheckResult]: Loop: 58394#L381 assume !false; 62766#L299 assume 0 == ~wl_st~0; 62765#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 58651#L325 assume !(0 != eval_~tmp~0#1); 58562#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 58560#L340 assume !(0 != eval_~tmp___0~0#1); 58559#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 58538#L355 assume !(0 != eval_~tmp___1~0#1); 62077#L351 assume !(0 == ~wb_st~0); 62073#L366 assume !(0 == ~r_st~0); 58394#L381 [2021-12-21 22:39:20,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2021-12-21 22:39:20,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39242727] [2021-12-21 22:39:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,830 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1563186686, now seen corresponding path program 1 times [2021-12-21 22:39:20,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065259873] [2021-12-21 22:39:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:20,852 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:20,852 INFO L85 PathProgramCache]: Analyzing trace with hash 84797946, now seen corresponding path program 1 times [2021-12-21 22:39:20,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:20,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516496075] [2021-12-21 22:39:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:20,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:39:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:39:20,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:39:20,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516496075] [2021-12-21 22:39:20,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516496075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:39:20,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:39:20,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:39:20,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238533332] [2021-12-21 22:39:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:39:20,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:39:20,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:39:20,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:39:20,902 INFO L87 Difference]: Start difference. First operand 7106 states and 10723 transitions. cyclomatic complexity: 3632 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:39:20,957 INFO L93 Difference]: Finished difference Result 12263 states and 18336 transitions. [2021-12-21 22:39:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:39:20,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12263 states and 18336 transitions. [2021-12-21 22:39:20,998 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2021-12-21 22:39:21,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12263 states to 12263 states and 18336 transitions. [2021-12-21 22:39:21,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5422 [2021-12-21 22:39:21,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5422 [2021-12-21 22:39:21,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12263 states and 18336 transitions. [2021-12-21 22:39:21,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:39:21,048 INFO L681 BuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2021-12-21 22:39:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12263 states and 18336 transitions. [2021-12-21 22:39:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12263 to 12263. [2021-12-21 22:39:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12263 states, 12263 states have (on average 1.4952295523118324) internal successors, (18336), 12262 states have internal predecessors, (18336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:39:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12263 states to 12263 states and 18336 transitions. [2021-12-21 22:39:21,285 INFO L704 BuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2021-12-21 22:39:21,285 INFO L587 BuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2021-12-21 22:39:21,285 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-21 22:39:21,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12263 states and 18336 transitions. [2021-12-21 22:39:21,318 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2021-12-21 22:39:21,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:39:21,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:39:21,321 INFO L842 BuchiCegarLoop]: Counterexample stem 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] [2021-12-21 22:39:21,322 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:39:21,322 INFO L791 eck$LassoCheckResult]: Stem: 75469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 75287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 75288#L408 assume !(1 == ~c_req_up~0); 75426#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 75427#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 75481#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 75354#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 75355#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 75470#L439-1 assume !(0 == ~e_f~0); 75167#L444-1 assume !(0 == ~e_g~0); 75168#L449-1 assume !(0 == ~e_e~0); 75343#L454-1 assume !(0 == ~e_c~0); 75344#L459-1 assume !(0 == ~e_wl~0); 75230#L464-1 assume !(1 == ~wl_pc~0); 75231#L476 assume !(2 == ~wl_pc~0); 75227#L477 assume !(1 == ~c1_pc~0); 75229#L487 assume !(1 == ~c2_pc~0); 75428#L496 assume !(1 == ~wb_pc~0); 75429#L505 assume !(1 == ~e_c~0); 75500#L514-1 assume !(1 == ~e_e~0); 75494#L519-1 assume !(1 == ~e_f~0); 75291#L524-1 assume !(1 == ~e_g~0); 75292#L529-1 assume !(1 == ~e_c~0); 75161#L534-1 assume !(1 == ~e_wl~0); 75162#L676-1 assume !false; 77744#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 78410#L381 [2021-12-21 22:39:21,322 INFO L793 eck$LassoCheckResult]: Loop: 78410#L381 assume !false; 83897#L299 assume 0 == ~wl_st~0; 83896#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 78394#L325 assume !(0 != eval_~tmp~0#1); 78395#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 83908#L340 assume !(0 != eval_~tmp___0~0#1); 83907#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 83904#L355 assume !(0 != eval_~tmp___1~0#1); 83903#L351 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 83901#L370 assume !(0 != eval_~tmp___2~0#1); 83898#L366 assume !(0 == ~r_st~0); 78410#L381 [2021-12-21 22:39:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2021-12-21 22:39:21,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:21,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033850595] [2021-12-21 22:39:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:21,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:21,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:21,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1214182410, now seen corresponding path program 1 times [2021-12-21 22:39:21,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:21,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913054225] [2021-12-21 22:39:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:21,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:21,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:21,336 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:39:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1666266370, now seen corresponding path program 1 times [2021-12-21 22:39:21,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:39:21,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880062929] [2021-12-21 22:39:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:39:21,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:39:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:21,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:39:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:39:21,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:39:22,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.12 10:39:22 BoogieIcfgContainer [2021-12-21 22:39:22,102 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-21 22:39:22,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 22:39:22,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 22:39:22,103 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 22:39:22,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:39:14" (3/4) ... [2021-12-21 22:39:22,105 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-21 22:39:22,141 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 22:39:22,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 22:39:22,141 INFO L158 Benchmark]: Toolchain (without parser) took 8235.81ms. Allocated memory was 96.5MB in the beginning and 249.6MB in the end (delta: 153.1MB). Free memory was 61.4MB in the beginning and 93.6MB in the end (delta: -32.3MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2021-12-21 22:39:22,141 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:39:22,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.27ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 68.3MB in the end (delta: -7.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2021-12-21 22:39:22,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.09ms. Allocated memory is still 96.5MB. Free memory was 68.3MB in the beginning and 66.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:39:22,142 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:39:22,142 INFO L158 Benchmark]: RCFGBuilder took 423.13ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 64.0MB in the beginning and 101.6MB in the end (delta: -37.7MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2021-12-21 22:39:22,142 INFO L158 Benchmark]: BuchiAutomizer took 7312.64ms. Allocated memory was 127.9MB in the beginning and 249.6MB in the end (delta: 121.6MB). Free memory was 101.6MB in the beginning and 96.7MB in the end (delta: 4.9MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. [2021-12-21 22:39:22,142 INFO L158 Benchmark]: Witness Printer took 38.13ms. Allocated memory is still 249.6MB. Free memory was 96.7MB in the beginning and 93.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:39:22,143 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 96.5MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.27ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 68.3MB in the end (delta: -7.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.09ms. Allocated memory is still 96.5MB. Free memory was 68.3MB in the beginning and 66.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.13ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 64.0MB in the beginning and 101.6MB in the end (delta: -37.7MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7312.64ms. Allocated memory was 127.9MB in the beginning and 249.6MB in the end (delta: 121.6MB). Free memory was 101.6MB in the beginning and 96.7MB in the end (delta: 4.9MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. * Witness Printer took 38.13ms. Allocated memory is still 249.6MB. Free memory was 96.7MB in the beginning and 93.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (15 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 12263 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 13. Automata minimization 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1389 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 12263 states and ocurred in iteration 15. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3826 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3823 mSDsluCounter, 7046 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2603 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 305 IncrementalHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 4443 mSDtfsCounter, 305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p_out=0, wb_st=0, NULL=0, processed=0, tmp___3=0, __retres1=0, NULL=1, tmp___2=0, c2_st=0, wl_pc=0, e_wl=2, e_c=2, e_e=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27f2c378=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@551fa9fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@651bed56=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25108fa5=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63e0d84=0, wb_i=1, tmp___1=0, c_req_up=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, c1_i=1, c2_pc=0, c2_i=1, tmp=0, tmp___0=0, \result=0, r_i=0, d=0, e_f=2, e_g=2, NULL=0, kernel_st=1, r_st=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 [L408] COND FALSE !((int )c_req_up == 1) [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 [L444] COND FALSE !((int )e_f == 0) [L449] COND FALSE !((int )e_g == 0) [L454] COND FALSE !((int )e_e == 0) [L459] COND FALSE !((int )e_c == 0) [L464] COND FALSE !((int )e_wl == 0) [L469] COND FALSE !((int )wl_pc == 1) [L477] COND FALSE !((int )wl_pc == 2) [L487] COND FALSE !((int )c1_pc == 1) [L496] COND FALSE !((int )c2_pc == 1) [L505] COND FALSE !((int )wb_pc == 1) [L514] COND FALSE !((int )e_c == 1) [L519] COND FALSE !((int )e_e == 1) [L524] COND FALSE !((int )e_f == 1) [L529] COND FALSE !((int )e_g == 1) [L534] COND FALSE !((int )e_c == 1) [L539] COND FALSE !((int )e_wl == 1) [L545] COND TRUE 1 [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-21 22:39:22,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)