./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy1.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/toy1.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 c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 19:17:07,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 19:17:07,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 19:17:07,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 19:17:07,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 19:17:07,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 19:17:07,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 19:17:07,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 19:17:07,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 19:17:07,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 19:17:07,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 19:17:07,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 19:17:07,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 19:17:07,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 19:17:07,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 19:17:07,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 19:17:07,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 19:17:07,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 19:17:07,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 19:17:07,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 19:17:07,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 19:17:07,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 19:17:07,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 19:17:07,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 19:17:07,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 19:17:07,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 19:17:07,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 19:17:07,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 19:17:07,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 19:17:07,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 19:17:07,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 19:17:07,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 19:17:07,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 19:17:07,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 19:17:07,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 19:17:07,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 19:17:07,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 19:17:07,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 19:17:07,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 19:17:07,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 19:17:07,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 19:17:07,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 19:17:07,137 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 19:17:07,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 19:17:07,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 19:17:07,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 19:17:07,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 19:17:07,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 19:17:07,139 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 19:17:07,139 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 19:17:07,139 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 19:17:07,139 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 19:17:07,139 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 19:17:07,140 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 19:17:07,140 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 19:17:07,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 19:17:07,140 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 19:17:07,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 19:17:07,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 19:17:07,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 19:17:07,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 19:17:07,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 19:17:07,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 19:17:07,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 19:17:07,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 19:17:07,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 19:17:07,143 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 19:17:07,143 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 19:17:07,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 19:17:07,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 19:17:07,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 19:17:07,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 19:17:07,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 19:17:07,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 19:17:07,145 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 19:17:07,145 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 -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2021-12-19 19:17:07,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 19:17:07,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 19:17:07,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 19:17:07,351 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 19:17:07,351 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 19:17:07,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2021-12-19 19:17:07,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8edd9295b/198c630836cf4c69a5ed20d29ec90e63/FLAG1985917f7 [2021-12-19 19:17:07,751 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 19:17:07,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2021-12-19 19:17:07,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8edd9295b/198c630836cf4c69a5ed20d29ec90e63/FLAG1985917f7 [2021-12-19 19:17:07,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8edd9295b/198c630836cf4c69a5ed20d29ec90e63 [2021-12-19 19:17:07,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 19:17:07,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 19:17:07,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 19:17:07,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 19:17:07,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 19:17:07,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 07:17:07" (1/1) ... [2021-12-19 19:17:07,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1305b98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:07, skipping insertion in model container [2021-12-19 19:17:07,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 07:17:07" (1/1) ... [2021-12-19 19:17:07,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 19:17:07,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 19:17:07,913 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/toy1.cil.c[698,711] [2021-12-19 19:17:07,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 19:17:07,958 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 19:17:07,982 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/toy1.cil.c[698,711] [2021-12-19 19:17:08,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 19:17:08,020 INFO L208 MainTranslator]: Completed translation [2021-12-19 19:17:08,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08 WrapperNode [2021-12-19 19:17:08,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 19:17:08,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 19:17:08,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 19:17:08,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 19:17:08,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,048 INFO L137 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 363 [2021-12-19 19:17:08,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 19:17:08,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 19:17:08,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 19:17:08,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 19:17:08,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 19:17:08,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 19:17:08,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 19:17:08,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 19:17:08,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (1/1) ... [2021-12-19 19:17:08,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:08,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:08,128 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-19 19:17:08,155 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-19 19:17:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 19:17:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-19 19:17:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 19:17:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 19:17:08,221 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 19:17:08,222 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 19:17:08,543 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 19:17:08,549 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 19:17:08,550 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-19 19:17:08,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 07:17:08 BoogieIcfgContainer [2021-12-19 19:17:08,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 19:17:08,552 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 19:17:08,552 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 19:17:08,555 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 19:17:08,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 19:17:08,555 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 07:17:07" (1/3) ... [2021-12-19 19:17:08,556 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d76a4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 07:17:08, skipping insertion in model container [2021-12-19 19:17:08,556 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 19:17:08,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:17:08" (2/3) ... [2021-12-19 19:17:08,557 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d76a4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 07:17:08, skipping insertion in model container [2021-12-19 19:17:08,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 19:17:08,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 07:17:08" (3/3) ... [2021-12-19 19:17:08,558 INFO L388 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2021-12-19 19:17:08,586 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 19:17:08,587 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 19:17:08,587 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 19:17:08,587 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 19:17:08,587 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 19:17:08,587 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 19:17:08,587 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 19:17:08,588 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 19:17:08,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 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-19 19:17:08,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2021-12-19 19:17:08,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:08,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:08,625 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-19 19:17:08,626 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-19 19:17:08,626 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 19:17:08,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 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-19 19:17:08,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2021-12-19 19:17:08,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:08,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:08,633 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-19 19:17:08,633 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-19 19:17:08,638 INFO L791 eck$LassoCheckResult]: Stem: 123#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(11, 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; 46#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; 21#L416true assume !(1 == ~c_req_up~0); 112#L416-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 62#L427-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 71#L432-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 33#L437-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 45#L442-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 108#L447-1true assume !(0 == ~e_f~0); 36#L452-1true assume !(0 == ~e_g~0); 9#L457-1true assume !(0 == ~e_e~0); 120#L462-1true assume !(0 == ~e_c~0); 25#L467-1true assume !(0 == ~e_wl~0); 101#L472-1true assume !(1 == ~wl_pc~0); 125#L484true assume !(2 == ~wl_pc~0); 94#L485true assume !(1 == ~c1_pc~0); 26#L495true assume !(1 == ~c2_pc~0); 75#L504true assume !(1 == ~wb_pc~0); 98#L513true assume !(1 == ~e_c~0); 17#L522-1true assume !(1 == ~e_e~0); 106#L527-1true assume !(1 == ~e_f~0); 38#L532-1true assume !(1 == ~e_g~0); 85#L537-1true assume !(1 == ~e_c~0); 56#L542-1true assume !(1 == ~e_wl~0); 103#L684-1true [2021-12-19 19:17:08,639 INFO L793 eck$LassoCheckResult]: Loop: 103#L684-1true assume !false; 134#L554true 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; 19#L389true assume false; 78#L405true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 24#L560true assume !(1 == ~c_req_up~0); 100#L560-2true start_simulation_~kernel_st~0#1 := 3; 109#L572true assume 0 == ~e_f~0;~e_f~0 := 1; 23#L572-2true assume 0 == ~e_g~0;~e_g~0 := 1; 49#L577-1true assume !(0 == ~e_e~0); 34#L582-1true assume 0 == ~e_c~0;~e_c~0 := 1; 42#L587-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 57#L592-1true assume !(1 == ~wl_pc~0); 50#L604true assume !(2 == ~wl_pc~0); 58#L605true assume !(1 == ~c1_pc~0); 8#L615true assume !(1 == ~c2_pc~0); 47#L624true assume !(1 == ~wb_pc~0); 127#L633true assume 1 == ~e_c~0;~r_st~0 := 0; 88#L642-1true assume 1 == ~e_e~0;~e_e~0 := 2; 27#L647-1true assume 1 == ~e_f~0;~e_f~0 := 2; 13#L652-1true assume !(1 == ~e_g~0); 89#L657-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L662-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 104#L667-1true assume 0 == ~wl_st~0; 103#L684-1true [2021-12-19 19:17:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:08,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-12-19 19:17:08,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:08,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929832840] [2021-12-19 19:17:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:08,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:08,793 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-19 19:17:08,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:08,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929832840] [2021-12-19 19:17:08,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929832840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:08,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:08,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:08,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306864152] [2021-12-19 19:17:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:08,801 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash -696614142, now seen corresponding path program 1 times [2021-12-19 19:17:08,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:08,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161083823] [2021-12-19 19:17:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:08,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:08,825 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-19 19:17:08,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161083823] [2021-12-19 19:17:08,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161083823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:08,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:08,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 19:17:08,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345866074] [2021-12-19 19:17:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:08,828 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:17:08,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-19 19:17:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-19 19:17:08,857 INFO L87 Difference]: Start difference. First operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 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-19 19:17:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:08,875 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2021-12-19 19:17:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-19 19:17:08,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2021-12-19 19:17:08,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:08,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2021-12-19 19:17:08,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-19 19:17:08,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-19 19:17:08,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2021-12-19 19:17:08,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:17:08,887 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2021-12-19 19:17:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2021-12-19 19:17:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-19 19:17:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.746031746031746) internal successors, (220), 125 states have internal predecessors, (220), 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-19 19:17:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2021-12-19 19:17:08,939 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2021-12-19 19:17:08,940 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2021-12-19 19:17:08,940 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 19:17:08,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2021-12-19 19:17:08,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:08,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:08,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:08,958 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-19 19:17:08,958 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-19 19:17:08,958 INFO L791 eck$LassoCheckResult]: Stem: 400#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(11, 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; 353#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; 309#L416 assume !(1 == ~c_req_up~0); 311#L416-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 369#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 370#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 334#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 335#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 352#L447-1 assume !(0 == ~e_f~0); 340#L452-1 assume !(0 == ~e_g~0); 287#L457-1 assume !(0 == ~e_e~0); 288#L462-1 assume !(0 == ~e_c~0); 319#L467-1 assume !(0 == ~e_wl~0); 320#L472-1 assume !(1 == ~wl_pc~0); 395#L484 assume !(2 == ~wl_pc~0); 391#L485 assume !(1 == ~c1_pc~0); 321#L495 assume !(1 == ~c2_pc~0); 323#L504 assume !(1 == ~wb_pc~0); 379#L513 assume !(1 == ~e_c~0); 300#L522-1 assume !(1 == ~e_e~0); 301#L527-1 assume !(1 == ~e_f~0); 341#L532-1 assume !(1 == ~e_g~0); 342#L537-1 assume !(1 == ~e_c~0); 363#L542-1 assume !(1 == ~e_wl~0); 278#L684-1 [2021-12-19 19:17:08,958 INFO L793 eck$LassoCheckResult]: Loop: 278#L684-1 assume !false; 397#L554 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; 305#L389 assume !false; 306#L307 assume !(0 == ~wl_st~0); 358#L311 assume !(0 == ~c1_st~0); 359#L314 assume !(0 == ~c2_st~0); 279#L317 assume !(0 == ~wb_st~0); 281#L320 assume !(0 == ~r_st~0); 382#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 316#L560 assume !(1 == ~c_req_up~0); 318#L560-2 start_simulation_~kernel_st~0#1 := 3; 394#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 315#L577-1 assume !(0 == ~e_e~0); 336#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 337#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 349#L592-1 assume !(1 == ~wl_pc~0); 357#L604 assume !(2 == ~wl_pc~0); 308#L605 assume !(1 == ~c1_pc~0); 284#L615 assume !(1 == ~c2_pc~0); 286#L624 assume !(1 == ~wb_pc~0); 355#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 388#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 324#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 294#L652-1 assume !(1 == ~e_g~0); 295#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 385#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 386#L667-1 assume 0 == ~wl_st~0; 278#L684-1 [2021-12-19 19:17:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-12-19 19:17:08,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:08,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798883851] [2021-12-19 19:17:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:08,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 19:17:08,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:08,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798883851] [2021-12-19 19:17:08,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798883851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:08,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:08,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:08,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117909440] [2021-12-19 19:17:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:08,993 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:08,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 1 times [2021-12-19 19:17:08,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:08,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035972433] [2021-12-19 19:17:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:08,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,019 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-19 19:17:09,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035972433] [2021-12-19 19:17:09,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035972433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:09,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015053013] [2021-12-19 19:17:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,022 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:17:09,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:09,024 INFO L87 Difference]: Start difference. First operand 126 states and 220 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-19 19:17:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:09,048 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2021-12-19 19:17:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:09,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2021-12-19 19:17:09,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:09,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2021-12-19 19:17:09,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-19 19:17:09,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-19 19:17:09,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2021-12-19 19:17:09,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:17:09,056 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2021-12-19 19:17:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2021-12-19 19:17:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-19 19:17:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 125 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-19 19:17:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2021-12-19 19:17:09,063 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2021-12-19 19:17:09,063 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2021-12-19 19:17:09,063 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 19:17:09,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2021-12-19 19:17:09,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:09,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:09,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:09,065 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:09,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:09,067 INFO L791 eck$LassoCheckResult]: Stem: 659#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(11, 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; 612#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; 568#L416 assume !(1 == ~c_req_up~0); 570#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 628#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 629#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 593#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 594#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 611#L447-1 assume !(0 == ~e_f~0); 599#L452-1 assume !(0 == ~e_g~0); 546#L457-1 assume !(0 == ~e_e~0); 547#L462-1 assume !(0 == ~e_c~0); 578#L467-1 assume !(0 == ~e_wl~0); 579#L472-1 assume !(1 == ~wl_pc~0); 654#L484 assume !(2 == ~wl_pc~0); 650#L485 assume !(1 == ~c1_pc~0); 580#L495 assume !(1 == ~c2_pc~0); 582#L504 assume !(1 == ~wb_pc~0); 638#L513 assume !(1 == ~e_c~0); 559#L522-1 assume !(1 == ~e_e~0); 560#L527-1 assume !(1 == ~e_f~0); 600#L532-1 assume !(1 == ~e_g~0); 601#L537-1 assume !(1 == ~e_c~0); 622#L542-1 assume !(1 == ~e_wl~0); 537#L684-1 [2021-12-19 19:17:09,067 INFO L793 eck$LassoCheckResult]: Loop: 537#L684-1 assume !false; 656#L554 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; 564#L389 assume !false; 565#L307 assume !(0 == ~wl_st~0); 617#L311 assume !(0 == ~c1_st~0); 618#L314 assume !(0 == ~c2_st~0); 538#L317 assume !(0 == ~wb_st~0); 540#L320 assume !(0 == ~r_st~0); 641#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 575#L560 assume !(1 == ~c_req_up~0); 577#L560-2 start_simulation_~kernel_st~0#1 := 3; 653#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 573#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 574#L577-1 assume !(0 == ~e_e~0); 595#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 596#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 608#L592-1 assume !(1 == ~wl_pc~0); 616#L604 assume !(2 == ~wl_pc~0); 567#L605 assume !(1 == ~c1_pc~0); 543#L615 assume !(1 == ~c2_pc~0); 545#L624 assume !(1 == ~wb_pc~0); 614#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 647#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 583#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 553#L652-1 assume !(1 == ~e_g~0); 554#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 644#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 645#L667-1 assume 0 == ~wl_st~0; 537#L684-1 [2021-12-19 19:17:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-12-19 19:17:09,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187167865] [2021-12-19 19:17:09,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,113 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-19 19:17:09,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187167865] [2021-12-19 19:17:09,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187167865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:09,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667959508] [2021-12-19 19:17:09,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,115 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 2 times [2021-12-19 19:17:09,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584275114] [2021-12-19 19:17:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,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-19 19:17:09,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584275114] [2021-12-19 19:17:09,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584275114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:09,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857015514] [2021-12-19 19:17:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,138 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:17:09,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:09,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:09,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:09,139 INFO L87 Difference]: Start difference. First operand 126 states and 219 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-19 19:17:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:09,163 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2021-12-19 19:17:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:09,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 218 transitions. [2021-12-19 19:17:09,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:09,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 218 transitions. [2021-12-19 19:17:09,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-19 19:17:09,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-19 19:17:09,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 218 transitions. [2021-12-19 19:17:09,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:17:09,167 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2021-12-19 19:17:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 218 transitions. [2021-12-19 19:17:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-19 19:17:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7301587301587302) internal successors, (218), 125 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-19 19:17:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 218 transitions. [2021-12-19 19:17:09,172 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2021-12-19 19:17:09,172 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2021-12-19 19:17:09,173 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 19:17:09,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 218 transitions. [2021-12-19 19:17:09,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:09,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:09,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:09,178 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-19 19:17:09,178 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-19 19:17:09,179 INFO L791 eck$LassoCheckResult]: Stem: 918#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(11, 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; 871#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; 827#L416 assume !(1 == ~c_req_up~0); 829#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 887#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 888#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 854#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 855#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 870#L447-1 assume !(0 == ~e_f~0); 858#L452-1 assume !(0 == ~e_g~0); 805#L457-1 assume !(0 == ~e_e~0); 806#L462-1 assume !(0 == ~e_c~0); 837#L467-1 assume !(0 == ~e_wl~0); 838#L472-1 assume !(1 == ~wl_pc~0); 913#L484 assume !(2 == ~wl_pc~0); 909#L485 assume !(1 == ~c1_pc~0); 839#L495 assume !(1 == ~c2_pc~0); 841#L504 assume !(1 == ~wb_pc~0); 897#L513 assume !(1 == ~e_c~0); 818#L522-1 assume !(1 == ~e_e~0); 819#L527-1 assume !(1 == ~e_f~0); 859#L532-1 assume !(1 == ~e_g~0); 860#L537-1 assume !(1 == ~e_c~0); 881#L542-1 assume !(1 == ~e_wl~0); 796#L684-1 [2021-12-19 19:17:09,179 INFO L793 eck$LassoCheckResult]: Loop: 796#L684-1 assume !false; 915#L554 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; 823#L389 assume !false; 824#L307 assume !(0 == ~wl_st~0); 876#L311 assume !(0 == ~c1_st~0); 877#L314 assume !(0 == ~c2_st~0); 797#L317 assume !(0 == ~wb_st~0); 799#L320 assume !(0 == ~r_st~0); 900#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 834#L560 assume !(1 == ~c_req_up~0); 836#L560-2 start_simulation_~kernel_st~0#1 := 3; 912#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 832#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 833#L577-1 assume !(0 == ~e_e~0); 852#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 853#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 867#L592-1 assume 1 == ~wl_pc~0; 882#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 826#L605 assume !(1 == ~c1_pc~0); 802#L615 assume !(1 == ~c2_pc~0); 804#L624 assume !(1 == ~wb_pc~0); 873#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 906#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 842#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 812#L652-1 assume !(1 == ~e_g~0); 813#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 903#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 904#L667-1 assume 0 == ~wl_st~0; 796#L684-1 [2021-12-19 19:17:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-12-19 19:17:09,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282771383] [2021-12-19 19:17:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,204 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-19 19:17:09,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282771383] [2021-12-19 19:17:09,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282771383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:09,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851462604] [2021-12-19 19:17:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,206 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 1 times [2021-12-19 19:17:09,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136474112] [2021-12-19 19:17:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,227 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-19 19:17:09,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136474112] [2021-12-19 19:17:09,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136474112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:09,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526924058] [2021-12-19 19:17:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,229 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:17:09,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:09,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:09,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:09,230 INFO L87 Difference]: Start difference. First operand 126 states and 218 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-19 19:17:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:09,239 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2021-12-19 19:17:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:09,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 217 transitions. [2021-12-19 19:17:09,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:09,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 217 transitions. [2021-12-19 19:17:09,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-19 19:17:09,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-19 19:17:09,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 217 transitions. [2021-12-19 19:17:09,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:17:09,245 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2021-12-19 19:17:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 217 transitions. [2021-12-19 19:17:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-19 19:17:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 125 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-19 19:17:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2021-12-19 19:17:09,251 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2021-12-19 19:17:09,251 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2021-12-19 19:17:09,251 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 19:17:09,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 217 transitions. [2021-12-19 19:17:09,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-19 19:17:09,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:09,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:09,253 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-19 19:17:09,253 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-19 19:17:09,253 INFO L791 eck$LassoCheckResult]: Stem: 1177#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(11, 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; 1130#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; 1086#L416 assume !(1 == ~c_req_up~0); 1088#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1146#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1147#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1113#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1114#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1129#L447-1 assume !(0 == ~e_f~0); 1117#L452-1 assume !(0 == ~e_g~0); 1064#L457-1 assume !(0 == ~e_e~0); 1065#L462-1 assume !(0 == ~e_c~0); 1096#L467-1 assume !(0 == ~e_wl~0); 1097#L472-1 assume !(1 == ~wl_pc~0); 1172#L484 assume !(2 == ~wl_pc~0); 1168#L485 assume !(1 == ~c1_pc~0); 1098#L495 assume !(1 == ~c2_pc~0); 1100#L504 assume !(1 == ~wb_pc~0); 1156#L513 assume !(1 == ~e_c~0); 1077#L522-1 assume !(1 == ~e_e~0); 1078#L527-1 assume !(1 == ~e_f~0); 1118#L532-1 assume !(1 == ~e_g~0); 1119#L537-1 assume !(1 == ~e_c~0); 1140#L542-1 assume !(1 == ~e_wl~0); 1055#L684-1 [2021-12-19 19:17:09,253 INFO L793 eck$LassoCheckResult]: Loop: 1055#L684-1 assume !false; 1174#L554 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; 1082#L389 assume !false; 1083#L307 assume !(0 == ~wl_st~0); 1135#L311 assume !(0 == ~c1_st~0); 1136#L314 assume !(0 == ~c2_st~0); 1056#L317 assume !(0 == ~wb_st~0); 1058#L320 assume !(0 == ~r_st~0); 1159#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1093#L560 assume !(1 == ~c_req_up~0); 1095#L560-2 start_simulation_~kernel_st~0#1 := 3; 1171#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1091#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1092#L577-1 assume !(0 == ~e_e~0); 1111#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1112#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1126#L592-1 assume 1 == ~wl_pc~0; 1141#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1085#L605 assume !(1 == ~c1_pc~0); 1061#L615 assume !(1 == ~c2_pc~0); 1063#L624 assume !(1 == ~wb_pc~0); 1132#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1165#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1101#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1071#L652-1 assume !(1 == ~e_g~0); 1072#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1162#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1163#L667-1 assume 0 == ~wl_st~0; 1055#L684-1 [2021-12-19 19:17:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-12-19 19:17:09,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264003892] [2021-12-19 19:17:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:09,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:09,292 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 2 times [2021-12-19 19:17:09,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385248417] [2021-12-19 19:17:09,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,310 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-19 19:17:09,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385248417] [2021-12-19 19:17:09,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385248417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:09,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920511245] [2021-12-19 19:17:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,312 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:17:09,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:09,313 INFO L87 Difference]: Start difference. First operand 126 states and 217 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-19 19:17:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:09,346 INFO L93 Difference]: Finished difference Result 160 states and 279 transitions. [2021-12-19 19:17:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:09,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 279 transitions. [2021-12-19 19:17:09,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-19 19:17:09,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 279 transitions. [2021-12-19 19:17:09,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2021-12-19 19:17:09,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2021-12-19 19:17:09,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 279 transitions. [2021-12-19 19:17:09,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:17:09,354 INFO L681 BuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2021-12-19 19:17:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 279 transitions. [2021-12-19 19:17:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-19 19:17:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 160 states have (on average 1.74375) internal successors, (279), 159 states have internal predecessors, (279), 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-19 19:17:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 279 transitions. [2021-12-19 19:17:09,361 INFO L704 BuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2021-12-19 19:17:09,361 INFO L587 BuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2021-12-19 19:17:09,361 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 19:17:09,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 279 transitions. [2021-12-19 19:17:09,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-19 19:17:09,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:09,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:09,363 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-19 19:17:09,363 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-19 19:17:09,364 INFO L791 eck$LassoCheckResult]: Stem: 1473#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(11, 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; 1425#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; 1378#L416 assume !(1 == ~c_req_up~0); 1380#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1441#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1442#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1406#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1407#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1424#L447-1 assume !(0 == ~e_f~0); 1410#L452-1 assume 0 == ~e_g~0;~e_g~0 := 1; 1411#L457-1 assume !(0 == ~e_e~0); 1502#L462-1 assume !(0 == ~e_c~0); 1501#L467-1 assume !(0 == ~e_wl~0); 1500#L472-1 assume !(1 == ~wl_pc~0); 1498#L484 assume !(2 == ~wl_pc~0); 1496#L485 assume !(1 == ~c1_pc~0); 1391#L495 assume !(1 == ~c2_pc~0); 1393#L504 assume !(1 == ~wb_pc~0); 1451#L513 assume !(1 == ~e_c~0); 1369#L522-1 assume !(1 == ~e_e~0); 1370#L527-1 assume !(1 == ~e_f~0); 1412#L532-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1413#L537-1 assume !(1 == ~e_c~0); 1435#L542-1 assume !(1 == ~e_wl~0); 1347#L684-1 [2021-12-19 19:17:09,364 INFO L793 eck$LassoCheckResult]: Loop: 1347#L684-1 assume !false; 1470#L554 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; 1374#L389 assume !false; 1375#L307 assume !(0 == ~wl_st~0); 1430#L311 assume !(0 == ~c1_st~0); 1431#L314 assume !(0 == ~c2_st~0); 1348#L317 assume !(0 == ~wb_st~0); 1350#L320 assume !(0 == ~r_st~0); 1454#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1386#L560 assume !(1 == ~c_req_up~0); 1388#L560-2 start_simulation_~kernel_st~0#1 := 3; 1466#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1383#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1384#L577-1 assume !(0 == ~e_e~0); 1503#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1420#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1421#L592-1 assume !(1 == ~wl_pc~0); 1429#L604 assume !(2 == ~wl_pc~0); 1377#L605 assume !(1 == ~c1_pc~0); 1353#L615 assume !(1 == ~c2_pc~0); 1355#L624 assume !(1 == ~wb_pc~0); 1427#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1461#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1394#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1363#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1364#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1457#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1458#L667-1 assume 0 == ~wl_st~0; 1347#L684-1 [2021-12-19 19:17:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2021-12-19 19:17:09,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690947191] [2021-12-19 19:17:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,389 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-19 19:17:09,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690947191] [2021-12-19 19:17:09,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690947191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 19:17:09,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135483019] [2021-12-19 19:17:09,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,391 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:09,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1432528190, now seen corresponding path program 1 times [2021-12-19 19:17:09,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655293862] [2021-12-19 19:17:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,432 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-19 19:17:09,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655293862] [2021-12-19 19:17:09,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655293862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 19:17:09,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404081568] [2021-12-19 19:17:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,433 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:17:09,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 19:17:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 19:17:09,434 INFO L87 Difference]: Start difference. First operand 160 states and 279 transitions. cyclomatic complexity: 120 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-19 19:17:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:09,528 INFO L93 Difference]: Finished difference Result 226 states and 380 transitions. [2021-12-19 19:17:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 19:17:09,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 380 transitions. [2021-12-19 19:17:09,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2021-12-19 19:17:09,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 380 transitions. [2021-12-19 19:17:09,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2021-12-19 19:17:09,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2021-12-19 19:17:09,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 380 transitions. [2021-12-19 19:17:09,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:17:09,537 INFO L681 BuchiCegarLoop]: Abstraction has 226 states and 380 transitions. [2021-12-19 19:17:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 380 transitions. [2021-12-19 19:17:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 215. [2021-12-19 19:17:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.697674418604651) internal successors, (365), 214 states have internal predecessors, (365), 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-19 19:17:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 365 transitions. [2021-12-19 19:17:09,555 INFO L704 BuchiCegarLoop]: Abstraction has 215 states and 365 transitions. [2021-12-19 19:17:09,555 INFO L587 BuchiCegarLoop]: Abstraction has 215 states and 365 transitions. [2021-12-19 19:17:09,556 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 19:17:09,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 365 transitions. [2021-12-19 19:17:09,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2021-12-19 19:17:09,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:09,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:09,557 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:09,558 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-19 19:17:09,558 INFO L791 eck$LassoCheckResult]: Stem: 1869#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(11, 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; 1818#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; 1776#L416 assume !(1 == ~c_req_up~0); 1778#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1834#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1835#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1801#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1802#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1817#L447-1 assume !(0 == ~e_f~0); 1808#L452-1 assume !(0 == ~e_g~0); 1752#L457-1 assume !(0 == ~e_e~0); 1753#L462-1 assume !(0 == ~e_c~0); 1784#L467-1 assume !(0 == ~e_wl~0); 1785#L472-1 assume !(1 == ~wl_pc~0); 1862#L484 assume !(2 == ~wl_pc~0); 1858#L485 assume !(1 == ~c1_pc~0); 1786#L495 assume !(1 == ~c2_pc~0); 1788#L504 assume !(1 == ~wb_pc~0); 1844#L513 assume !(1 == ~e_c~0); 1876#L522-1 assume !(1 == ~e_e~0); 1874#L527-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1873#L532-1 assume !(1 == ~e_g~0); 1806#L537-1 assume !(1 == ~e_c~0); 1828#L542-1 assume !(1 == ~e_wl~0); 1746#L684-1 [2021-12-19 19:17:09,558 INFO L793 eck$LassoCheckResult]: Loop: 1746#L684-1 assume !false; 1864#L554 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; 1770#L389 assume !false; 1771#L307 assume !(0 == ~wl_st~0); 1823#L311 assume !(0 == ~c1_st~0); 1824#L314 assume !(0 == ~c2_st~0); 1742#L317 assume !(0 == ~wb_st~0); 1744#L320 assume !(0 == ~r_st~0); 1848#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1781#L560 assume !(1 == ~c_req_up~0); 1783#L560-2 start_simulation_~kernel_st~0#1 := 3; 1860#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1779#L572-2 assume !(0 == ~e_g~0); 1780#L577-1 assume !(0 == ~e_e~0); 1799#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1800#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1814#L592-1 assume 1 == ~wl_pc~0; 1829#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1773#L605 assume !(1 == ~c1_pc~0); 1749#L615 assume !(1 == ~c2_pc~0); 1751#L624 assume !(1 == ~wb_pc~0); 1820#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1870#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1872#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1871#L652-1 assume !(1 == ~e_g~0); 1760#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1851#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1852#L667-1 assume 0 == ~wl_st~0; 1746#L684-1 [2021-12-19 19:17:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2021-12-19 19:17:09,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182979366] [2021-12-19 19:17:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:09,581 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-19 19:17:09,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:09,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182979366] [2021-12-19 19:17:09,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182979366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:09,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:09,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 19:17:09,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561787927] [2021-12-19 19:17:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:09,583 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -137740303, now seen corresponding path program 1 times [2021-12-19 19:17:09,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:09,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161321573] [2021-12-19 19:17:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:09,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:09,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:09,598 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:09,851 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:17:09,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:17:09,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:17:09,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:17:09,851 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 19:17:09,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:09,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:17:09,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:17:09,853 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2021-12-19 19:17:09,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:17:09,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:17:09,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:09,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,126 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 19:17:10,126 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 19:17:10,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:10,144 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-19 19:17:10,159 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-19 19:17:10,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:10,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:10,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:10,189 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-19 19:17:10,206 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-19 19:17:10,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:10,208 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-19 19:17:10,209 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-19 19:17:10,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:10,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:10,223 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:10,223 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-19 19:17:10,243 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-19 19:17:10,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:10,248 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-19 19:17:10,249 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-19 19:17:10,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:10,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:10,289 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-19 19:17:10,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:10,290 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-19 19:17:10,292 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-19 19:17:10,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 19:17:10,293 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:10,323 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 19:17:10,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-19 19:17:10,339 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:17:10,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:17:10,340 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:17:10,340 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:17:10,340 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 19:17:10,340 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,340 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:17:10,340 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:17:10,340 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2021-12-19 19:17:10,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:17:10,340 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:17:10,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:10,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 19:17:10,579 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 19:17:10,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:10,581 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-19 19:17:10,582 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-19 19:17:10,583 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-19 19:17:10,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:10,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:10,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:10,590 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:10,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:10,591 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:10,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:10,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:10,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-19 19:17:10,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:10,609 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-19 19:17:10,609 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-19 19:17:10,611 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-19 19:17:10,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:10,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:10,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:10,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:10,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:10,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:10,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:10,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 19:17:10,628 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 19:17:10,628 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 19:17:10,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:10,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:10,630 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-19 19:17:10,631 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-19 19:17:10,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 19:17:10,632 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 19:17:10,632 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 19:17:10,633 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-12-19 19:17:10,675 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-19 19:17:10,677 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 19:17:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:10,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 19:17:10,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 19:17:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:10,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 19:17:10,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 19:17:10,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:10,877 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-19 19:17:10,880 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-19 19:17:10,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 365 transitions. cyclomatic complexity: 152 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-19 19:17:10,948 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 365 transitions. cyclomatic complexity: 152. 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 758 states and 1283 transitions. Complement of second has 5 states. [2021-12-19 19:17:10,949 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-19 19:17:10,950 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-19 19:17:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2021-12-19 19:17:10,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2021-12-19 19:17:10,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:10,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2021-12-19 19:17:10,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:10,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2021-12-19 19:17:10,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:10,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 758 states and 1283 transitions. [2021-12-19 19:17:10,962 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 531 [2021-12-19 19:17:10,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 758 states to 758 states and 1283 transitions. [2021-12-19 19:17:10,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2021-12-19 19:17:10,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2021-12-19 19:17:10,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 758 states and 1283 transitions. [2021-12-19 19:17:10,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:10,968 INFO L681 BuchiCegarLoop]: Abstraction has 758 states and 1283 transitions. [2021-12-19 19:17:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states and 1283 transitions. [2021-12-19 19:17:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 575. [2021-12-19 19:17:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 575 states have (on average 1.6956521739130435) internal successors, (975), 574 states have internal predecessors, (975), 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-19 19:17:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 975 transitions. [2021-12-19 19:17:10,982 INFO L704 BuchiCegarLoop]: Abstraction has 575 states and 975 transitions. [2021-12-19 19:17:10,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 19:17:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 19:17:10,985 INFO L87 Difference]: Start difference. First operand 575 states and 975 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-19 19:17:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:11,050 INFO L93 Difference]: Finished difference Result 1195 states and 1962 transitions. [2021-12-19 19:17:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 19:17:11,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1195 states and 1962 transitions. [2021-12-19 19:17:11,062 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 732 [2021-12-19 19:17:11,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1195 states to 1195 states and 1962 transitions. [2021-12-19 19:17:11,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 818 [2021-12-19 19:17:11,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 818 [2021-12-19 19:17:11,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1195 states and 1962 transitions. [2021-12-19 19:17:11,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:11,069 INFO L681 BuchiCegarLoop]: Abstraction has 1195 states and 1962 transitions. [2021-12-19 19:17:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states and 1962 transitions. [2021-12-19 19:17:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1174. [2021-12-19 19:17:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1174 states have (on average 1.6507666098807496) internal successors, (1938), 1173 states have internal predecessors, (1938), 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-19 19:17:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1938 transitions. [2021-12-19 19:17:11,086 INFO L704 BuchiCegarLoop]: Abstraction has 1174 states and 1938 transitions. [2021-12-19 19:17:11,086 INFO L587 BuchiCegarLoop]: Abstraction has 1174 states and 1938 transitions. [2021-12-19 19:17:11,086 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 19:17:11,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1174 states and 1938 transitions. [2021-12-19 19:17:11,090 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 730 [2021-12-19 19:17:11,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:11,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:11,092 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-19 19:17:11,092 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-19 19:17:11,092 INFO L791 eck$LassoCheckResult]: Stem: 4948#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(11, 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; 4814#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; 4729#L416 assume !(1 == ~c_req_up~0); 4731#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4988#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4987#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4986#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4985#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4984#L447-1 assume !(0 == ~e_f~0); 4983#L452-1 assume !(0 == ~e_g~0); 4982#L457-1 assume !(0 == ~e_e~0); 4981#L462-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4748#L467-1 assume !(0 == ~e_wl~0); 4749#L472-1 assume !(1 == ~wl_pc~0); 4929#L484 assume !(2 == ~wl_pc~0); 4919#L485 assume !(1 == ~c1_pc~0); 4899#L495 assume !(1 == ~c2_pc~0); 4881#L504 assume !(1 == ~wb_pc~0); 4882#L513 assume !(1 == ~e_c~0); 4972#L522-1 assume !(1 == ~e_e~0); 4969#L527-1 assume !(1 == ~e_f~0); 4966#L532-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4792#L537-1 assume !(1 == ~e_c~0); 5089#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4669#L684-1 [2021-12-19 19:17:11,092 INFO L793 eck$LassoCheckResult]: Loop: 4669#L684-1 assume !false; 5325#L554 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; 5322#L389 assume !false; 5319#L307 assume !(0 == ~wl_st~0); 5316#L311 assume !(0 == ~c1_st~0); 5312#L314 assume !(0 == ~c2_st~0); 5313#L317 assume !(0 == ~wb_st~0); 5302#L320 assume !(0 == ~r_st~0); 5298#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 5299#L560 assume !(1 == ~c_req_up~0); 5282#L560-2 start_simulation_~kernel_st~0#1 := 3; 5283#L572 assume !(0 == ~e_f~0); 5690#L572-2 assume !(0 == ~e_g~0); 5689#L577-1 assume !(0 == ~e_e~0); 5683#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4779#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5680#L592-1 assume 1 == ~wl_pc~0; 5681#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5829#L605 assume !(1 == ~c1_pc~0); 5418#L615 assume !(1 == ~c2_pc~0); 5257#L624 assume !(1 == ~wb_pc~0); 5826#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 5825#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 5824#L647-1 assume !(1 == ~e_f~0); 5246#L652-1 assume !(1 == ~e_g~0); 4701#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4894#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4895#L667-1 assume 0 == ~wl_st~0; 4669#L684-1 [2021-12-19 19:17:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2021-12-19 19:17:11,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:11,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971311272] [2021-12-19 19:17:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:11,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:11,135 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-19 19:17:11,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:11,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971311272] [2021-12-19 19:17:11,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971311272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:11,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:11,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 19:17:11,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245882573] [2021-12-19 19:17:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:11,137 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1724241163, now seen corresponding path program 1 times [2021-12-19 19:17:11,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:11,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776183376] [2021-12-19 19:17:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:11,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:11,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:11,145 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:11,329 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:17:11,329 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:17:11,329 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:17:11,329 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:17:11,329 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 19:17:11,329 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:17:11,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:17:11,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2021-12-19 19:17:11,329 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:17:11,329 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:17:11,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 19:17:11,549 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 19:17:11,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:11,550 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-19 19:17:11,551 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-19 19:17:11,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:11,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:11,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:11,574 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-19 19:17:11,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:11,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:11,592 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-19 19:17:11,593 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-19 19:17:11,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:11,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:11,615 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:11,615 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-19 19:17:11,632 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-19 19:17:11,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:11,634 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-19 19:17:11,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:11,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:11,646 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-19 19:17:11,654 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:11,654 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-19 19:17:11,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:11,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:11,672 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-19 19:17:11,673 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-19 19:17:11,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:11,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:11,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:11,696 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-19 19:17:11,711 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-19 19:17:11,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:11,712 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-19 19:17:11,712 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-19 19:17:11,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:11,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:11,723 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:11,723 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-19 19:17:11,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:11,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:11,740 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-19 19:17:11,740 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-19 19:17:11,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:11,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:11,778 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-19 19:17:11,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:11,779 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-19 19:17:11,801 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-19 19:17:11,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 19:17:11,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:11,827 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 19:17:11,842 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-19 19:17:11,843 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:17:11,843 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:17:11,843 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:17:11,843 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:17:11,843 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 19:17:11,843 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:11,843 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:17:11,843 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:17:11,843 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2021-12-19 19:17:11,843 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:17:11,843 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:17:11,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:11,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,046 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 19:17:12,047 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 19:17:12,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:12,048 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-19 19:17:12,049 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-19 19:17:12,051 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-19 19:17:12,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:12,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:12,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:12,057 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:12,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:12,057 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:12,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:12,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:12,103 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-19 19:17:12,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:12,104 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-19 19:17:12,105 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-19 19:17:12,107 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-19 19:17:12,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:12,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:12,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:12,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:12,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:12,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:12,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:12,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:12,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-19 19:17:12,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:12,132 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-19 19:17:12,135 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-19 19:17:12,136 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-19 19:17:12,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:12,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:12,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:12,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:12,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:12,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:12,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:12,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:12,165 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-19 19:17:12,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:12,167 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-19 19:17:12,167 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-19 19:17:12,170 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-19 19:17:12,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:12,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:12,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:12,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:12,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:12,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:12,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:12,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:12,199 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-19 19:17:12,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:12,201 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-19 19:17:12,202 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-19 19:17:12,203 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-19 19:17:12,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:12,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:12,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:12,209 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:12,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:12,209 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:12,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:12,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:12,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:12,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:12,243 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-19 19:17:12,244 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-19 19:17:12,245 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-19 19:17:12,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:12,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:12,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:12,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:12,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:12,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:12,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:12,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 19:17:12,265 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 19:17:12,265 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 19:17:12,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:12,267 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-19 19:17:12,274 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-19 19:17:12,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 19:17:12,275 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 19:17:12,275 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 19:17:12,275 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-12-19 19:17:12,292 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-19 19:17:12,292 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 19:17:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:12,355 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-19 19:17:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:12,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 19:17:12,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 19:17:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:12,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 19:17:12,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 19:17:12,492 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-19 19:17:12,492 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-19 19:17:12,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1174 states and 1938 transitions. cyclomatic complexity: 776 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-19 19:17:12,519 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1174 states and 1938 transitions. cyclomatic complexity: 776. 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 1955 states and 3238 transitions. Complement of second has 5 states. [2021-12-19 19:17:12,519 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-19 19:17:12,519 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-19 19:17:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2021-12-19 19:17:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 24 letters. Loop has 28 letters. [2021-12-19 19:17:12,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 52 letters. Loop has 28 letters. [2021-12-19 19:17:12,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:12,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 24 letters. Loop has 56 letters. [2021-12-19 19:17:12,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:12,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1955 states and 3238 transitions. [2021-12-19 19:17:12,531 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1128 [2021-12-19 19:17:12,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1955 states to 1955 states and 3238 transitions. [2021-12-19 19:17:12,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1206 [2021-12-19 19:17:12,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1215 [2021-12-19 19:17:12,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1955 states and 3238 transitions. [2021-12-19 19:17:12,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:12,540 INFO L681 BuchiCegarLoop]: Abstraction has 1955 states and 3238 transitions. [2021-12-19 19:17:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states and 3238 transitions. [2021-12-19 19:17:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1008. [2021-12-19 19:17:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1008 states have (on average 1.6547619047619047) internal successors, (1668), 1007 states have internal predecessors, (1668), 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-19 19:17:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1668 transitions. [2021-12-19 19:17:12,556 INFO L704 BuchiCegarLoop]: Abstraction has 1008 states and 1668 transitions. [2021-12-19 19:17:12,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 19:17:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 19:17:12,557 INFO L87 Difference]: Start difference. First operand 1008 states and 1668 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-19 19:17:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:12,602 INFO L93 Difference]: Finished difference Result 1032 states and 1681 transitions. [2021-12-19 19:17:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 19:17:12,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1032 states and 1681 transitions. [2021-12-19 19:17:12,607 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 579 [2021-12-19 19:17:12,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1032 states to 1032 states and 1681 transitions. [2021-12-19 19:17:12,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2021-12-19 19:17:12,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2021-12-19 19:17:12,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1032 states and 1681 transitions. [2021-12-19 19:17:12,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:12,611 INFO L681 BuchiCegarLoop]: Abstraction has 1032 states and 1681 transitions. [2021-12-19 19:17:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states and 1681 transitions. [2021-12-19 19:17:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 942. [2021-12-19 19:17:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 942 states have (on average 1.6358811040339702) internal successors, (1541), 941 states have internal predecessors, (1541), 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-19 19:17:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1541 transitions. [2021-12-19 19:17:12,623 INFO L704 BuchiCegarLoop]: Abstraction has 942 states and 1541 transitions. [2021-12-19 19:17:12,623 INFO L587 BuchiCegarLoop]: Abstraction has 942 states and 1541 transitions. [2021-12-19 19:17:12,623 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 19:17:12,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 942 states and 1541 transitions. [2021-12-19 19:17:12,625 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 579 [2021-12-19 19:17:12,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:12,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:12,626 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-19 19:17:12,626 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-19 19:17:12,626 INFO L791 eck$LassoCheckResult]: Stem: 10268#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(11, 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; 10153#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; 10077#L416 assume !(1 == ~c_req_up~0); 10079#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 10258#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 10274#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 10119#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 10120#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 10253#L447-1 assume !(0 == ~e_f~0); 10129#L452-1 assume !(0 == ~e_g~0); 10130#L457-1 assume !(0 == ~e_e~0); 10264#L462-1 assume !(0 == ~e_c~0); 10265#L467-1 assume !(0 == ~e_wl~0); 10248#L472-1 assume !(1 == ~wl_pc~0); 10249#L484 assume !(2 == ~wl_pc~0); 10241#L485 assume !(1 == ~c1_pc~0); 10225#L495 assume !(1 == ~c2_pc~0); 10208#L504 assume !(1 == ~wb_pc~0); 10209#L513 assume !(1 == ~e_c~0); 10277#L522-1 assume !(1 == ~e_e~0); 10276#L527-1 assume !(1 == ~e_f~0); 10275#L532-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10132#L537-1 assume !(1 == ~e_c~0); 10174#L542-1 assume !(1 == ~e_wl~0); 10175#L684-1 assume !false; 10716#L554 [2021-12-19 19:17:12,626 INFO L793 eck$LassoCheckResult]: Loop: 10716#L554 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; 10717#L389 assume !false; 10712#L307 assume !(0 == ~wl_st~0); 10713#L311 assume !(0 == ~c1_st~0); 10708#L314 assume !(0 == ~c2_st~0); 10709#L317 assume !(0 == ~wb_st~0); 10702#L320 assume !(0 == ~r_st~0); 10704#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 10698#L560 assume !(1 == ~c_req_up~0); 10699#L560-2 start_simulation_~kernel_st~0#1 := 3; 10931#L572 assume !(0 == ~e_f~0); 10930#L572-2 assume !(0 == ~e_g~0); 10929#L577-1 assume !(0 == ~e_e~0); 10928#L582-1 assume !(0 == ~e_c~0); 10927#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10926#L592-1 assume 1 == ~wl_pc~0; 10924#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 10921#L605 assume !(1 == ~c1_pc~0); 10920#L615 assume !(1 == ~c2_pc~0); 10918#L624 assume !(1 == ~wb_pc~0); 10916#L633 assume !(1 == ~e_c~0); 10915#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10753#L647-1 assume !(1 == ~e_f~0); 10750#L652-1 assume !(1 == ~e_g~0); 10050#L657-1 assume !(1 == ~e_c~0); 10746#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10726#L667-1 assume 0 == ~wl_st~0; 10724#L684-1 assume !false; 10716#L554 [2021-12-19 19:17:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2021-12-19 19:17:12,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:12,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398331966] [2021-12-19 19:17:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:12,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:12,643 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-19 19:17:12,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:12,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398331966] [2021-12-19 19:17:12,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398331966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:12,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:12,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 19:17:12,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629219687] [2021-12-19 19:17:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:12,644 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1464581643, now seen corresponding path program 1 times [2021-12-19 19:17:12,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:12,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666888256] [2021-12-19 19:17:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:12,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:12,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:12,650 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:12,807 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:17:12,807 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:17:12,807 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:17:12,807 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:17:12,807 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 19:17:12,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:12,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:17:12,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:17:12,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration9_Loop [2021-12-19 19:17:12,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:17:12,807 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:17:12,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:12,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,040 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 19:17:13,041 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 19:17:13,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,042 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-19 19:17:13,043 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-19 19:17:13,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:13,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:13,059 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-19 19:17:13,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-19 19:17:13,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,075 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-19 19:17:13,077 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-19 19:17:13,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:13,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,086 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:13,086 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-19 19:17:13,101 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-19 19:17:13,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,102 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-19 19:17:13,102 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-19 19:17:13,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:13,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,111 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:13,111 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-19 19:17:13,127 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-19 19:17:13,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,128 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-19 19:17:13,129 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-19 19:17:13,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:13,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,141 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:13,141 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-19 19:17:13,155 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-19 19:17:13,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,157 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-19 19:17:13,162 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-19 19:17:13,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:13,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,184 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:13,184 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-19 19:17:13,199 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-19 19:17:13,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,200 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-19 19:17:13,201 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-19 19:17:13,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:13,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,219 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 19:17:13,219 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=4} Honda state: {~wb_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 19:17:13,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-19 19:17:13,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,235 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-19 19:17:13,244 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-19 19:17:13,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:17:13,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,272 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-19 19:17:13,272 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-19 19:17:13,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 19:17:13,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:17:13,300 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 19:17:13,302 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-19 19:17:13,303 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:17:13,303 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:17:13,303 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:17:13,303 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:17:13,303 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 19:17:13,303 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,303 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:17:13,303 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:17:13,303 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration9_Loop [2021-12-19 19:17:13,303 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:17:13,303 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:17:13,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:17:13,489 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 19:17:13,489 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 19:17:13,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,496 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-19 19:17:13,497 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-19 19:17:13,498 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-19 19:17:13,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:13,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:13,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,523 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-19 19:17:13,525 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-19 19:17:13,525 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-19 19:17:13,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,530 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:13,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,531 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:13,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,546 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-19 19:17:13,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,548 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:17:13,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-19 19:17:13,550 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-19 19:17:13,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:13,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:13,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,577 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:17:13,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-19 19:17:13,578 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-19 19:17:13,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,583 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:13,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,584 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:13,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,618 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:17:13,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-19 19:17:13,620 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-19 19:17:13,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,626 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:13,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,626 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:13,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,653 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:17:13,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 19:17:13,655 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-19 19:17:13,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,661 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:13,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,661 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:13,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,680 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:17:13,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-19 19:17:13,682 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-19 19:17:13,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,688 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:13,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,689 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:13,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,710 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:17:13,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-19 19:17:13,712 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-19 19:17:13,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,718 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 19:17:13,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,718 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-19 19:17:13,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-19 19:17:13,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,736 INFO L229 MonitoredProcess]: Starting monitored process 39 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-19 19:17:13,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-19 19:17:13,738 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-19 19:17:13,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:13,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:13,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-19 19:17:13,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,769 INFO L229 MonitoredProcess]: Starting monitored process 40 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-19 19:17:13,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-19 19:17:13,772 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-19 19:17:13,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:13,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:13,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 19:17:13,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:13,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,806 INFO L229 MonitoredProcess]: Starting monitored process 41 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-19 19:17:13,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-19 19:17:13,818 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-19 19:17:13,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 19:17:13,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 19:17:13,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 19:17:13,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 19:17:13,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 19:17:13,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 19:17:13,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 19:17:13,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 19:17:13,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 19:17:13,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 19:17:13,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:17:13,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:17:13,843 INFO L229 MonitoredProcess]: Starting monitored process 42 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-19 19:17:13,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-19 19:17:13,844 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 19:17:13,844 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 19:17:13,845 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 19:17:13,845 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2021-12-19 19:17:13,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-19 19:17:13,860 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 19:17:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:13,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 19:17:13,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 19:17:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:13,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 19:17:13,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 19:17:14,048 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-19 19:17:14,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-19 19:17:14,049 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 942 states and 1541 transitions. cyclomatic complexity: 608 Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-19 19:17:14,072 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 942 states and 1541 transitions. cyclomatic complexity: 608. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 2635 states and 4302 transitions. Complement of second has 5 states. [2021-12-19 19:17:14,073 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-19 19:17:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-19 19:17:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2021-12-19 19:17:14,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2021-12-19 19:17:14,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:14,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2021-12-19 19:17:14,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:14,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2021-12-19 19:17:14,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 19:17:14,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2635 states and 4302 transitions. [2021-12-19 19:17:14,087 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1122 [2021-12-19 19:17:14,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2635 states to 2635 states and 4302 transitions. [2021-12-19 19:17:14,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1202 [2021-12-19 19:17:14,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1223 [2021-12-19 19:17:14,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2635 states and 4302 transitions. [2021-12-19 19:17:14,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:14,102 INFO L681 BuchiCegarLoop]: Abstraction has 2635 states and 4302 transitions. [2021-12-19 19:17:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states and 4302 transitions. [2021-12-19 19:17:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2614. [2021-12-19 19:17:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2614 states have (on average 1.632364192807957) internal successors, (4267), 2613 states have internal predecessors, (4267), 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-19 19:17:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 4267 transitions. [2021-12-19 19:17:14,137 INFO L704 BuchiCegarLoop]: Abstraction has 2614 states and 4267 transitions. [2021-12-19 19:17:14,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 19:17:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 19:17:14,138 INFO L87 Difference]: Start difference. First operand 2614 states and 4267 transitions. 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-19 19:17:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:14,219 INFO L93 Difference]: Finished difference Result 3358 states and 5390 transitions. [2021-12-19 19:17:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 19:17:14,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3358 states and 5390 transitions. [2021-12-19 19:17:14,235 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1296 [2021-12-19 19:17:14,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3358 states to 3358 states and 5390 transitions. [2021-12-19 19:17:14,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1360 [2021-12-19 19:17:14,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1360 [2021-12-19 19:17:14,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3358 states and 5390 transitions. [2021-12-19 19:17:14,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:14,250 INFO L681 BuchiCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2021-12-19 19:17:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states and 5390 transitions. [2021-12-19 19:17:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3358. [2021-12-19 19:17:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3358 states have (on average 1.6051220964860036) internal successors, (5390), 3357 states have internal predecessors, (5390), 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-19 19:17:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 5390 transitions. [2021-12-19 19:17:14,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-19 19:17:14,325 INFO L704 BuchiCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2021-12-19 19:17:14,326 INFO L587 BuchiCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2021-12-19 19:17:14,326 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 19:17:14,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3358 states and 5390 transitions. [2021-12-19 19:17:14,340 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1296 [2021-12-19 19:17:14,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:14,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:14,344 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-19 19:17:14,344 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:14,344 INFO L791 eck$LassoCheckResult]: Stem: 20025#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(11, 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; 19885#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; 19809#L416 assume !(1 == ~c_req_up~0); 19811#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19925#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19926#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19946#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19883#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19884#L447-1 assume !(0 == ~e_f~0); 20045#L452-1 assume !(0 == ~e_g~0); 19769#L457-1 assume !(0 == ~e_e~0); 19770#L462-1 assume !(0 == ~e_c~0); 19825#L467-1 assume !(0 == ~e_wl~0); 19826#L472-1 assume !(1 == ~wl_pc~0); 20040#L484 assume !(2 == ~wl_pc~0); 19982#L485 assume !(1 == ~c1_pc~0); 19827#L495 assume !(1 == ~c2_pc~0); 19829#L504 assume !(1 == ~wb_pc~0); 19951#L513 assume !(1 == ~e_c~0); 19986#L522-1 assume !(1 == ~e_e~0); 20000#L527-1 assume !(1 == ~e_f~0); 19863#L532-1 assume !(1 == ~e_g~0); 19864#L537-1 assume !(1 == ~e_c~0); 19911#L542-1 assume !(1 == ~e_wl~0); 19912#L684-1 assume !false; 20589#L554 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; 21512#L389 [2021-12-19 19:17:14,344 INFO L793 eck$LassoCheckResult]: Loop: 21512#L389 assume !false; 22367#L307 assume 0 == ~wl_st~0; 22354#L320-1 assume !(0 == ~wl_st~0); 22631#L329 assume !(0 == ~c1_st~0); 22497#L344 assume !(0 == ~c2_st~0); 22493#L359 assume !(0 == ~wb_st~0); 22489#L374 assume !(0 == ~r_st~0); 21512#L389 [2021-12-19 19:17:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2021-12-19 19:17:14,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:14,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404336502] [2021-12-19 19:17:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:14,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:14,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:14,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 129447733, now seen corresponding path program 1 times [2021-12-19 19:17:14,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:14,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81974434] [2021-12-19 19:17:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:14,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:14,386 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-19 19:17:14,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:14,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81974434] [2021-12-19 19:17:14,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81974434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:14,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:14,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:14,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444723715] [2021-12-19 19:17:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:14,386 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:17:14,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:14,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:14,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:14,387 INFO L87 Difference]: Start difference. First operand 3358 states and 5390 transitions. cyclomatic complexity: 2068 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 19:17:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:14,421 INFO L93 Difference]: Finished difference Result 5264 states and 8290 transitions. [2021-12-19 19:17:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:14,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5264 states and 8290 transitions. [2021-12-19 19:17:14,439 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2044 [2021-12-19 19:17:14,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5264 states to 5264 states and 8290 transitions. [2021-12-19 19:17:14,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2110 [2021-12-19 19:17:14,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2110 [2021-12-19 19:17:14,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5264 states and 8290 transitions. [2021-12-19 19:17:14,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:14,462 INFO L681 BuchiCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2021-12-19 19:17:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states and 8290 transitions. [2021-12-19 19:17:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 5264. [2021-12-19 19:17:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5264 states, 5264 states have (on average 1.5748480243161094) internal successors, (8290), 5263 states have internal predecessors, (8290), 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-19 19:17:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 8290 transitions. [2021-12-19 19:17:14,570 INFO L704 BuchiCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2021-12-19 19:17:14,570 INFO L587 BuchiCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2021-12-19 19:17:14,570 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 19:17:14,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5264 states and 8290 transitions. [2021-12-19 19:17:14,580 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2044 [2021-12-19 19:17:14,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:14,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:14,588 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-19 19:17:14,588 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:14,588 INFO L791 eck$LassoCheckResult]: Stem: 28670#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(11, 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; 28522#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; 28444#L416 assume !(1 == ~c_req_up~0); 28446#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 28656#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 28685#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 28684#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 28520#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 28521#L447-1 assume !(0 == ~e_f~0); 28681#L452-1 assume !(0 == ~e_g~0); 28397#L457-1 assume !(0 == ~e_e~0); 28398#L462-1 assume !(0 == ~e_c~0); 28457#L467-1 assume !(0 == ~e_wl~0); 28458#L472-1 assume !(1 == ~wl_pc~0); 28691#L484 assume !(2 == ~wl_pc~0); 28629#L485 assume !(1 == ~c1_pc~0); 28613#L495 assume !(1 == ~c2_pc~0); 28687#L504 assume !(1 == ~wb_pc~0); 28632#L513 assume !(1 == ~e_c~0); 28428#L522-1 assume !(1 == ~e_e~0); 28429#L527-1 assume !(1 == ~e_f~0); 28682#L532-1 assume !(1 == ~e_g~0); 28616#L537-1 assume !(1 == ~e_c~0); 28545#L542-1 assume !(1 == ~e_wl~0); 28546#L684-1 assume !false; 30832#L554 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; 31437#L389 [2021-12-19 19:17:14,588 INFO L793 eck$LassoCheckResult]: Loop: 31437#L389 assume !false; 32648#L307 assume 0 == ~wl_st~0; 32416#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 32633#L333 assume !(0 != eval_~tmp~0#1); 32642#L329 assume !(0 == ~c1_st~0); 32672#L344 assume !(0 == ~c2_st~0); 32664#L359 assume !(0 == ~wb_st~0); 32656#L374 assume !(0 == ~r_st~0); 31437#L389 [2021-12-19 19:17:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2021-12-19 19:17:14,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:14,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961983346] [2021-12-19 19:17:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:14,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:14,593 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:14,598 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1292266880, now seen corresponding path program 1 times [2021-12-19 19:17:14,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:14,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986346982] [2021-12-19 19:17:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:14,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:14,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:14,616 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 373312376, now seen corresponding path program 1 times [2021-12-19 19:17:14,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:14,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720328252] [2021-12-19 19:17:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:14,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:14,643 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-19 19:17:14,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:14,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720328252] [2021-12-19 19:17:14,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720328252] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:14,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:14,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:14,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703888324] [2021-12-19 19:17:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:14,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:14,669 INFO L87 Difference]: Start difference. First operand 5264 states and 8290 transitions. cyclomatic complexity: 3062 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-19 19:17:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:14,714 INFO L93 Difference]: Finished difference Result 8154 states and 12722 transitions. [2021-12-19 19:17:14,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:14,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8154 states and 12722 transitions. [2021-12-19 19:17:14,738 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 3194 [2021-12-19 19:17:14,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8154 states to 8154 states and 12722 transitions. [2021-12-19 19:17:14,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3262 [2021-12-19 19:17:14,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2021-12-19 19:17:14,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8154 states and 12722 transitions. [2021-12-19 19:17:14,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:14,820 INFO L681 BuchiCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2021-12-19 19:17:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8154 states and 12722 transitions. [2021-12-19 19:17:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8154 to 8154. [2021-12-19 19:17:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8154 states, 8154 states have (on average 1.5602158449840569) internal successors, (12722), 8153 states have internal predecessors, (12722), 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-19 19:17:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 12722 transitions. [2021-12-19 19:17:14,962 INFO L704 BuchiCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2021-12-19 19:17:14,962 INFO L587 BuchiCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2021-12-19 19:17:14,962 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 19:17:14,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8154 states and 12722 transitions. [2021-12-19 19:17:14,987 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 3194 [2021-12-19 19:17:14,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:14,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:14,988 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-19 19:17:14,988 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:14,988 INFO L791 eck$LassoCheckResult]: Stem: 42094#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(11, 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; 41948#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; 41865#L416 assume !(1 == ~c_req_up~0); 41867#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 41989#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 41990#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 42010#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 41946#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 41947#L447-1 assume !(0 == ~e_f~0); 42111#L452-1 assume !(0 == ~e_g~0); 41823#L457-1 assume !(0 == ~e_e~0); 41824#L462-1 assume !(0 == ~e_c~0); 41883#L467-1 assume !(0 == ~e_wl~0); 41884#L472-1 assume !(1 == ~wl_pc~0); 42107#L484 assume !(2 == ~wl_pc~0); 42047#L485 assume !(1 == ~c1_pc~0); 41885#L495 assume !(1 == ~c2_pc~0); 41887#L504 assume !(1 == ~wb_pc~0); 42016#L513 assume !(1 == ~e_c~0); 42052#L522-1 assume !(1 == ~e_e~0); 42069#L527-1 assume !(1 == ~e_f~0); 41923#L532-1 assume !(1 == ~e_g~0); 41924#L537-1 assume !(1 == ~e_c~0); 42038#L542-1 assume !(1 == ~e_wl~0); 44028#L684-1 assume !false; 44029#L554 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; 47350#L389 [2021-12-19 19:17:14,988 INFO L793 eck$LassoCheckResult]: Loop: 47350#L389 assume !false; 47412#L307 assume 0 == ~wl_st~0; 47380#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 47376#L333 assume !(0 != eval_~tmp~0#1); 47408#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 47429#L348 assume !(0 != eval_~tmp___0~0#1); 47428#L344 assume !(0 == ~c2_st~0); 47422#L359 assume !(0 == ~wb_st~0); 47417#L374 assume !(0 == ~r_st~0); 47350#L389 [2021-12-19 19:17:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2021-12-19 19:17:14,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:14,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527686998] [2021-12-19 19:17:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:14,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1353841090, now seen corresponding path program 1 times [2021-12-19 19:17:15,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:15,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589517603] [2021-12-19 19:17:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:15,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,030 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:15,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1363944758, now seen corresponding path program 1 times [2021-12-19 19:17:15,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:15,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462083927] [2021-12-19 19:17:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:15,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:15,063 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-19 19:17:15,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462083927] [2021-12-19 19:17:15,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462083927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:15,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:15,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:15,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483413309] [2021-12-19 19:17:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:15,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:15,106 INFO L87 Difference]: Start difference. First operand 8154 states and 12722 transitions. cyclomatic complexity: 4604 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-19 19:17:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:15,150 INFO L93 Difference]: Finished difference Result 12961 states and 20031 transitions. [2021-12-19 19:17:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:15,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12961 states and 20031 transitions. [2021-12-19 19:17:15,262 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2021-12-19 19:17:15,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12961 states to 12961 states and 20031 transitions. [2021-12-19 19:17:15,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5220 [2021-12-19 19:17:15,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5220 [2021-12-19 19:17:15,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12961 states and 20031 transitions. [2021-12-19 19:17:15,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:15,296 INFO L681 BuchiCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2021-12-19 19:17:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states and 20031 transitions. [2021-12-19 19:17:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2021-12-19 19:17:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12961 states have (on average 1.5454826016511072) internal successors, (20031), 12960 states have internal predecessors, (20031), 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-19 19:17:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 20031 transitions. [2021-12-19 19:17:15,443 INFO L704 BuchiCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2021-12-19 19:17:15,443 INFO L587 BuchiCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2021-12-19 19:17:15,443 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 19:17:15,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12961 states and 20031 transitions. [2021-12-19 19:17:15,522 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2021-12-19 19:17:15,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:15,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:15,522 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-19 19:17:15,523 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:15,523 INFO L791 eck$LassoCheckResult]: Stem: 63235#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(11, 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; 63070#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; 62989#L416 assume !(1 == ~c_req_up~0); 62991#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 63214#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 63143#L432-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 63144#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 63068#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63069#L447-1 assume !(0 == ~e_f~0); 65402#L452-1 assume !(0 == ~e_g~0); 65400#L457-1 assume !(0 == ~e_e~0); 65398#L462-1 assume !(0 == ~e_c~0); 63258#L467-1 assume !(0 == ~e_wl~0); 63255#L472-1 assume !(1 == ~wl_pc~0); 63256#L484 assume !(2 == ~wl_pc~0); 63181#L485 assume !(1 == ~c1_pc~0); 63166#L495 assume !(1 == ~c2_pc~0); 63150#L504 assume !(1 == ~wb_pc~0); 63151#L513 assume !(1 == ~e_c~0); 63186#L522-1 assume !(1 == ~e_e~0); 63206#L527-1 assume !(1 == ~e_f~0); 63207#L532-1 assume !(1 == ~e_g~0); 65367#L537-1 assume !(1 == ~e_c~0); 65364#L542-1 assume !(1 == ~e_wl~0); 65361#L684-1 assume !false; 65362#L554 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; 69536#L389 [2021-12-19 19:17:15,523 INFO L793 eck$LassoCheckResult]: Loop: 69536#L389 assume !false; 72687#L307 assume 0 == ~wl_st~0; 72675#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 72661#L333 assume !(0 != eval_~tmp~0#1); 72686#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 72733#L348 assume !(0 != eval_~tmp___0~0#1); 72730#L344 assume !(0 == ~c2_st~0); 72728#L359 assume !(0 == ~wb_st~0); 72696#L374 assume !(0 == ~r_st~0); 69536#L389 [2021-12-19 19:17:15,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2021-12-19 19:17:15,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:15,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206159498] [2021-12-19 19:17:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:15,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:15,536 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-19 19:17:15,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:15,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206159498] [2021-12-19 19:17:15,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206159498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:15,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:15,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:15,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979548742] [2021-12-19 19:17:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:15,539 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:17:15,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1353841090, now seen corresponding path program 2 times [2021-12-19 19:17:15,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:15,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751371084] [2021-12-19 19:17:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:15,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,546 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:15,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:15,581 INFO L87 Difference]: Start difference. First operand 12961 states and 20031 transitions. cyclomatic complexity: 7106 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-19 19:17:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:15,615 INFO L93 Difference]: Finished difference Result 12909 states and 19944 transitions. [2021-12-19 19:17:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:15,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12909 states and 19944 transitions. [2021-12-19 19:17:15,659 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2021-12-19 19:17:15,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12909 states to 12909 states and 19944 transitions. [2021-12-19 19:17:15,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5170 [2021-12-19 19:17:15,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5170 [2021-12-19 19:17:15,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12909 states and 19944 transitions. [2021-12-19 19:17:15,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:15,699 INFO L681 BuchiCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2021-12-19 19:17:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states and 19944 transitions. [2021-12-19 19:17:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12909. [2021-12-19 19:17:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12909 states, 12909 states have (on average 1.5449686265396234) internal successors, (19944), 12908 states have internal predecessors, (19944), 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-19 19:17:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12909 states to 12909 states and 19944 transitions. [2021-12-19 19:17:15,873 INFO L704 BuchiCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2021-12-19 19:17:15,873 INFO L587 BuchiCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2021-12-19 19:17:15,873 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 19:17:15,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12909 states and 19944 transitions. [2021-12-19 19:17:15,929 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2021-12-19 19:17:15,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:15,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:15,929 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-19 19:17:15,930 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:15,930 INFO L791 eck$LassoCheckResult]: Stem: 89090#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(11, 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; 88945#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; 88866#L416 assume !(1 == ~c_req_up~0); 88868#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 88989#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 88990#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 89009#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 88943#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 88944#L447-1 assume !(0 == ~e_f~0); 89109#L452-1 assume !(0 == ~e_g~0); 88823#L457-1 assume !(0 == ~e_e~0); 88824#L462-1 assume !(0 == ~e_c~0); 88882#L467-1 assume !(0 == ~e_wl~0); 88883#L472-1 assume !(1 == ~wl_pc~0); 89104#L484 assume !(2 == ~wl_pc~0); 89044#L485 assume !(1 == ~c1_pc~0); 88884#L495 assume !(1 == ~c2_pc~0); 88886#L504 assume !(1 == ~wb_pc~0); 89016#L513 assume !(1 == ~e_c~0); 89047#L522-1 assume !(1 == ~e_e~0); 89066#L527-1 assume !(1 == ~e_f~0); 88920#L532-1 assume !(1 == ~e_g~0); 88921#L537-1 assume !(1 == ~e_c~0); 88973#L542-1 assume !(1 == ~e_wl~0); 88974#L684-1 assume !false; 91954#L554 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; 97100#L389 [2021-12-19 19:17:15,930 INFO L793 eck$LassoCheckResult]: Loop: 97100#L389 assume !false; 97096#L307 assume 0 == ~wl_st~0; 97057#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 97053#L333 assume !(0 != eval_~tmp~0#1); 97088#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 97126#L348 assume !(0 != eval_~tmp___0~0#1); 97125#L344 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 97099#L363 assume !(0 != eval_~tmp___1~0#1); 97120#L359 assume !(0 == ~wb_st~0); 97106#L374 assume !(0 == ~r_st~0); 97100#L389 [2021-12-19 19:17:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2021-12-19 19:17:15,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:15,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326952417] [2021-12-19 19:17:15,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:15,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,953 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash -982249908, now seen corresponding path program 1 times [2021-12-19 19:17:15,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:15,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44966470] [2021-12-19 19:17:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:15,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:15,957 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 665734724, now seen corresponding path program 1 times [2021-12-19 19:17:15,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:15,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936997278] [2021-12-19 19:17:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:15,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:17:15,983 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-19 19:17:15,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:17:15,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936997278] [2021-12-19 19:17:15,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936997278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:17:15,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:17:15,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:17:15,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214521172] [2021-12-19 19:17:15,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:17:16,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:17:16,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:17:16,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:17:16,024 INFO L87 Difference]: Start difference. First operand 12909 states and 19944 transitions. cyclomatic complexity: 7071 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-19 19:17:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:17:16,075 INFO L93 Difference]: Finished difference Result 20133 states and 30924 transitions. [2021-12-19 19:17:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:17:16,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20133 states and 30924 transitions. [2021-12-19 19:17:16,168 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 8032 [2021-12-19 19:17:16,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20133 states to 20133 states and 30924 transitions. [2021-12-19 19:17:16,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8104 [2021-12-19 19:17:16,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8104 [2021-12-19 19:17:16,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20133 states and 30924 transitions. [2021-12-19 19:17:16,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 19:17:16,218 INFO L681 BuchiCegarLoop]: Abstraction has 20133 states and 30924 transitions. [2021-12-19 19:17:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20133 states and 30924 transitions. [2021-12-19 19:17:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20133 to 20013. [2021-12-19 19:17:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20013 states have (on average 1.5391995203117974) internal successors, (30804), 20012 states have internal predecessors, (30804), 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-19 19:17:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 30804 transitions. [2021-12-19 19:17:16,455 INFO L704 BuchiCegarLoop]: Abstraction has 20013 states and 30804 transitions. [2021-12-19 19:17:16,455 INFO L587 BuchiCegarLoop]: Abstraction has 20013 states and 30804 transitions. [2021-12-19 19:17:16,455 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-19 19:17:16,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20013 states and 30804 transitions. [2021-12-19 19:17:16,507 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7984 [2021-12-19 19:17:16,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:17:16,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:17:16,512 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-19 19:17:16,512 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:17:16,512 INFO L791 eck$LassoCheckResult]: Stem: 122155#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(11, 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; 121994#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; 121913#L416 assume !(1 == ~c_req_up~0); 121915#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 122041#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 122042#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 122064#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 121992#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 121993#L447-1 assume !(0 == ~e_f~0); 122183#L452-1 assume !(0 == ~e_g~0); 121870#L457-1 assume !(0 == ~e_e~0); 121871#L462-1 assume !(0 == ~e_c~0); 121930#L467-1 assume !(0 == ~e_wl~0); 121931#L472-1 assume !(1 == ~wl_pc~0); 122179#L484 assume !(2 == ~wl_pc~0); 122105#L485 assume !(1 == ~c1_pc~0); 121932#L495 assume !(1 == ~c2_pc~0); 121934#L504 assume !(1 == ~wb_pc~0); 122071#L513 assume !(1 == ~e_c~0); 122110#L522-1 assume !(1 == ~e_e~0); 122127#L527-1 assume !(1 == ~e_f~0); 121969#L532-1 assume !(1 == ~e_g~0); 121970#L537-1 assume !(1 == ~e_c~0); 122094#L542-1 assume !(1 == ~e_wl~0); 127270#L684-1 assume !false; 127271#L554 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; 134004#L389 [2021-12-19 19:17:16,512 INFO L793 eck$LassoCheckResult]: Loop: 134004#L389 assume !false; 134700#L307 assume 0 == ~wl_st~0; 134697#L320-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 134672#L333 assume !(0 != eval_~tmp~0#1); 134694#L329 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 135041#L348 assume !(0 != eval_~tmp___0~0#1); 135040#L344 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 135038#L363 assume !(0 != eval_~tmp___1~0#1); 135037#L359 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 135021#L378 assume !(0 != eval_~tmp___2~0#1); 135034#L374 assume !(0 == ~r_st~0); 134004#L389 [2021-12-19 19:17:16,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2021-12-19 19:17:16,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:16,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416452655] [2021-12-19 19:17:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:16,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:16,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:16,526 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash -385011466, now seen corresponding path program 1 times [2021-12-19 19:17:16,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:16,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11699889] [2021-12-19 19:17:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:16,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:16,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:16,532 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:17:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash -837095426, now seen corresponding path program 1 times [2021-12-19 19:17:16,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:17:16,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259943014] [2021-12-19 19:17:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:17:16,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:17:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:16,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:17:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:17:16,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:17:17,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.12 07:17:17 BoogieIcfgContainer [2021-12-19 19:17:17,289 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-19 19:17:17,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 19:17:17,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 19:17:17,289 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 19:17:17,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 07:17:08" (3/4) ... [2021-12-19 19:17:17,291 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-19 19:17:17,319 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-19 19:17:17,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 19:17:17,319 INFO L158 Benchmark]: Toolchain (without parser) took 9545.18ms. Allocated memory was 86.0MB in the beginning and 727.7MB in the end (delta: 641.7MB). Free memory was 55.6MB in the beginning and 436.5MB in the end (delta: -381.0MB). Peak memory consumption was 261.4MB. Max. memory is 16.1GB. [2021-12-19 19:17:17,319 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 19:17:17,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.23ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 59.3MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 19:17:17,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.29ms. Allocated memory is still 86.0MB. Free memory was 59.3MB in the beginning and 57.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 19:17:17,320 INFO L158 Benchmark]: Boogie Preprocessor took 20.08ms. Allocated memory is still 86.0MB. Free memory was 57.0MB in the beginning and 54.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 19:17:17,320 INFO L158 Benchmark]: RCFGBuilder took 481.38ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 54.9MB in the beginning and 82.9MB in the end (delta: -28.0MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2021-12-19 19:17:17,320 INFO L158 Benchmark]: BuchiAutomizer took 8736.46ms. Allocated memory was 111.1MB in the beginning and 727.7MB in the end (delta: 616.6MB). Free memory was 82.9MB in the beginning and 439.7MB in the end (delta: -356.8MB). Peak memory consumption was 376.1MB. Max. memory is 16.1GB. [2021-12-19 19:17:17,320 INFO L158 Benchmark]: Witness Printer took 29.82ms. Allocated memory is still 727.7MB. Free memory was 439.7MB in the beginning and 436.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-19 19:17:17,322 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 86.0MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.23ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 59.3MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.29ms. Allocated memory is still 86.0MB. Free memory was 59.3MB in the beginning and 57.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.08ms. Allocated memory is still 86.0MB. Free memory was 57.0MB in the beginning and 54.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.38ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 54.9MB in the beginning and 82.9MB in the end (delta: -28.0MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 8736.46ms. Allocated memory was 111.1MB in the beginning and 727.7MB in the end (delta: 616.6MB). Free memory was 82.9MB in the beginning and 439.7MB in the end (delta: -356.8MB). Peak memory consumption was 376.1MB. Max. memory is 16.1GB. * Witness Printer took 29.82ms. Allocated memory is still 727.7MB. Free memory was 439.7MB in the beginning and 436.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 17 terminating modules (14 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 -2 * e_e + 3 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 20013 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 1393 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had 20013 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4135 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4132 mSDsluCounter, 6565 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2288 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 4277 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital83 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf100 smp100 dnf211 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 306]: 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@7b25b3b9=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@472bc1a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@654f4c8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65d2ac33=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b663bda=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: 306]: 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 ; [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 [L416] COND FALSE !((int )c_req_up == 1) [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 [L452] COND FALSE !((int )e_f == 0) [L457] COND FALSE !((int )e_g == 0) [L462] COND FALSE !((int )e_e == 0) [L467] COND FALSE !((int )e_c == 0) [L472] COND FALSE !((int )e_wl == 0) [L477] COND FALSE !((int )wl_pc == 1) [L485] COND FALSE !((int )wl_pc == 2) [L495] COND FALSE !((int )c1_pc == 1) [L504] COND FALSE !((int )c2_pc == 1) [L513] COND FALSE !((int )wb_pc == 1) [L522] COND FALSE !((int )e_c == 1) [L527] COND FALSE !((int )e_e == 1) [L532] COND FALSE !((int )e_f == 1) [L537] COND FALSE !((int )e_g == 1) [L542] COND FALSE !((int )e_c == 1) [L547] COND FALSE !((int )e_wl == 1) [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; Loop: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-19 19:17:17,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- 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)