./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-16 10:05:32,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 10:05:32,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 10:05:32,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 10:05:32,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 10:05:32,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 10:05:32,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 10:05:32,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 10:05:32,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 10:05:32,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 10:05:32,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 10:05:32,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 10:05:32,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 10:05:32,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 10:05:32,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 10:05:32,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 10:05:32,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 10:05:32,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 10:05:32,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 10:05:32,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 10:05:32,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 10:05:32,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 10:05:32,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 10:05:32,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 10:05:32,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 10:05:32,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 10:05:32,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 10:05:32,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 10:05:32,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 10:05:32,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 10:05:32,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 10:05:32,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 10:05:32,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 10:05:32,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 10:05:32,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 10:05:32,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 10:05:32,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 10:05:32,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 10:05:32,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 10:05:32,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 10:05:32,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 10:05:32,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 10:05:32,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 10:05:32,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 10:05:32,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 10:05:32,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 10:05:32,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 10:05:32,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 10:05:32,769 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 10:05:32,769 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 10:05:32,769 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 10:05:32,769 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 10:05:32,770 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 10:05:32,770 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 10:05:32,770 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 10:05:32,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 10:05:32,771 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 10:05:32,771 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 10:05:32,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 10:05:32,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 10:05:32,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 10:05:32,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 10:05:32,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 10:05:32,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 10:05:32,772 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 10:05:32,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 10:05:32,772 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 10:05:32,772 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 10:05:32,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 10:05:32,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 10:05:32,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 10:05:32,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 10:05:32,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 10:05:32,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 10:05:32,774 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 10:05:32,774 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-16 10:05:32,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 10:05:33,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 10:05:33,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 10:05:33,003 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 10:05:33,004 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 10:05:33,005 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-16 10:05:33,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7bf4382/c0a03848a4614cb4ab22532c61f2f8e9/FLAG2e1ce7aeb [2021-12-16 10:05:33,419 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 10:05:33,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2021-12-16 10:05:33,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7bf4382/c0a03848a4614cb4ab22532c61f2f8e9/FLAG2e1ce7aeb [2021-12-16 10:05:33,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7bf4382/c0a03848a4614cb4ab22532c61f2f8e9 [2021-12-16 10:05:33,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 10:05:33,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 10:05:33,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 10:05:33,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 10:05:33,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 10:05:33,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e63954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33, skipping insertion in model container [2021-12-16 10:05:33,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 10:05:33,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 10:05:33,626 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-16 10:05:33,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:05:33,707 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 10:05:33,721 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-16 10:05:33,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:05:33,779 INFO L208 MainTranslator]: Completed translation [2021-12-16 10:05:33,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33 WrapperNode [2021-12-16 10:05:33,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 10:05:33,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 10:05:33,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 10:05:33,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 10:05:33,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,839 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 357 [2021-12-16 10:05:33,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 10:05:33,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 10:05:33,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 10:05:33,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 10:05:33,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 10:05:33,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 10:05:33,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 10:05:33,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 10:05:33,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (1/1) ... [2021-12-16 10:05:33,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:33,906 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-16 10:05:33,929 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-16 10:05:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 10:05:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 10:05:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 10:05:33,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 10:05:34,020 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 10:05:34,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 10:05:34,314 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 10:05:34,319 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 10:05:34,320 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-16 10:05:34,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:05:34 BoogieIcfgContainer [2021-12-16 10:05:34,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 10:05:34,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 10:05:34,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 10:05:34,325 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 10:05:34,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:05:34,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 10:05:33" (1/3) ... [2021-12-16 10:05:34,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@246185a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:05:34, skipping insertion in model container [2021-12-16 10:05:34,327 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:05:34,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:05:33" (2/3) ... [2021-12-16 10:05:34,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@246185a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:05:34, skipping insertion in model container [2021-12-16 10:05:34,328 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:05:34,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:05:34" (3/3) ... [2021-12-16 10:05:34,329 INFO L388 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2021-12-16 10:05:34,361 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 10:05:34,361 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 10:05:34,361 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 10:05:34,362 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 10:05:34,362 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 10:05:34,362 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 10:05:34,362 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 10:05:34,362 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 10:05:34,374 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-16 10:05:34,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2021-12-16 10:05:34,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:34,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:34,401 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-16 10:05:34,402 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-16 10:05:34,402 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 10:05:34,402 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-16 10:05:34,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2021-12-16 10:05:34,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:34,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:34,408 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-16 10:05:34,408 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-16 10:05:34,413 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-16 10:05:34,414 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-16 10:05:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-12-16 10:05:34,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746541241] [2021-12-16 10:05:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,568 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-16 10:05:34,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746541241] [2021-12-16 10:05:34,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746541241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:34,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670676286] [2021-12-16 10:05:34,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,573 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 672584946, now seen corresponding path program 1 times [2021-12-16 10:05:34,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516783512] [2021-12-16 10:05:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,585 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-16 10:05:34,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516783512] [2021-12-16 10:05:34,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516783512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 10:05:34,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141081627] [2021-12-16 10:05:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,587 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:34,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:34,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 10:05:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 10:05:34,611 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-16 10:05:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:34,622 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2021-12-16 10:05:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 10:05:34,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2021-12-16 10:05:34,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2021-12-16 10:05:34,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-16 10:05:34,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-16 10:05:34,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2021-12-16 10:05:34,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:05:34,634 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-16 10:05:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2021-12-16 10:05:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-16 10:05:34,654 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-16 10:05:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2021-12-16 10:05:34,656 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-16 10:05:34,656 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-16 10:05:34,656 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 10:05:34,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2021-12-16 10:05:34,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:34,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:34,658 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-16 10:05:34,659 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-16 10:05:34,659 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-16 10:05:34,659 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-16 10:05:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-12-16 10:05:34,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833245929] [2021-12-16 10:05:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,689 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-16 10:05:34,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833245929] [2021-12-16 10:05:34,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833245929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:34,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868348898] [2021-12-16 10:05:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,691 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 1 times [2021-12-16 10:05:34,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213521415] [2021-12-16 10:05:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,716 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-16 10:05:34,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213521415] [2021-12-16 10:05:34,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213521415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:34,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006704525] [2021-12-16 10:05:34,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,718 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:34,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:34,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:34,719 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-16 10:05:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:34,745 INFO L93 Difference]: Finished difference Result 125 states and 218 transitions. [2021-12-16 10:05:34,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:34,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 218 transitions. [2021-12-16 10:05:34,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 218 transitions. [2021-12-16 10:05:34,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-16 10:05:34,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-16 10:05:34,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 218 transitions. [2021-12-16 10:05:34,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:05:34,750 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-16 10:05:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 218 transitions. [2021-12-16 10:05:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-16 10:05:34,754 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-16 10:05:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2021-12-16 10:05:34,755 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-16 10:05:34,755 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-16 10:05:34,755 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 10:05:34,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 218 transitions. [2021-12-16 10:05:34,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:34,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:34,757 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-16 10:05:34,757 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-16 10:05:34,757 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-16 10:05:34,757 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-16 10:05:34,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-12-16 10:05:34,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730672737] [2021-12-16 10:05:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,783 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-16 10:05:34,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730672737] [2021-12-16 10:05:34,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730672737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:34,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385871062] [2021-12-16 10:05:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,785 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 2 times [2021-12-16 10:05:34,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058028307] [2021-12-16 10:05:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,806 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-16 10:05:34,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058028307] [2021-12-16 10:05:34,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058028307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:34,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500019612] [2021-12-16 10:05:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,808 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:34,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:34,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:34,809 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-16 10:05:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:34,817 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2021-12-16 10:05:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:34,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 217 transitions. [2021-12-16 10:05:34,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 217 transitions. [2021-12-16 10:05:34,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-16 10:05:34,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-16 10:05:34,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 217 transitions. [2021-12-16 10:05:34,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:05:34,822 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-16 10:05:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 217 transitions. [2021-12-16 10:05:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-16 10:05:34,825 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-16 10:05:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 217 transitions. [2021-12-16 10:05:34,826 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-16 10:05:34,826 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-16 10:05:34,826 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 10:05:34,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 217 transitions. [2021-12-16 10:05:34,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:34,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:34,828 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-16 10:05:34,828 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-16 10:05:34,829 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-16 10:05:34,829 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-16 10:05:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-12-16 10:05:34,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567678156] [2021-12-16 10:05:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,872 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-16 10:05:34,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567678156] [2021-12-16 10:05:34,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567678156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:34,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135699931] [2021-12-16 10:05:34,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,873 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 1 times [2021-12-16 10:05:34,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882236771] [2021-12-16 10:05:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:34,911 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-16 10:05:34,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:34,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882236771] [2021-12-16 10:05:34,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882236771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:34,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:34,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:34,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230669366] [2021-12-16 10:05:34,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:34,913 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:34,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:34,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:34,915 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-16 10:05:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:34,933 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2021-12-16 10:05:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:34,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 216 transitions. [2021-12-16 10:05:34,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 216 transitions. [2021-12-16 10:05:34,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-16 10:05:34,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-16 10:05:34,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 216 transitions. [2021-12-16 10:05:34,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:05:34,939 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-16 10:05:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 216 transitions. [2021-12-16 10:05:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-16 10:05:34,947 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-16 10:05:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 216 transitions. [2021-12-16 10:05:34,959 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-16 10:05:34,959 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-16 10:05:34,959 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 10:05:34,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 216 transitions. [2021-12-16 10:05:34,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:05:34,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:34,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:34,961 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-16 10:05:34,961 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-16 10:05:34,961 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-16 10:05:34,961 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-16 10:05:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-12-16 10:05:34,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614756139] [2021-12-16 10:05:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:34,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:34,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:35,018 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 2 times [2021-12-16 10:05:35,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:35,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228138323] [2021-12-16 10:05:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:35,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:35,069 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-16 10:05:35,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:35,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228138323] [2021-12-16 10:05:35,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228138323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:35,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:35,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:35,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582027550] [2021-12-16 10:05:35,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:35,070 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:35,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:35,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:35,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:35,071 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-16 10:05:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:35,117 INFO L93 Difference]: Finished difference Result 159 states and 276 transitions. [2021-12-16 10:05:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:35,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 276 transitions. [2021-12-16 10:05:35,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2021-12-16 10:05:35,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 276 transitions. [2021-12-16 10:05:35,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2021-12-16 10:05:35,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2021-12-16 10:05:35,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 276 transitions. [2021-12-16 10:05:35,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:05:35,126 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-16 10:05:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 276 transitions. [2021-12-16 10:05:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-12-16 10:05:35,139 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-16 10:05:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 276 transitions. [2021-12-16 10:05:35,140 INFO L704 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-16 10:05:35,140 INFO L587 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-16 10:05:35,140 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 10:05:35,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 276 transitions. [2021-12-16 10:05:35,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2021-12-16 10:05:35,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:35,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:35,142 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-16 10:05:35,142 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-16 10:05:35,142 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-16 10:05:35,142 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-16 10:05:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1276613851, now seen corresponding path program 1 times [2021-12-16 10:05:35,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:35,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729514287] [2021-12-16 10:05:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:35,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:35,179 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-16 10:05:35,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:35,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729514287] [2021-12-16 10:05:35,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729514287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:35,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:35,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:35,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292806400] [2021-12-16 10:05:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:35,181 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:35,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1071613489, now seen corresponding path program 1 times [2021-12-16 10:05:35,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:35,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087666139] [2021-12-16 10:05:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:35,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:35,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:35,197 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:35,513 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:05:35,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:05:35,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:05:35,514 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:05:35,514 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 10:05:35,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:35,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:05:35,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:05:35,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2021-12-16 10:05:35,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:05:35,514 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:05:35,525 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-16 10:05:35,529 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-16 10:05:35,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,551 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-16 10:05:35,553 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-16 10:05:35,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,572 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-16 10:05:35,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,577 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-16 10:05:35,579 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-16 10:05:35,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:35,585 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-16 10:05:35,588 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-16 10:05:35,590 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-16 10:05:35,592 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-16 10:05:35,595 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-16 10:05:35,781 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:05:35,782 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 10:05:35,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:35,784 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-16 10:05:35,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:35,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:35,794 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-16 10:05:35,799 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:35,799 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-16 10:05:35,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-16 10:05:35,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:35,817 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-16 10:05:35,818 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-16 10:05:35,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:35,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:35,840 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:35,840 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=4} Honda state: {~c2_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 10:05:35,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-16 10:05:35,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:35,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:35,859 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-16 10:05:35,860 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-16 10:05:35,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:35,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:35,885 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-16 10:05:35,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:35,887 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-16 10:05:35,888 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-16 10:05:35,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 10:05:35,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:35,907 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 10:05:35,939 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-16 10:05:35,939 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:05:35,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:05:35,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:05:35,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:05:35,940 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:05:35,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:35,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:05:35,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:05:35,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2021-12-16 10:05:35,940 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:05:35,940 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:05:35,942 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-16 10:05:35,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-16 10:05:35,949 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-16 10:05:35,951 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-16 10:05:35,953 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-16 10:05:35,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-16 10:05:35,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-16 10:05:35,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-16 10:05:35,962 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-16 10:05:35,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-16 10:05:35,966 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-16 10:05:35,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-16 10:05:35,969 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-16 10:05:35,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-16 10:05:35,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-16 10:05:35,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-16 10:05:35,979 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-16 10:05:35,983 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-16 10:05:35,985 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-16 10:05:35,989 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-16 10:05:35,990 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-16 10:05:35,992 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-16 10:05:35,996 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-16 10:05:35,998 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-16 10:05:36,001 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-16 10:05:36,010 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-16 10:05:36,148 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:05:36,152 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:05:36,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:36,155 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-16 10:05:36,174 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-16 10:05:36,174 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-16 10:05:36,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:36,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:36,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:36,181 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 10:05:36,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:36,183 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 10:05:36,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:36,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:36,214 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-16 10:05:36,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:36,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:36,216 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-16 10:05:36,217 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-16 10:05:36,219 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-16 10:05:36,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:36,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:36,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:36,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:36,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:36,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:36,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:36,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:05:36,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 10:05:36,246 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 10:05:36,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:36,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:36,248 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-16 10:05:36,249 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-16 10:05:36,250 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:05:36,250 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 10:05:36,251 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:05:36,251 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-12-16 10:05:36,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-16 10:05:36,276 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 10:05:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:36,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-12-16 10:05:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:36,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:05:36,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:05:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:36,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 10:05:36,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:05:36,551 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-16 10:05:36,555 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-16 10:05:36,556 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-16 10:05:36,620 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-16 10:05:36,621 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-16 10:05:36,622 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-16 10:05:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2021-12-16 10:05:36,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2021-12-16 10:05:36,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:36,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2021-12-16 10:05:36,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:36,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2021-12-16 10:05:36,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:36,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 860 transitions. [2021-12-16 10:05:36,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 333 [2021-12-16 10:05:36,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 500 states and 860 transitions. [2021-12-16 10:05:36,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2021-12-16 10:05:36,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2021-12-16 10:05:36,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 500 states and 860 transitions. [2021-12-16 10:05:36,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:36,636 INFO L681 BuchiCegarLoop]: Abstraction has 500 states and 860 transitions. [2021-12-16 10:05:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states and 860 transitions. [2021-12-16 10:05:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 385. [2021-12-16 10:05:36,649 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-16 10:05:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 664 transitions. [2021-12-16 10:05:36,651 INFO L704 BuchiCegarLoop]: Abstraction has 385 states and 664 transitions. [2021-12-16 10:05:36,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:36,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:36,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:36,652 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-16 10:05:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:36,667 INFO L93 Difference]: Finished difference Result 316 states and 521 transitions. [2021-12-16 10:05:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:36,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 521 transitions. [2021-12-16 10:05:36,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2021-12-16 10:05:36,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 521 transitions. [2021-12-16 10:05:36,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2021-12-16 10:05:36,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2021-12-16 10:05:36,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 521 transitions. [2021-12-16 10:05:36,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:36,672 INFO L681 BuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2021-12-16 10:05:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 521 transitions. [2021-12-16 10:05:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-12-16 10:05:36,677 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-16 10:05:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 521 transitions. [2021-12-16 10:05:36,678 INFO L704 BuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2021-12-16 10:05:36,678 INFO L587 BuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2021-12-16 10:05:36,678 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 10:05:36,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 521 transitions. [2021-12-16 10:05:36,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2021-12-16 10:05:36,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:36,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:36,682 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-16 10:05:36,682 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-16 10:05:36,682 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-16 10:05:36,682 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-16 10:05:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2021-12-16 10:05:36,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:36,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179165325] [2021-12-16 10:05:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:36,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:36,713 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-16 10:05:36,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:36,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179165325] [2021-12-16 10:05:36,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179165325] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:36,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:36,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:36,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935369764] [2021-12-16 10:05:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:36,714 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash 34372350, now seen corresponding path program 1 times [2021-12-16 10:05:36,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:36,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052078600] [2021-12-16 10:05:36,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:36,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:36,725 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-16 10:05:36,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:36,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052078600] [2021-12-16 10:05:36,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052078600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:36,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:36,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 10:05:36,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164274362] [2021-12-16 10:05:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:36,726 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:36,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 10:05:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 10:05:36,726 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-16 10:05:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:36,791 INFO L93 Difference]: Finished difference Result 597 states and 967 transitions. [2021-12-16 10:05:36,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 10:05:36,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 967 transitions. [2021-12-16 10:05:36,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2021-12-16 10:05:36,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 597 states and 967 transitions. [2021-12-16 10:05:36,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2021-12-16 10:05:36,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2021-12-16 10:05:36,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 597 states and 967 transitions. [2021-12-16 10:05:36,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:36,806 INFO L681 BuchiCegarLoop]: Abstraction has 597 states and 967 transitions. [2021-12-16 10:05:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states and 967 transitions. [2021-12-16 10:05:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2021-12-16 10:05:36,814 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-16 10:05:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 965 transitions. [2021-12-16 10:05:36,816 INFO L704 BuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2021-12-16 10:05:36,816 INFO L587 BuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2021-12-16 10:05:36,816 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 10:05:36,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 965 transitions. [2021-12-16 10:05:36,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2021-12-16 10:05:36,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:36,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:36,819 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-16 10:05:36,819 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-16 10:05:36,820 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-16 10:05:36,820 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-16 10:05:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash 584245653, now seen corresponding path program 1 times [2021-12-16 10:05:36,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:36,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285036102] [2021-12-16 10:05:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:36,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:36,851 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-16 10:05:36,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285036102] [2021-12-16 10:05:36,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285036102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:36,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:36,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 10:05:36,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077379875] [2021-12-16 10:05:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:36,852 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:36,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash -514887371, now seen corresponding path program 1 times [2021-12-16 10:05:36,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:36,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413302834] [2021-12-16 10:05:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:36,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:36,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:36,872 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:37,041 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:05:37,042 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:05:37,042 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:05:37,042 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:05:37,042 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 10:05:37,042 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,042 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:05:37,042 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:05:37,042 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2021-12-16 10:05:37,042 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:05:37,043 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:05:37,048 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-16 10:05:37,050 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-16 10:05:37,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-16 10:05:37,052 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-16 10:05:37,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-16 10:05:37,055 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-16 10:05:37,058 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-16 10:05:37,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-16 10:05:37,060 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-16 10:05:37,062 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-16 10:05:37,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-16 10:05:37,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-16 10:05:37,071 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-16 10:05:37,073 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-16 10:05:37,075 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-16 10:05:37,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-16 10:05:37,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-16 10:05:37,081 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-16 10:05:37,082 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-16 10:05:37,085 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-16 10:05:37,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-16 10:05:37,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-16 10:05:37,089 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-16 10:05:37,090 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-16 10:05:37,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-16 10:05:37,094 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-16 10:05:37,252 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:05:37,253 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 10:05:37,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,254 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-16 10:05:37,255 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-16 10:05:37,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:37,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:37,296 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:37,296 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=4} Honda state: {~c2_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 10:05:37,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-16 10:05:37,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,319 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-16 10:05:37,319 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-16 10:05:37,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:37,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:37,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:37,328 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-16 10:05:37,343 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-16 10:05:37,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,345 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-16 10:05:37,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:37,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:37,365 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-16 10:05:37,367 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:37,367 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-16 10:05:37,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-12-16 10:05:37,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,384 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-16 10:05:37,385 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-16 10:05:37,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:37,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:37,404 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:37,405 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 10:05:37,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-16 10:05:37,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,422 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-16 10:05:37,423 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-16 10:05:37,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:37,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:37,430 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:37,431 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-16 10:05:37,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-16 10:05:37,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,447 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-16 10:05:37,453 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-16 10:05:37,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:37,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:37,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-16 10:05:37,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,498 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-16 10:05:37,499 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-16 10:05:37,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 10:05:37,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:37,522 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 10:05:37,538 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-16 10:05:37,539 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:05:37,539 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:05:37,539 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:05:37,539 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:05:37,539 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:05:37,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,539 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:05:37,539 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:05:37,539 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2021-12-16 10:05:37,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:05:37,539 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:05:37,540 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-16 10:05:37,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,551 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-16 10:05:37,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,555 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-16 10:05:37,556 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-16 10:05:37,558 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-16 10:05:37,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,569 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-16 10:05:37,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,574 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-16 10:05:37,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,577 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-16 10:05:37,578 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-16 10:05:37,579 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-16 10:05:37,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:05:37,583 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-16 10:05:37,754 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:05:37,754 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:05:37,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,756 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-16 10:05:37,757 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-16 10:05:37,758 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-16 10:05:37,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:37,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:37,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:37,764 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 10:05:37,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:37,764 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 10:05:37,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:37,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:37,798 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-16 10:05:37,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,799 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-16 10:05:37,800 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-16 10:05:37,802 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-16 10:05:37,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:37,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:37,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:37,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:37,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:37,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:37,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:37,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:37,842 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-16 10:05:37,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,843 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-16 10:05:37,844 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-16 10:05:37,845 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-16 10:05:37,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:37,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:37,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:37,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:37,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:37,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:37,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:37,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:37,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-16 10:05:37,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,886 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-16 10:05:37,887 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-16 10:05:37,888 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-16 10:05:37,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:37,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:37,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:37,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:37,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:37,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:37,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:37,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:37,938 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-16 10:05:37,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,939 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-16 10:05:37,944 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-16 10:05:37,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:37,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:37,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:37,950 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 10:05:37,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:37,952 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 10:05:37,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:37,956 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-16 10:05:37,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:37,978 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-16 10:05:37,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,979 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-16 10:05:37,980 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-16 10:05:37,981 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-16 10:05:37,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:37,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:37,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:37,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:37,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:37,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:37,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:37,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:05:37,992 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 10:05:37,992 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 10:05:37,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:37,993 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-16 10:05:37,998 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-16 10:05:37,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:05:37,998 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 10:05:37,998 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:05:37,998 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-12-16 10:05:38,013 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-16 10:05:38,014 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 10:05:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:38,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:05:38,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:05:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:38,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 10:05:38,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:05:38,179 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-16 10:05:38,180 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-16 10:05:38,180 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-16 10:05:38,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-16 10:05:38,233 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-16 10:05:38,233 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-16 10:05:38,234 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-16 10:05:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2021-12-16 10:05:38,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 24 letters. Loop has 28 letters. [2021-12-16 10:05:38,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:38,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 52 letters. Loop has 28 letters. [2021-12-16 10:05:38,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:38,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 24 letters. Loop has 56 letters. [2021-12-16 10:05:38,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:38,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 933 states and 1520 transitions. [2021-12-16 10:05:38,240 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 533 [2021-12-16 10:05:38,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 933 states to 933 states and 1520 transitions. [2021-12-16 10:05:38,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2021-12-16 10:05:38,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 614 [2021-12-16 10:05:38,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 933 states and 1520 transitions. [2021-12-16 10:05:38,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:38,245 INFO L681 BuchiCegarLoop]: Abstraction has 933 states and 1520 transitions. [2021-12-16 10:05:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states and 1520 transitions. [2021-12-16 10:05:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 595. [2021-12-16 10:05:38,253 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-16 10:05:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 965 transitions. [2021-12-16 10:05:38,255 INFO L704 BuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2021-12-16 10:05:38,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:38,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 10:05:38,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 10:05:38,256 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-16 10:05:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:38,306 INFO L93 Difference]: Finished difference Result 1015 states and 1639 transitions. [2021-12-16 10:05:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:05:38,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1639 transitions. [2021-12-16 10:05:38,311 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 498 [2021-12-16 10:05:38,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1639 transitions. [2021-12-16 10:05:38,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2021-12-16 10:05:38,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 618 [2021-12-16 10:05:38,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1639 transitions. [2021-12-16 10:05:38,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:38,317 INFO L681 BuchiCegarLoop]: Abstraction has 1015 states and 1639 transitions. [2021-12-16 10:05:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1639 transitions. [2021-12-16 10:05:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 600. [2021-12-16 10:05:38,326 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-16 10:05:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 966 transitions. [2021-12-16 10:05:38,328 INFO L704 BuchiCegarLoop]: Abstraction has 600 states and 966 transitions. [2021-12-16 10:05:38,328 INFO L587 BuchiCegarLoop]: Abstraction has 600 states and 966 transitions. [2021-12-16 10:05:38,328 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 10:05:38,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 966 transitions. [2021-12-16 10:05:38,330 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 319 [2021-12-16 10:05:38,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:38,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:38,331 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-16 10:05:38,331 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-16 10:05:38,331 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-16 10:05:38,331 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-16 10:05:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash -79370950, now seen corresponding path program 1 times [2021-12-16 10:05:38,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:38,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660088318] [2021-12-16 10:05:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:38,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:38,347 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-16 10:05:38,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:38,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660088318] [2021-12-16 10:05:38,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660088318] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:38,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:38,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 10:05:38,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125204880] [2021-12-16 10:05:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:38,348 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1109190157, now seen corresponding path program 1 times [2021-12-16 10:05:38,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:38,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159317386] [2021-12-16 10:05:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:38,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:38,358 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-16 10:05:38,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:38,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159317386] [2021-12-16 10:05:38,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159317386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:38,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:38,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:38,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844591712] [2021-12-16 10:05:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:38,360 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:38,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 10:05:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 10:05:38,360 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-16 10:05:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:38,396 INFO L93 Difference]: Finished difference Result 1248 states and 1981 transitions. [2021-12-16 10:05:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:05:38,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1981 transitions. [2021-12-16 10:05:38,403 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 710 [2021-12-16 10:05:38,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 1248 states and 1981 transitions. [2021-12-16 10:05:38,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2021-12-16 10:05:38,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 796 [2021-12-16 10:05:38,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1248 states and 1981 transitions. [2021-12-16 10:05:38,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:38,409 INFO L681 BuchiCegarLoop]: Abstraction has 1248 states and 1981 transitions. [2021-12-16 10:05:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states and 1981 transitions. [2021-12-16 10:05:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 800. [2021-12-16 10:05:38,419 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-16 10:05:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1271 transitions. [2021-12-16 10:05:38,421 INFO L704 BuchiCegarLoop]: Abstraction has 800 states and 1271 transitions. [2021-12-16 10:05:38,422 INFO L587 BuchiCegarLoop]: Abstraction has 800 states and 1271 transitions. [2021-12-16 10:05:38,422 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 10:05:38,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 1271 transitions. [2021-12-16 10:05:38,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 465 [2021-12-16 10:05:38,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:38,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:38,425 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-16 10:05:38,425 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-16 10:05:38,426 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-16 10:05:38,426 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-16 10:05:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2021-12-16 10:05:38,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:38,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117737209] [2021-12-16 10:05:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:38,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:38,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:38,437 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash -864089630, now seen corresponding path program 1 times [2021-12-16 10:05:38,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:38,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886840339] [2021-12-16 10:05:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:38,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:38,447 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-16 10:05:38,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:38,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886840339] [2021-12-16 10:05:38,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886840339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:38,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:38,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:38,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308763067] [2021-12-16 10:05:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:38,448 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:05:38,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:38,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:38,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:38,449 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-16 10:05:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:38,487 INFO L93 Difference]: Finished difference Result 1241 states and 1961 transitions. [2021-12-16 10:05:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:38,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1241 states and 1961 transitions. [2021-12-16 10:05:38,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2021-12-16 10:05:38,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1241 states to 1241 states and 1961 transitions. [2021-12-16 10:05:38,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2021-12-16 10:05:38,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 799 [2021-12-16 10:05:38,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1241 states and 1961 transitions. [2021-12-16 10:05:38,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:38,499 INFO L681 BuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2021-12-16 10:05:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states and 1961 transitions. [2021-12-16 10:05:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2021-12-16 10:05:38,512 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-16 10:05:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1961 transitions. [2021-12-16 10:05:38,515 INFO L704 BuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2021-12-16 10:05:38,515 INFO L587 BuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2021-12-16 10:05:38,515 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 10:05:38,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1241 states and 1961 transitions. [2021-12-16 10:05:38,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2021-12-16 10:05:38,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:38,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:38,519 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-16 10:05:38,519 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-16 10:05:38,520 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-16 10:05:38,520 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-16 10:05:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2021-12-16 10:05:38,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:38,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791752790] [2021-12-16 10:05:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:38,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:38,525 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:38,530 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1766031718, now seen corresponding path program 1 times [2021-12-16 10:05:38,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:38,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583947872] [2021-12-16 10:05:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:38,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:38,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:38,536 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1128637889, now seen corresponding path program 1 times [2021-12-16 10:05:38,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:38,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045765789] [2021-12-16 10:05:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:38,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:38,551 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-16 10:05:38,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:38,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045765789] [2021-12-16 10:05:38,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045765789] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:38,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:38,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:38,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813665091] [2021-12-16 10:05:38,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:38,711 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:05:38,711 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:05:38,711 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:05:38,711 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:05:38,711 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 10:05:38,711 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:38,711 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:05:38,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:05:38,711 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2021-12-16 10:05:38,711 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:05:38,711 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:05:38,712 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-16 10:05:38,719 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-16 10:05:38,721 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-16 10:05:38,723 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-16 10:05:38,726 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-16 10:05:38,728 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-16 10:05:38,729 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-16 10:05:38,732 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-16 10:05:38,734 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-16 10:05:38,737 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-16 10:05:38,739 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-16 10:05:38,740 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-16 10:05:38,742 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-16 10:05:38,743 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-16 10:05:38,745 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-16 10:05:38,748 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-16 10:05:38,749 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-16 10:05:38,751 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-16 10:05:38,752 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-16 10:05:38,754 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-16 10:05:38,757 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-16 10:05:38,759 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-16 10:05:38,760 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-16 10:05:38,762 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-16 10:05:38,771 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-16 10:05:38,773 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-16 10:05:38,937 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:05:38,937 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 10:05:38,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:38,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:38,938 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-16 10:05:38,939 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-16 10:05:38,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:38,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:38,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:38,970 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=4} Honda state: {~r_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 10:05:38,985 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-16 10:05:38,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:38,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:38,986 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-16 10:05:38,987 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-16 10:05:38,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:38,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:38,995 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:38,995 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-16 10:05:39,010 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-16 10:05:39,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,011 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-16 10:05:39,012 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-16 10:05:39,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:39,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:39,020 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:05:39,020 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-16 10:05:39,035 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-16 10:05:39,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,036 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-16 10:05:39,037 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-16 10:05:39,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:05:39,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:39,060 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-16 10:05:39,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,061 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-16 10:05:39,062 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-16 10:05:39,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 10:05:39,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:05:39,080 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 10:05:39,095 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-16 10:05:39,096 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:05:39,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:05:39,096 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:05:39,096 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:05:39,096 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:05:39,096 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,096 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:05:39,096 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:05:39,096 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2021-12-16 10:05:39,096 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:05:39,096 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:05:39,097 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-16 10:05:39,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-16 10:05:39,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-16 10:05:39,108 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-16 10:05:39,111 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-16 10:05:39,112 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-16 10:05:39,114 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-16 10:05:39,117 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-16 10:05:39,119 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-16 10:05:39,122 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-16 10:05:39,123 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-16 10:05:39,125 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-16 10:05:39,126 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-16 10:05:39,127 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-16 10:05:39,130 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-16 10:05:39,132 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-16 10:05:39,133 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-16 10:05:39,135 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-16 10:05:39,136 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-16 10:05:39,137 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-16 10:05:39,140 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-16 10:05:39,141 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-16 10:05:39,143 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-16 10:05:39,144 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-16 10:05:39,147 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-16 10:05:39,148 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-16 10:05:39,314 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:05:39,314 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:05:39,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,315 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-16 10:05:39,316 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-16 10:05:39,317 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-16 10:05:39,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:39,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:39,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:39,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:39,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:39,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:39,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:39,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:39,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-16 10:05:39,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,357 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-16 10:05:39,358 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-16 10:05:39,360 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-16 10:05:39,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:39,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:39,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:39,367 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 10:05:39,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:39,367 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 10:05:39,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:39,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:39,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-16 10:05:39,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,392 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-16 10:05:39,392 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-16 10:05:39,394 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-16 10:05:39,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:39,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:39,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:39,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:39,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:39,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:39,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:39,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:05:39,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-16 10:05:39,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,420 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-16 10:05:39,420 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-16 10:05:39,422 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-16 10:05:39,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:05:39,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:05:39,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:05:39,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:05:39,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:05:39,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:05:39,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:05:39,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:05:39,431 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 10:05:39,431 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 10:05:39,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:05:39,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:05:39,432 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-16 10:05:39,433 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-16 10:05:39,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:05:39,435 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 10:05:39,435 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:05:39,435 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2021-12-16 10:05:39,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-16 10:05:39,451 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 10:05:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:39,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:05:39,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:05:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:39,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 10:05:39,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:05:39,654 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-16 10:05:39,655 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-16 10:05:39,655 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-16 10:05:39,682 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-16 10:05:39,682 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-16 10:05:39,683 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-16 10:05:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2021-12-16 10:05:39,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 29 letters. [2021-12-16 10:05:39,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:39,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 54 letters. Loop has 29 letters. [2021-12-16 10:05:39,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:39,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 58 letters. [2021-12-16 10:05:39,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:05:39,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3166 states and 4998 transitions. [2021-12-16 10:05:39,699 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2021-12-16 10:05:39,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3166 states to 3166 states and 4998 transitions. [2021-12-16 10:05:39,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2021-12-16 10:05:39,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1401 [2021-12-16 10:05:39,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3166 states and 4998 transitions. [2021-12-16 10:05:39,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:39,714 INFO L681 BuchiCegarLoop]: Abstraction has 3166 states and 4998 transitions. [2021-12-16 10:05:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states and 4998 transitions. [2021-12-16 10:05:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3149. [2021-12-16 10:05:39,749 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-16 10:05:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4969 transitions. [2021-12-16 10:05:39,756 INFO L704 BuchiCegarLoop]: Abstraction has 3149 states and 4969 transitions. [2021-12-16 10:05:39,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:39,757 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-16 10:05:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:39,797 INFO L93 Difference]: Finished difference Result 3149 states and 4917 transitions. [2021-12-16 10:05:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:39,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3149 states and 4917 transitions. [2021-12-16 10:05:39,810 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2021-12-16 10:05:39,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-16 10:05:39,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3149 states to 3149 states and 4917 transitions. [2021-12-16 10:05:39,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2021-12-16 10:05:39,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1384 [2021-12-16 10:05:39,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3149 states and 4917 transitions. [2021-12-16 10:05:39,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:39,823 INFO L681 BuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2021-12-16 10:05:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states and 4917 transitions. [2021-12-16 10:05:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2021-12-16 10:05:39,853 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-16 10:05:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4917 transitions. [2021-12-16 10:05:39,860 INFO L704 BuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2021-12-16 10:05:39,860 INFO L587 BuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2021-12-16 10:05:39,860 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-16 10:05:39,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3149 states and 4917 transitions. [2021-12-16 10:05:39,868 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2021-12-16 10:05:39,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:39,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:39,868 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-16 10:05:39,868 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:05:39,868 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-16 10:05:39,869 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-16 10:05:39,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2021-12-16 10:05:39,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:39,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117170296] [2021-12-16 10:05:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:39,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:39,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:39,885 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:39,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1282723830, now seen corresponding path program 1 times [2021-12-16 10:05:39,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:39,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829706138] [2021-12-16 10:05:39,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:39,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:39,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:39,892 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 363769326, now seen corresponding path program 1 times [2021-12-16 10:05:39,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:39,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537821674] [2021-12-16 10:05:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:39,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:39,912 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-16 10:05:39,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:39,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537821674] [2021-12-16 10:05:39,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537821674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:39,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:39,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:39,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707724033] [2021-12-16 10:05:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:39,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:39,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:39,936 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-16 10:05:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:39,961 INFO L93 Difference]: Finished difference Result 4634 states and 7109 transitions. [2021-12-16 10:05:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:39,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4634 states and 7109 transitions. [2021-12-16 10:05:39,997 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1978 [2021-12-16 10:05:40,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4634 states to 4634 states and 7109 transitions. [2021-12-16 10:05:40,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2042 [2021-12-16 10:05:40,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2042 [2021-12-16 10:05:40,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4634 states and 7109 transitions. [2021-12-16 10:05:40,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:40,015 INFO L681 BuchiCegarLoop]: Abstraction has 4634 states and 7109 transitions. [2021-12-16 10:05:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states and 7109 transitions. [2021-12-16 10:05:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4616. [2021-12-16 10:05:40,068 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-16 10:05:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 7091 transitions. [2021-12-16 10:05:40,075 INFO L704 BuchiCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2021-12-16 10:05:40,075 INFO L587 BuchiCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2021-12-16 10:05:40,075 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-16 10:05:40,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4616 states and 7091 transitions. [2021-12-16 10:05:40,084 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1970 [2021-12-16 10:05:40,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:40,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:40,085 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-16 10:05:40,085 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:05:40,086 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-16 10:05:40,086 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-16 10:05:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2021-12-16 10:05:40,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388914540] [2021-12-16 10:05:40,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,104 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 1 times [2021-12-16 10:05:40,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902411666] [2021-12-16 10:05:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,114 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1659779318, now seen corresponding path program 1 times [2021-12-16 10:05:40,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022170702] [2021-12-16 10:05:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:40,137 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-16 10:05:40,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:40,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022170702] [2021-12-16 10:05:40,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022170702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:40,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:40,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:40,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652960448] [2021-12-16 10:05:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:40,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:40,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:40,165 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-16 10:05:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:40,221 INFO L93 Difference]: Finished difference Result 7194 states and 10846 transitions. [2021-12-16 10:05:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:40,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7194 states and 10846 transitions. [2021-12-16 10:05:40,243 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3096 [2021-12-16 10:05:40,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7194 states to 7194 states and 10846 transitions. [2021-12-16 10:05:40,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3210 [2021-12-16 10:05:40,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3210 [2021-12-16 10:05:40,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7194 states and 10846 transitions. [2021-12-16 10:05:40,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:40,271 INFO L681 BuchiCegarLoop]: Abstraction has 7194 states and 10846 transitions. [2021-12-16 10:05:40,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states and 10846 transitions. [2021-12-16 10:05:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 7158. [2021-12-16 10:05:40,375 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-16 10:05:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 10810 transitions. [2021-12-16 10:05:40,389 INFO L704 BuchiCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2021-12-16 10:05:40,389 INFO L587 BuchiCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2021-12-16 10:05:40,389 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-16 10:05:40,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7158 states and 10810 transitions. [2021-12-16 10:05:40,402 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2021-12-16 10:05:40,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:40,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:40,403 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-16 10:05:40,403 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:05:40,404 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-16 10:05:40,404 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-16 10:05:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2021-12-16 10:05:40,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375570069] [2021-12-16 10:05:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:40,415 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-16 10:05:40,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:40,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375570069] [2021-12-16 10:05:40,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375570069] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:40,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:40,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:40,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867441785] [2021-12-16 10:05:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:40,417 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:05:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 2 times [2021-12-16 10:05:40,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460934510] [2021-12-16 10:05:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:40,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:40,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:40,449 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-16 10:05:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:40,470 INFO L93 Difference]: Finished difference Result 7106 states and 10723 transitions. [2021-12-16 10:05:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:40,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7106 states and 10723 transitions. [2021-12-16 10:05:40,537 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2021-12-16 10:05:40,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7106 states to 7106 states and 10723 transitions. [2021-12-16 10:05:40,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3144 [2021-12-16 10:05:40,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3144 [2021-12-16 10:05:40,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7106 states and 10723 transitions. [2021-12-16 10:05:40,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:40,558 INFO L681 BuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2021-12-16 10:05:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states and 10723 transitions. [2021-12-16 10:05:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 7106. [2021-12-16 10:05:40,672 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-16 10:05:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 10723 transitions. [2021-12-16 10:05:40,714 INFO L704 BuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2021-12-16 10:05:40,714 INFO L587 BuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2021-12-16 10:05:40,714 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-16 10:05:40,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7106 states and 10723 transitions. [2021-12-16 10:05:40,764 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2021-12-16 10:05:40,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:40,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:40,764 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-16 10:05:40,764 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:05:40,764 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-16 10:05:40,765 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-16 10:05:40,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,765 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2021-12-16 10:05:40,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021472609] [2021-12-16 10:05:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1563186686, now seen corresponding path program 1 times [2021-12-16 10:05:40,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634685891] [2021-12-16 10:05:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,795 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:40,799 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 84797946, now seen corresponding path program 1 times [2021-12-16 10:05:40,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:40,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044951472] [2021-12-16 10:05:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:40,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:05:40,815 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-16 10:05:40,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:05:40,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044951472] [2021-12-16 10:05:40,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044951472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:05:40,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:05:40,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:05:40,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778983262] [2021-12-16 10:05:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:05:40,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:05:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:05:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:05:40,854 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-16 10:05:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:05:40,898 INFO L93 Difference]: Finished difference Result 12263 states and 18336 transitions. [2021-12-16 10:05:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:05:40,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12263 states and 18336 transitions. [2021-12-16 10:05:40,942 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2021-12-16 10:05:40,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12263 states to 12263 states and 18336 transitions. [2021-12-16 10:05:41,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5422 [2021-12-16 10:05:41,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5422 [2021-12-16 10:05:41,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12263 states and 18336 transitions. [2021-12-16 10:05:41,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 10:05:41,061 INFO L681 BuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2021-12-16 10:05:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12263 states and 18336 transitions. [2021-12-16 10:05:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12263 to 12263. [2021-12-16 10:05:41,196 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-16 10:05:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12263 states to 12263 states and 18336 transitions. [2021-12-16 10:05:41,249 INFO L704 BuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2021-12-16 10:05:41,249 INFO L587 BuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2021-12-16 10:05:41,249 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-16 10:05:41,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12263 states and 18336 transitions. [2021-12-16 10:05:41,270 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2021-12-16 10:05:41,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:05:41,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:05:41,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, 1, 1] [2021-12-16 10:05:41,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:05:41,274 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-16 10:05:41,274 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-16 10:05:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2021-12-16 10:05:41,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:41,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065177607] [2021-12-16 10:05:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:41,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:41,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:41,286 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:41,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:41,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1214182410, now seen corresponding path program 1 times [2021-12-16 10:05:41,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:41,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507963332] [2021-12-16 10:05:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:41,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:41,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:41,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:05:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1666266370, now seen corresponding path program 1 times [2021-12-16 10:05:41,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:05:41,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307328641] [2021-12-16 10:05:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:05:41,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:05:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:41,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:05:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:05:41,305 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:05:42,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 10:05:42 BoogieIcfgContainer [2021-12-16 10:05:42,017 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 10:05:42,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 10:05:42,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 10:05:42,018 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 10:05:42,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:05:34" (3/4) ... [2021-12-16 10:05:42,020 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-16 10:05:42,045 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 10:05:42,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 10:05:42,046 INFO L158 Benchmark]: Toolchain (without parser) took 8600.17ms. Allocated memory was 96.5MB in the beginning and 566.2MB in the end (delta: 469.8MB). Free memory was 61.5MB in the beginning and 384.8MB in the end (delta: -323.3MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2021-12-16 10:05:42,046 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:05:42,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.41ms. Allocated memory is still 96.5MB. Free memory was 61.3MB in the beginning and 69.8MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 10:05:42,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.28ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:05:42,047 INFO L158 Benchmark]: Boogie Preprocessor took 38.84ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 65.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:05:42,047 INFO L158 Benchmark]: RCFGBuilder took 442.34ms. Allocated memory is still 96.5MB. Free memory was 65.6MB in the beginning and 46.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-16 10:05:42,047 INFO L158 Benchmark]: BuchiAutomizer took 7694.90ms. Allocated memory was 96.5MB in the beginning and 566.2MB in the end (delta: 469.8MB). Free memory was 46.7MB in the beginning and 388.0MB in the end (delta: -341.2MB). Peak memory consumption was 139.6MB. Max. memory is 16.1GB. [2021-12-16 10:05:42,047 INFO L158 Benchmark]: Witness Printer took 27.95ms. Allocated memory is still 566.2MB. Free memory was 388.0MB in the beginning and 384.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:05:42,048 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 is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.41ms. Allocated memory is still 96.5MB. Free memory was 61.3MB in the beginning and 69.8MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.28ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.84ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 65.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.34ms. Allocated memory is still 96.5MB. Free memory was 65.6MB in the beginning and 46.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 7694.90ms. Allocated memory was 96.5MB in the beginning and 566.2MB in the end (delta: 469.8MB). Free memory was 46.7MB in the beginning and 388.0MB in the end (delta: -341.2MB). Peak memory consumption was 139.6MB. Max. memory is 16.1GB. * Witness Printer took 27.95ms. Allocated memory is still 566.2MB. Free memory was 388.0MB in the beginning and 384.8MB 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.6s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 13. Automata minimization 0.7s 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: 45ms 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@4bac0ea=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10fe0f80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3289b081=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cc91549=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5dfe69=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-16 10:05:42,080 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)