./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/toy2.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 a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:43:16,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:43:16,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:43:16,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:43:16,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:43:16,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:43:16,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:43:16,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:43:16,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:43:16,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:43:16,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:43:16,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:43:16,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:43:16,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:43:16,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:43:16,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:43:16,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:43:16,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:43:16,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:43:16,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:43:16,223 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:43:16,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:43:16,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:43:16,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:43:16,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:43:16,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:43:16,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:43:16,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:43:16,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:43:16,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:43:16,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:43:16,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:43:16,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:43:16,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:43:16,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:43:16,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:43:16,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:43:16,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:43:16,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:43:16,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:43:16,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:43:16,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:43:16,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:43:16,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:43:16,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:43:16,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:43:16,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:43:16,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:43:16,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:43:16,298 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:43:16,298 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:43:16,298 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:43:16,299 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:43:16,299 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:43:16,299 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:43:16,299 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:43:16,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:43:16,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:43:16,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:43:16,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:43:16,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:43:16,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:43:16,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:43:16,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:43:16,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:43:16,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:43:16,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:43:16,302 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:43:16,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:43:16,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:43:16,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:43:16,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:43:16,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:43:16,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:43:16,305 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:43:16,305 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 -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2022-07-22 02:43:16,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:43:16,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:43:16,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:43:16,680 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:43:16,680 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:43:16,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2022-07-22 02:43:16,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813f05339/1231f3f8155341e885ac7b2a88d644d7/FLAG4e38476c7 [2022-07-22 02:43:17,260 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:43:17,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2022-07-22 02:43:17,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813f05339/1231f3f8155341e885ac7b2a88d644d7/FLAG4e38476c7 [2022-07-22 02:43:17,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813f05339/1231f3f8155341e885ac7b2a88d644d7 [2022-07-22 02:43:17,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:43:17,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:43:17,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:43:17,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:43:17,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:43:17,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:43:17" (1/1) ... [2022-07-22 02:43:17,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b506281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:17, skipping insertion in model container [2022-07-22 02:43:17,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:43:17" (1/1) ... [2022-07-22 02:43:17,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:43:17,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:43:17,940 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/toy2.cil.c[698,711] [2022-07-22 02:43:18,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:43:18,043 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:43:18,053 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/toy2.cil.c[698,711] [2022-07-22 02:43:18,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:43:18,106 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:43:18,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18 WrapperNode [2022-07-22 02:43:18,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:43:18,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:43:18,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:43:18,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:43:18,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,158 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 356 [2022-07-22 02:43:18,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:43:18,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:43:18,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:43:18,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:43:18,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:43:18,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:43:18,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:43:18,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:43:18,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (1/1) ... [2022-07-22 02:43:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:18,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:18,236 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) [2022-07-22 02:43:18,242 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 [2022-07-22 02:43:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:43:18,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:43:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:43:18,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:43:18,369 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:43:18,370 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:43:18,727 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:43:18,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:43:18,734 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 02:43:18,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:43:18 BoogieIcfgContainer [2022-07-22 02:43:18,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:43:18,737 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:43:18,737 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:43:18,740 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:43:18,747 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:43:18,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:43:17" (1/3) ... [2022-07-22 02:43:18,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52bb31e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:43:18, skipping insertion in model container [2022-07-22 02:43:18,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:43:18,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:18" (2/3) ... [2022-07-22 02:43:18,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52bb31e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:43:18, skipping insertion in model container [2022-07-22 02:43:18,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:43:18,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:43:18" (3/3) ... [2022-07-22 02:43:18,751 INFO L354 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2022-07-22 02:43:18,811 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:43:18,811 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:43:18,812 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:43:18,812 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:43:18,812 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:43:18,812 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:43:18,812 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:43:18,813 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:43:18,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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) [2022-07-22 02:43:18,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:18,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:18,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:18,867 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:18,867 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:18,867 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:43:18,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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) [2022-07-22 02:43:18,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:18,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:18,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:18,888 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:18,889 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:18,896 INFO L752 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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; 113#L404true assume !(1 == ~c_req_up~0); 66#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 25#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 55#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 89#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 43#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 31#L440-1true assume !(0 == ~e_g~0); 48#L445-1true assume !(0 == ~e_e~0); 51#L450-1true assume !(0 == ~e_c~0); 24#L455-1true assume !(0 == ~e_wl~0); 81#L460-1true assume !(1 == ~wl_pc~0); 38#L472true assume !(2 == ~wl_pc~0); 122#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 114#L492true assume !(1 == ~wb_pc~0); 57#L501true assume !(1 == ~e_c~0); 36#L510-1true assume !(1 == ~e_e~0); 26#L515-1true assume !(1 == ~e_f~0); 15#L520-1true assume !(1 == ~e_g~0); 49#L525-1true assume !(1 == ~e_c~0); 86#L530-1true assume !(1 == ~e_wl~0); 68#L672-1true [2022-07-22 02:43:18,898 INFO L754 eck$LassoCheckResult]: Loop: 68#L672-1true assume !false; 8#L542true 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; 127#L377true assume !true; 23#L393true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 67#L548true assume !(1 == ~c_req_up~0); 11#L548-2true start_simulation_~kernel_st~0#1 := 3; 28#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 19#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 128#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 39#L575-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 123#L580-1true assume 1 == ~wl_pc~0; 101#L586true assume 1 == ~e_wl~0;~wl_st~0 := 0; 84#L593true assume !(1 == ~c1_pc~0); 115#L603true assume !(1 == ~c2_pc~0); 4#L612true assume !(1 == ~wb_pc~0); 65#L621true assume !(1 == ~e_c~0); 63#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 130#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 129#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 13#L650-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 44#L655-1true assume 0 == ~wl_st~0; 68#L672-1true [2022-07-22 02:43:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2022-07-22 02:43:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:18,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525837311] [2022-07-22 02:43:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525837311] [2022-07-22 02:43:19,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525837311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021568754] [2022-07-22 02:43:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,083 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1920133393, now seen corresponding path program 1 times [2022-07-22 02:43:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125504122] [2022-07-22 02:43:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125504122] [2022-07-22 02:43:19,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125504122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:43:19,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941194485] [2022-07-22 02:43:19,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,099 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 02:43:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 02:43:19,129 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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) [2022-07-22 02:43:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:19,149 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2022-07-22 02:43:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 02:43:19,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2022-07-22 02:43:19,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2022-07-22 02:43:19,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-22 02:43:19,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-22 02:43:19,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2022-07-22 02:43:19,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:19,173 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-22 02:43:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2022-07-22 02:43:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-22 02:43:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 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) [2022-07-22 02:43:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2022-07-22 02:43:19,207 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-22 02:43:19,208 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-22 02:43:19,208 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:43:19,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2022-07-22 02:43:19,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:19,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:19,213 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,214 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,215 INFO L752 eck$LassoCheckResult]: Stem: 389#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; 346#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; 347#L404 assume !(1 == ~c_req_up~0); 367#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 314#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 315#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 360#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 343#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 344#L435-1 assume !(0 == ~e_f~0); 323#L440-1 assume !(0 == ~e_g~0); 324#L445-1 assume !(0 == ~e_e~0); 350#L450-1 assume !(0 == ~e_c~0); 312#L455-1 assume !(0 == ~e_wl~0); 313#L460-1 assume !(1 == ~wl_pc~0); 332#L472 assume !(2 == ~wl_pc~0); 333#L473 assume !(1 == ~c1_pc~0); 384#L483 assume !(1 == ~c2_pc~0); 298#L492 assume !(1 == ~wb_pc~0); 349#L501 assume !(1 == ~e_c~0); 330#L510-1 assume !(1 == ~e_e~0); 316#L515-1 assume !(1 == ~e_f~0); 295#L520-1 assume !(1 == ~e_g~0); 296#L525-1 assume !(1 == ~e_c~0); 351#L530-1 assume !(1 == ~e_wl~0); 293#L672-1 [2022-07-22 02:43:19,220 INFO L754 eck$LassoCheckResult]: Loop: 293#L672-1 assume !false; 281#L542 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; 269#L377 assume !false; 276#L295 assume !(0 == ~wl_st~0); 278#L299 assume !(0 == ~c1_st~0); 342#L302 assume !(0 == ~c2_st~0); 368#L305 assume !(0 == ~wb_st~0); 288#L308 assume !(0 == ~r_st~0); 289#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 311#L548 assume !(1 == ~c_req_up~0); 286#L548-2 start_simulation_~kernel_st~0#1 := 3; 287#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 319#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 305#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 306#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 338#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 339#L580-1 assume !(1 == ~wl_pc~0); 308#L592 assume !(2 == ~wl_pc~0); 309#L593 assume !(1 == ~c1_pc~0); 359#L603 assume !(1 == ~c2_pc~0); 270#L612 assume !(1 == ~wb_pc~0); 272#L621 assume !(1 == ~e_c~0); 364#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 365#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 391#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 388#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 290#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 291#L655-1 assume 0 == ~wl_st~0; 293#L672-1 [2022-07-22 02:43:19,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2022-07-22 02:43:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806526976] [2022-07-22 02:43:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806526976] [2022-07-22 02:43:19,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806526976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745275883] [2022-07-22 02:43:19,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,271 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 1 times [2022-07-22 02:43:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276014225] [2022-07-22 02:43:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276014225] [2022-07-22 02:43:19,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276014225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33376388] [2022-07-22 02:43:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,341 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:19,342 INFO L87 Difference]: Start difference. First operand 124 states and 217 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) [2022-07-22 02:43:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:19,366 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2022-07-22 02:43:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:19,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2022-07-22 02:43:19,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2022-07-22 02:43:19,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-22 02:43:19,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-22 02:43:19,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2022-07-22 02:43:19,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:19,372 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-22 02:43:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2022-07-22 02:43:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-22 02:43:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:43:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2022-07-22 02:43:19,384 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-22 02:43:19,384 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-22 02:43:19,384 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:43:19,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2022-07-22 02:43:19,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:19,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:19,387 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,388 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,388 INFO L752 eck$LassoCheckResult]: Stem: 644#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; 601#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; 602#L404 assume !(1 == ~c_req_up~0); 622#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 569#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 570#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 615#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 599#L435-1 assume !(0 == ~e_f~0); 578#L440-1 assume !(0 == ~e_g~0); 579#L445-1 assume !(0 == ~e_e~0); 605#L450-1 assume !(0 == ~e_c~0); 567#L455-1 assume !(0 == ~e_wl~0); 568#L460-1 assume !(1 == ~wl_pc~0); 587#L472 assume !(2 == ~wl_pc~0); 588#L473 assume !(1 == ~c1_pc~0); 639#L483 assume !(1 == ~c2_pc~0); 553#L492 assume !(1 == ~wb_pc~0); 604#L501 assume !(1 == ~e_c~0); 585#L510-1 assume !(1 == ~e_e~0); 571#L515-1 assume !(1 == ~e_f~0); 550#L520-1 assume !(1 == ~e_g~0); 551#L525-1 assume !(1 == ~e_c~0); 606#L530-1 assume !(1 == ~e_wl~0); 548#L672-1 [2022-07-22 02:43:19,388 INFO L754 eck$LassoCheckResult]: Loop: 548#L672-1 assume !false; 536#L542 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; 524#L377 assume !false; 531#L295 assume !(0 == ~wl_st~0); 533#L299 assume !(0 == ~c1_st~0); 597#L302 assume !(0 == ~c2_st~0); 623#L305 assume !(0 == ~wb_st~0); 543#L308 assume !(0 == ~r_st~0); 544#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 566#L548 assume !(1 == ~c_req_up~0); 541#L548-2 start_simulation_~kernel_st~0#1 := 3; 542#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 574#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 560#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 561#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 593#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 594#L580-1 assume !(1 == ~wl_pc~0); 563#L592 assume !(2 == ~wl_pc~0); 564#L593 assume !(1 == ~c1_pc~0); 614#L603 assume !(1 == ~c2_pc~0); 525#L612 assume !(1 == ~wb_pc~0); 527#L621 assume !(1 == ~e_c~0); 619#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 620#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 646#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 643#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 545#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 546#L655-1 assume 0 == ~wl_st~0; 548#L672-1 [2022-07-22 02:43:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2022-07-22 02:43:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740326859] [2022-07-22 02:43:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740326859] [2022-07-22 02:43:19,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740326859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71386699] [2022-07-22 02:43:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,457 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 2 times [2022-07-22 02:43:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883266508] [2022-07-22 02:43:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883266508] [2022-07-22 02:43:19,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883266508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980858862] [2022-07-22 02:43:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,491 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:19,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:19,492 INFO L87 Difference]: Start difference. First operand 124 states and 216 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) [2022-07-22 02:43:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:19,518 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2022-07-22 02:43:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:19,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2022-07-22 02:43:19,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2022-07-22 02:43:19,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-22 02:43:19,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-22 02:43:19,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2022-07-22 02:43:19,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:19,527 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-22 02:43:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2022-07-22 02:43:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-22 02:43:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 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) [2022-07-22 02:43:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2022-07-22 02:43:19,534 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-22 02:43:19,534 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-22 02:43:19,534 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:43:19,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2022-07-22 02:43:19,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:19,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:19,537 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,537 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,537 INFO L752 eck$LassoCheckResult]: Stem: 899#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; 856#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; 857#L404 assume !(1 == ~c_req_up~0); 877#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 824#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 825#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 870#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 853#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 854#L435-1 assume !(0 == ~e_f~0); 833#L440-1 assume !(0 == ~e_g~0); 834#L445-1 assume !(0 == ~e_e~0); 860#L450-1 assume !(0 == ~e_c~0); 822#L455-1 assume !(0 == ~e_wl~0); 823#L460-1 assume !(1 == ~wl_pc~0); 842#L472 assume !(2 == ~wl_pc~0); 843#L473 assume !(1 == ~c1_pc~0); 894#L483 assume !(1 == ~c2_pc~0); 808#L492 assume !(1 == ~wb_pc~0); 859#L501 assume !(1 == ~e_c~0); 840#L510-1 assume !(1 == ~e_e~0); 826#L515-1 assume !(1 == ~e_f~0); 805#L520-1 assume !(1 == ~e_g~0); 806#L525-1 assume !(1 == ~e_c~0); 861#L530-1 assume !(1 == ~e_wl~0); 803#L672-1 [2022-07-22 02:43:19,538 INFO L754 eck$LassoCheckResult]: Loop: 803#L672-1 assume !false; 791#L542 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; 779#L377 assume !false; 786#L295 assume !(0 == ~wl_st~0); 788#L299 assume !(0 == ~c1_st~0); 852#L302 assume !(0 == ~c2_st~0); 878#L305 assume !(0 == ~wb_st~0); 798#L308 assume !(0 == ~r_st~0); 799#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 821#L548 assume !(1 == ~c_req_up~0); 796#L548-2 start_simulation_~kernel_st~0#1 := 3; 797#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 829#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 815#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 816#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 848#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 849#L580-1 assume !(1 == ~wl_pc~0); 818#L592 assume !(2 == ~wl_pc~0); 819#L593 assume !(1 == ~c1_pc~0); 869#L603 assume !(1 == ~c2_pc~0); 780#L612 assume !(1 == ~wb_pc~0); 782#L621 assume !(1 == ~e_c~0); 874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 901#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 898#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 800#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 801#L655-1 assume 0 == ~wl_st~0; 803#L672-1 [2022-07-22 02:43:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2022-07-22 02:43:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717303316] [2022-07-22 02:43:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717303316] [2022-07-22 02:43:19,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717303316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960138556] [2022-07-22 02:43:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,591 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 3 times [2022-07-22 02:43:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267592498] [2022-07-22 02:43:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267592498] [2022-07-22 02:43:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267592498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311222388] [2022-07-22 02:43:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,624 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:19,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:19,625 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 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) [2022-07-22 02:43:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:19,639 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2022-07-22 02:43:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:19,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2022-07-22 02:43:19,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2022-07-22 02:43:19,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-22 02:43:19,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-22 02:43:19,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2022-07-22 02:43:19,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:19,650 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-22 02:43:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2022-07-22 02:43:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-22 02:43:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 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) [2022-07-22 02:43:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2022-07-22 02:43:19,664 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-22 02:43:19,664 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-22 02:43:19,664 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:43:19,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2022-07-22 02:43:19,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-22 02:43:19,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:19,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:19,669 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,670 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,670 INFO L752 eck$LassoCheckResult]: Stem: 1154#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; 1111#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; 1112#L404 assume !(1 == ~c_req_up~0); 1132#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1079#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1080#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1125#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1108#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1109#L435-1 assume !(0 == ~e_f~0); 1088#L440-1 assume !(0 == ~e_g~0); 1089#L445-1 assume !(0 == ~e_e~0); 1115#L450-1 assume !(0 == ~e_c~0); 1077#L455-1 assume !(0 == ~e_wl~0); 1078#L460-1 assume !(1 == ~wl_pc~0); 1097#L472 assume !(2 == ~wl_pc~0); 1098#L473 assume !(1 == ~c1_pc~0); 1149#L483 assume !(1 == ~c2_pc~0); 1063#L492 assume !(1 == ~wb_pc~0); 1114#L501 assume !(1 == ~e_c~0); 1095#L510-1 assume !(1 == ~e_e~0); 1081#L515-1 assume !(1 == ~e_f~0); 1060#L520-1 assume !(1 == ~e_g~0); 1061#L525-1 assume !(1 == ~e_c~0); 1116#L530-1 assume !(1 == ~e_wl~0); 1058#L672-1 [2022-07-22 02:43:19,670 INFO L754 eck$LassoCheckResult]: Loop: 1058#L672-1 assume !false; 1046#L542 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; 1034#L377 assume !false; 1041#L295 assume !(0 == ~wl_st~0); 1043#L299 assume !(0 == ~c1_st~0); 1107#L302 assume !(0 == ~c2_st~0); 1133#L305 assume !(0 == ~wb_st~0); 1053#L308 assume !(0 == ~r_st~0); 1054#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1076#L548 assume !(1 == ~c_req_up~0); 1051#L548-2 start_simulation_~kernel_st~0#1 := 3; 1052#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1084#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1070#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1071#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1103#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1104#L580-1 assume !(1 == ~wl_pc~0); 1073#L592 assume !(2 == ~wl_pc~0); 1074#L593 assume !(1 == ~c1_pc~0); 1124#L603 assume !(1 == ~c2_pc~0); 1035#L612 assume !(1 == ~wb_pc~0); 1037#L621 assume !(1 == ~e_c~0); 1129#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1130#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1156#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1153#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1055#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1056#L655-1 assume 0 == ~wl_st~0; 1058#L672-1 [2022-07-22 02:43:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2022-07-22 02:43:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720154847] [2022-07-22 02:43:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:19,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:19,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 4 times [2022-07-22 02:43:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199117509] [2022-07-22 02:43:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199117509] [2022-07-22 02:43:19,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199117509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850977024] [2022-07-22 02:43:19,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,773 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:19,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:19,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:19,775 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 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) [2022-07-22 02:43:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:19,821 INFO L93 Difference]: Finished difference Result 156 states and 274 transitions. [2022-07-22 02:43:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:19,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 274 transitions. [2022-07-22 02:43:19,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2022-07-22 02:43:19,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 274 transitions. [2022-07-22 02:43:19,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2022-07-22 02:43:19,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2022-07-22 02:43:19,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 274 transitions. [2022-07-22 02:43:19,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:19,829 INFO L369 hiAutomatonCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-22 02:43:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 274 transitions. [2022-07-22 02:43:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-22 02:43:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 155 states have internal predecessors, (274), 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) [2022-07-22 02:43:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 274 transitions. [2022-07-22 02:43:19,839 INFO L392 hiAutomatonCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-22 02:43:19,839 INFO L374 stractBuchiCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-22 02:43:19,839 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 02:43:19,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 274 transitions. [2022-07-22 02:43:19,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2022-07-22 02:43:19,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:19,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:19,843 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,843 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:19,843 INFO L752 eck$LassoCheckResult]: Stem: 1441#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; 1397#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; 1398#L404 assume !(1 == ~c_req_up~0); 1419#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1365#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1366#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1412#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1394#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1395#L435-1 assume !(0 == ~e_f~0); 1374#L440-1 assume !(0 == ~e_g~0); 1375#L445-1 assume !(0 == ~e_e~0); 1401#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1363#L455-1 assume !(0 == ~e_wl~0); 1364#L460-1 assume !(1 == ~wl_pc~0); 1383#L472 assume !(2 == ~wl_pc~0); 1384#L473 assume !(1 == ~c1_pc~0); 1436#L483 assume !(1 == ~c2_pc~0); 1349#L492 assume !(1 == ~wb_pc~0); 1400#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1381#L510-1 assume !(1 == ~e_e~0); 1367#L515-1 assume !(1 == ~e_f~0); 1346#L520-1 assume !(1 == ~e_g~0); 1347#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1402#L530-1 assume !(1 == ~e_wl~0); 1344#L672-1 [2022-07-22 02:43:19,845 INFO L754 eck$LassoCheckResult]: Loop: 1344#L672-1 assume !false; 1332#L542 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; 1323#L377 assume !false; 1327#L295 assume !(0 == ~wl_st~0); 1329#L299 assume !(0 == ~c1_st~0); 1393#L302 assume !(0 == ~c2_st~0); 1420#L305 assume !(0 == ~wb_st~0); 1339#L308 assume !(0 == ~r_st~0); 1340#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1362#L548 assume !(1 == ~c_req_up~0); 1337#L548-2 start_simulation_~kernel_st~0#1 := 3; 1338#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1370#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1356#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1357#L570-1 assume !(0 == ~e_c~0); 1443#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1474#L580-1 assume 1 == ~wl_pc~0; 1472#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1469#L593 assume !(1 == ~c1_pc~0); 1468#L603 assume !(1 == ~c2_pc~0); 1466#L612 assume !(1 == ~wb_pc~0); 1464#L621 assume !(1 == ~e_c~0); 1463#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1462#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1444#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1445#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1341#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1342#L655-1 assume 0 == ~wl_st~0; 1344#L672-1 [2022-07-22 02:43:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2022-07-22 02:43:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582702634] [2022-07-22 02:43:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582702634] [2022-07-22 02:43:19,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582702634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:43:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513193401] [2022-07-22 02:43:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,897 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 1 times [2022-07-22 02:43:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:19,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478479464] [2022-07-22 02:43:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:19,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478479464] [2022-07-22 02:43:19,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478479464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:19,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:19,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470243530] [2022-07-22 02:43:19,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:19,922 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:19,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:19,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:19,927 INFO L87 Difference]: Start difference. First operand 156 states and 274 transitions. cyclomatic complexity: 119 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) [2022-07-22 02:43:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:20,041 INFO L93 Difference]: Finished difference Result 285 states and 492 transitions. [2022-07-22 02:43:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:43:20,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 492 transitions. [2022-07-22 02:43:20,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2022-07-22 02:43:20,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 492 transitions. [2022-07-22 02:43:20,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2022-07-22 02:43:20,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2022-07-22 02:43:20,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 492 transitions. [2022-07-22 02:43:20,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:20,048 INFO L369 hiAutomatonCegarLoop]: Abstraction has 285 states and 492 transitions. [2022-07-22 02:43:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 492 transitions. [2022-07-22 02:43:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2022-07-22 02:43:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 273 states have (on average 1.7362637362637363) internal successors, (474), 272 states have internal predecessors, (474), 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) [2022-07-22 02:43:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 474 transitions. [2022-07-22 02:43:20,055 INFO L392 hiAutomatonCegarLoop]: Abstraction has 273 states and 474 transitions. [2022-07-22 02:43:20,055 INFO L374 stractBuchiCegarLoop]: Abstraction has 273 states and 474 transitions. [2022-07-22 02:43:20,056 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 02:43:20,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 474 transitions. [2022-07-22 02:43:20,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2022-07-22 02:43:20,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:20,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:20,058 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:20,058 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:20,059 INFO L752 eck$LassoCheckResult]: Stem: 1909#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; 1851#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; 1852#L404 assume !(1 == ~c_req_up~0); 1887#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1897#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1898#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1912#L435-1 assume !(0 == ~e_f~0); 1826#L440-1 assume !(0 == ~e_g~0); 1827#L445-1 assume !(0 == ~e_e~0); 1858#L450-1 assume !(0 == ~e_c~0); 1859#L455-1 assume !(0 == ~e_wl~0); 2007#L460-1 assume !(1 == ~wl_pc~0); 2005#L472 assume !(2 == ~wl_pc~0); 2003#L473 assume !(1 == ~c1_pc~0); 1903#L483 assume !(1 == ~c2_pc~0); 1800#L492 assume !(1 == ~wb_pc~0); 1850#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1833#L510-1 assume !(1 == ~e_e~0); 1816#L515-1 assume !(1 == ~e_f~0); 1797#L520-1 assume !(1 == ~e_g~0); 1798#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1855#L530-1 assume !(1 == ~e_wl~0); 1795#L672-1 [2022-07-22 02:43:20,059 INFO L754 eck$LassoCheckResult]: Loop: 1795#L672-1 assume !false; 1882#L542 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; 1964#L377 assume !false; 1963#L295 assume !(0 == ~wl_st~0); 1962#L299 assume !(0 == ~c1_st~0); 1961#L302 assume !(0 == ~c2_st~0); 1960#L305 assume !(0 == ~wb_st~0); 1958#L308 assume !(0 == ~r_st~0); 1957#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1881#L548 assume !(1 == ~c_req_up~0); 1788#L548-2 start_simulation_~kernel_st~0#1 := 3; 1789#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1953#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1995#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1994#L570-1 assume !(0 == ~e_c~0); 1927#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1993#L580-1 assume 1 == ~wl_pc~0; 1991#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1988#L593 assume !(1 == ~c1_pc~0); 1908#L603 assume !(1 == ~c2_pc~0); 1772#L612 assume !(1 == ~wb_pc~0); 1774#L621 assume !(1 == ~e_c~0); 1874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1914#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1792#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1793#L655-1 assume 0 == ~wl_st~0; 1795#L672-1 [2022-07-22 02:43:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 198346715, now seen corresponding path program 1 times [2022-07-22 02:43:20,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:20,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596452972] [2022-07-22 02:43:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:20,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:20,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596452972] [2022-07-22 02:43:20,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596452972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:20,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:20,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198584456] [2022-07-22 02:43:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:20,099 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 2 times [2022-07-22 02:43:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:20,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611625250] [2022-07-22 02:43:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611625250] [2022-07-22 02:43:20,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611625250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:20,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:20,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940208618] [2022-07-22 02:43:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:20,134 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:20,135 INFO L87 Difference]: Start difference. First operand 273 states and 474 transitions. cyclomatic complexity: 203 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) [2022-07-22 02:43:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:20,177 INFO L93 Difference]: Finished difference Result 369 states and 630 transitions. [2022-07-22 02:43:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:20,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 630 transitions. [2022-07-22 02:43:20,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2022-07-22 02:43:20,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 369 states and 630 transitions. [2022-07-22 02:43:20,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2022-07-22 02:43:20,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2022-07-22 02:43:20,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 630 transitions. [2022-07-22 02:43:20,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:20,184 INFO L369 hiAutomatonCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-22 02:43:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 630 transitions. [2022-07-22 02:43:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-07-22 02:43:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 369 states have (on average 1.7073170731707317) internal successors, (630), 368 states have internal predecessors, (630), 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) [2022-07-22 02:43:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 630 transitions. [2022-07-22 02:43:20,191 INFO L392 hiAutomatonCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-22 02:43:20,191 INFO L374 stractBuchiCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-22 02:43:20,191 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 02:43:20,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 630 transitions. [2022-07-22 02:43:20,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2022-07-22 02:43:20,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:20,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:20,194 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:20,194 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:20,194 INFO L752 eck$LassoCheckResult]: Stem: 2562#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; 2502#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; 2503#L404 assume !(1 == ~c_req_up~0); 2529#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2530#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2518#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2519#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2498#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2499#L435-1 assume !(0 == ~e_f~0); 2477#L440-1 assume !(0 == ~e_g~0); 2478#L445-1 assume !(0 == ~e_e~0); 2511#L450-1 assume !(0 == ~e_c~0); 2464#L455-1 assume !(0 == ~e_wl~0); 2465#L460-1 assume !(1 == ~wl_pc~0); 2487#L472 assume !(2 == ~wl_pc~0); 2488#L473 assume !(1 == ~c1_pc~0); 2556#L483 assume !(1 == ~c2_pc~0); 2450#L492 assume !(1 == ~wb_pc~0); 2505#L501 assume !(1 == ~e_c~0); 2522#L510-1 assume !(1 == ~e_e~0); 2468#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2447#L520-1 assume !(1 == ~e_g~0); 2448#L525-1 assume !(1 == ~e_c~0); 2508#L530-1 assume !(1 == ~e_wl~0); 2728#L672-1 [2022-07-22 02:43:20,194 INFO L754 eck$LassoCheckResult]: Loop: 2728#L672-1 assume !false; 2723#L542 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; 2722#L377 assume !false; 2721#L295 assume !(0 == ~wl_st~0); 2720#L299 assume !(0 == ~c1_st~0); 2719#L302 assume !(0 == ~c2_st~0); 2718#L305 assume !(0 == ~wb_st~0); 2439#L308 assume !(0 == ~r_st~0); 2441#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2463#L548 assume !(1 == ~c_req_up~0); 2437#L548-2 start_simulation_~kernel_st~0#1 := 3; 2438#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 2553#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2457#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2458#L570-1 assume !(0 == ~e_c~0); 2493#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2494#L580-1 assume 1 == ~wl_pc~0; 2555#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2460#L593 assume !(1 == ~c1_pc~0); 2517#L603 assume !(1 == ~c2_pc~0); 2501#L612 assume !(1 == ~wb_pc~0); 2751#L621 assume !(1 == ~e_c~0); 2745#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2743#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2565#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2742#L645-1 assume !(1 == ~e_c~0); 2601#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2739#L655-1 assume 0 == ~wl_st~0; 2728#L672-1 [2022-07-22 02:43:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2022-07-22 02:43:20,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:20,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033265673] [2022-07-22 02:43:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:20,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033265673] [2022-07-22 02:43:20,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033265673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:20,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:20,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:43:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572205740] [2022-07-22 02:43:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:20,237 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1473618571, now seen corresponding path program 1 times [2022-07-22 02:43:20,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:20,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634237551] [2022-07-22 02:43:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:20,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:20,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:20,500 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:20,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:20,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:20,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:20,503 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:43:20,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:20,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:20,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2022-07-22 02:43:20,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:20,506 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:20,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:20,830 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:20,833 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:43:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,847 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) [2022-07-22 02:43:20,858 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 [2022-07-22 02:43:20,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,878 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,878 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:20,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 02:43:20,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,896 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) [2022-07-22 02:43:20,897 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 [2022-07-22 02:43:20,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,920 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,920 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: [] [2022-07-22 02:43:20,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,946 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) [2022-07-22 02:43:20,947 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 [2022-07-22 02:43:20,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,976 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,976 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:21,007 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 [2022-07-22 02:43:21,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,009 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) [2022-07-22 02:43:21,011 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 [2022-07-22 02:43:21,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:21,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:21,036 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:21,036 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:21,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,058 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) [2022-07-22 02:43:21,058 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 [2022-07-22 02:43:21,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:21,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:21,071 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:21,071 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:21,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,098 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) [2022-07-22 02:43:21,100 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 [2022-07-22 02:43:21,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:21,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:21,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:21,132 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_req_up~0=4} Honda state: {~c_req_up~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:21,153 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 [2022-07-22 02:43:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,154 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) [2022-07-22 02:43:21,155 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 [2022-07-22 02:43:21,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:21,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:21,180 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 [2022-07-22 02:43:21,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,182 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) [2022-07-22 02:43:21,183 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 [2022-07-22 02:43:21,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:43:21,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:21,194 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:43:21,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-22 02:43:21,211 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:21,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:21,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:21,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:21,211 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:43:21,211 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,211 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:21,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:21,212 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2022-07-22 02:43:21,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:21,212 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:21,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:21,502 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:21,506 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:43:21,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,512 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) [2022-07-22 02:43:21,513 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 [2022-07-22 02:43:21,516 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 [2022-07-22 02:43:21,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,525 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:21,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,527 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:21,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,563 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 [2022-07-22 02:43:21,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,565 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) [2022-07-22 02:43:21,571 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 [2022-07-22 02:43:21,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,580 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:21,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,580 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:21,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,583 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 [2022-07-22 02:43:21,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,619 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 [2022-07-22 02:43:21,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,620 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) [2022-07-22 02:43:21,621 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 [2022-07-22 02:43:21,622 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 [2022-07-22 02:43:21,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:21,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:21,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,646 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 [2022-07-22 02:43:21,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,648 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) [2022-07-22 02:43:21,649 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 [2022-07-22 02:43:21,650 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 [2022-07-22 02:43:21,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,656 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:21,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,657 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:21,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,678 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 [2022-07-22 02:43:21,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,680 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) [2022-07-22 02:43:21,687 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 [2022-07-22 02:43:21,693 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 [2022-07-22 02:43:21,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,694 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:21,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,695 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:21,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 02:43:21,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,725 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) [2022-07-22 02:43:21,726 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 [2022-07-22 02:43:21,728 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 [2022-07-22 02:43:21,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:21,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:21,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:43:21,780 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:43:21,780 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:43:21,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,788 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) [2022-07-22 02:43:21,790 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 [2022-07-22 02:43:21,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:43:21,791 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:43:21,792 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:43:21,792 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_wl~0) = -1*~e_wl~0 + 1 Supporting invariants [] [2022-07-22 02:43:21,817 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 [2022-07-22 02:43:21,820 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:43:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:21,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:43:21,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:21,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:43:21,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:22,022 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 [2022-07-22 02:43:22,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 630 transitions. cyclomatic complexity: 263 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) [2022-07-22 02:43:22,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 630 transitions. cyclomatic complexity: 263. 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 1270 states and 2159 transitions. Complement of second has 5 states. [2022-07-22 02:43:22,128 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 [2022-07-22 02:43:22,132 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) [2022-07-22 02:43:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-07-22 02:43:22,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-22 02:43:22,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:22,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-22 02:43:22,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:22,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-22 02:43:22,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:22,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1270 states and 2159 transitions. [2022-07-22 02:43:22,150 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 869 [2022-07-22 02:43:22,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1270 states to 1267 states and 2153 transitions. [2022-07-22 02:43:22,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 955 [2022-07-22 02:43:22,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 972 [2022-07-22 02:43:22,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1267 states and 2153 transitions. [2022-07-22 02:43:22,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:22,162 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1267 states and 2153 transitions. [2022-07-22 02:43:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states and 2153 transitions. [2022-07-22 02:43:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 952. [2022-07-22 02:43:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 952 states have (on average 1.7069327731092436) internal successors, (1625), 951 states have internal predecessors, (1625), 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) [2022-07-22 02:43:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1625 transitions. [2022-07-22 02:43:22,188 INFO L392 hiAutomatonCegarLoop]: Abstraction has 952 states and 1625 transitions. [2022-07-22 02:43:22,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:22,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:22,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:22,190 INFO L87 Difference]: Start difference. First operand 952 states and 1625 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) [2022-07-22 02:43:22,277 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 [2022-07-22 02:43:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:22,334 INFO L93 Difference]: Finished difference Result 1170 states and 1981 transitions. [2022-07-22 02:43:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 02:43:22,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1170 states and 1981 transitions. [2022-07-22 02:43:22,344 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 691 [2022-07-22 02:43:22,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1170 states to 1170 states and 1981 transitions. [2022-07-22 02:43:22,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 811 [2022-07-22 02:43:22,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 811 [2022-07-22 02:43:22,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1170 states and 1981 transitions. [2022-07-22 02:43:22,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:22,352 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1170 states and 1981 transitions. [2022-07-22 02:43:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states and 1981 transitions. [2022-07-22 02:43:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1149. [2022-07-22 02:43:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1149 states have (on average 1.7049608355091384) internal successors, (1959), 1148 states have internal predecessors, (1959), 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) [2022-07-22 02:43:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1959 transitions. [2022-07-22 02:43:22,370 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1149 states and 1959 transitions. [2022-07-22 02:43:22,370 INFO L374 stractBuchiCegarLoop]: Abstraction has 1149 states and 1959 transitions. [2022-07-22 02:43:22,370 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 02:43:22,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1959 transitions. [2022-07-22 02:43:22,377 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 687 [2022-07-22 02:43:22,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:22,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:22,378 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:22,378 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:22,379 INFO L752 eck$LassoCheckResult]: Stem: 6639#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; 6513#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; 6514#L404 assume !(1 == ~c_req_up~0); 6637#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6723#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6722#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6721#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6720#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6647#L435-1 assume !(0 == ~e_f~0); 6465#L440-1 assume !(0 == ~e_g~0); 6466#L445-1 assume !(0 == ~e_e~0); 6517#L450-1 assume !(0 == ~e_c~0); 6523#L455-1 assume !(0 == ~e_wl~0); 6725#L460-1 assume !(1 == ~wl_pc~0); 6487#L472 assume !(2 == ~wl_pc~0); 6488#L473 assume !(1 == ~c1_pc~0); 6620#L483 assume !(1 == ~c2_pc~0); 6419#L492 assume !(1 == ~wb_pc~0); 6516#L501 assume !(1 == ~e_c~0); 6482#L510-1 assume !(1 == ~e_e~0); 6451#L515-1 assume !(1 == ~e_f~0); 6416#L520-1 assume !(1 == ~e_g~0); 6417#L525-1 assume !(1 == ~e_c~0); 6518#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6598#L672-1 [2022-07-22 02:43:22,379 INFO L754 eck$LassoCheckResult]: Loop: 6598#L672-1 assume !false; 7455#L542 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; 7454#L377 assume !false; 7453#L295 assume !(0 == ~wl_st~0); 7452#L299 assume !(0 == ~c1_st~0); 7451#L302 assume !(0 == ~c2_st~0); 7450#L305 assume !(0 == ~wb_st~0); 7219#L308 assume !(0 == ~r_st~0); 7221#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7199#L548 assume !(1 == ~c_req_up~0); 6397#L548-2 start_simulation_~kernel_st~0#1 := 3; 6398#L560 assume !(0 == ~e_f~0); 6456#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6432#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6433#L570-1 assume !(0 == ~e_c~0); 6496#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6497#L580-1 assume !(1 == ~wl_pc~0); 6438#L592 assume !(2 == ~wl_pc~0); 6439#L593 assume !(1 == ~c1_pc~0); 6534#L603 assume !(1 == ~c2_pc~0); 6361#L612 assume !(1 == ~wb_pc~0); 6363#L621 assume !(1 == ~e_c~0); 7498#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7497#L635-1 assume !(1 == ~e_f~0); 7496#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7495#L645-1 assume !(1 == ~e_c~0); 7494#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7491#L655-1 assume 0 == ~wl_st~0; 6598#L672-1 [2022-07-22 02:43:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2022-07-22 02:43:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134366506] [2022-07-22 02:43:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:22,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134366506] [2022-07-22 02:43:22,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134366506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:22,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:22,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856645990] [2022-07-22 02:43:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:22,431 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1784107586, now seen corresponding path program 1 times [2022-07-22 02:43:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300788709] [2022-07-22 02:43:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:22,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:22,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300788709] [2022-07-22 02:43:22,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300788709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:22,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:22,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:43:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043433883] [2022-07-22 02:43:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:22,447 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:22,447 INFO L87 Difference]: Start difference. First operand 1149 states and 1959 transitions. cyclomatic complexity: 816 Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:43:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:22,522 INFO L93 Difference]: Finished difference Result 1915 states and 3215 transitions. [2022-07-22 02:43:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 02:43:22,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1915 states and 3215 transitions. [2022-07-22 02:43:22,537 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 979 [2022-07-22 02:43:22,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1915 states to 1915 states and 3215 transitions. [2022-07-22 02:43:22,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1280 [2022-07-22 02:43:22,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1280 [2022-07-22 02:43:22,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1915 states and 3215 transitions. [2022-07-22 02:43:22,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:22,570 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1915 states and 3215 transitions. [2022-07-22 02:43:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states and 3215 transitions. [2022-07-22 02:43:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1427. [2022-07-22 02:43:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1427 states have (on average 1.6937631394533987) internal successors, (2417), 1426 states have internal predecessors, (2417), 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) [2022-07-22 02:43:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2417 transitions. [2022-07-22 02:43:22,597 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1427 states and 2417 transitions. [2022-07-22 02:43:22,597 INFO L374 stractBuchiCegarLoop]: Abstraction has 1427 states and 2417 transitions. [2022-07-22 02:43:22,597 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 02:43:22,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1427 states and 2417 transitions. [2022-07-22 02:43:22,606 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 789 [2022-07-22 02:43:22,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:22,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:22,608 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:22,608 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:22,608 INFO L752 eck$LassoCheckResult]: Stem: 9689#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; 9585#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; 9586#L404 assume !(1 == ~c_req_up~0); 9640#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9527#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9528#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9661#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9662#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9692#L435-1 assume !(0 == ~e_f~0); 9693#L440-1 assume !(0 == ~e_g~0); 9702#L445-1 assume !(0 == ~e_e~0); 9596#L450-1 assume !(0 == ~e_c~0); 9520#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9521#L460-1 assume !(1 == ~wl_pc~0); 9649#L472 assume !(2 == ~wl_pc~0); 10155#L473 assume !(1 == ~c1_pc~0); 10186#L483 assume !(1 == ~c2_pc~0); 10184#L492 assume !(1 == ~wb_pc~0); 10182#L501 assume !(1 == ~e_c~0); 10181#L510-1 assume !(1 == ~e_e~0); 10180#L515-1 assume !(1 == ~e_f~0); 10178#L520-1 assume !(1 == ~e_g~0); 10177#L525-1 assume !(1 == ~e_c~0); 10158#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10159#L672-1 [2022-07-22 02:43:22,609 INFO L754 eck$LassoCheckResult]: Loop: 10159#L672-1 assume !false; 10505#L542 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; 10499#L377 assume !false; 10493#L295 assume !(0 == ~wl_st~0); 10491#L299 assume !(0 == ~c1_st~0); 10489#L302 assume !(0 == ~c2_st~0); 10487#L305 assume !(0 == ~wb_st~0); 10484#L308 assume !(0 == ~r_st~0); 10482#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 10478#L548 assume !(1 == ~c_req_up~0); 10479#L548-2 start_simulation_~kernel_st~0#1 := 3; 10568#L560 assume !(0 == ~e_f~0); 10567#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10566#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10565#L570-1 assume !(0 == ~e_c~0); 10563#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10562#L580-1 assume !(1 == ~wl_pc~0); 10560#L592 assume !(2 == ~wl_pc~0); 10555#L593 assume !(1 == ~c1_pc~0); 10554#L603 assume !(1 == ~c2_pc~0); 10552#L612 assume !(1 == ~wb_pc~0); 10550#L621 assume !(1 == ~e_c~0); 10549#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10544#L635-1 assume !(1 == ~e_f~0); 10542#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10540#L645-1 assume !(1 == ~e_c~0); 10189#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10190#L655-1 assume 0 == ~wl_st~0; 10159#L672-1 [2022-07-22 02:43:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2022-07-22 02:43:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234875747] [2022-07-22 02:43:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:22,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:22,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234875747] [2022-07-22 02:43:22,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234875747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:22,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:22,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:43:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624318567] [2022-07-22 02:43:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:22,641 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:22,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1784107586, now seen corresponding path program 2 times [2022-07-22 02:43:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473791264] [2022-07-22 02:43:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:22,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473791264] [2022-07-22 02:43:22,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473791264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:22,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:22,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:43:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415011583] [2022-07-22 02:43:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:22,658 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:22,659 INFO L87 Difference]: Start difference. First operand 1427 states and 2417 transitions. cyclomatic complexity: 996 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) [2022-07-22 02:43:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:22,722 INFO L93 Difference]: Finished difference Result 1824 states and 2961 transitions. [2022-07-22 02:43:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:43:22,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1824 states and 2961 transitions. [2022-07-22 02:43:22,738 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1192 [2022-07-22 02:43:22,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1824 states to 1290 states and 2103 transitions. [2022-07-22 02:43:22,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2022-07-22 02:43:22,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2022-07-22 02:43:22,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 2103 transitions. [2022-07-22 02:43:22,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:22,749 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1290 states and 2103 transitions. [2022-07-22 02:43:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 2103 transitions. [2022-07-22 02:43:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1003. [2022-07-22 02:43:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1003 states have (on average 1.6340977068793618) internal successors, (1639), 1002 states have internal predecessors, (1639), 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) [2022-07-22 02:43:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1639 transitions. [2022-07-22 02:43:22,794 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1003 states and 1639 transitions. [2022-07-22 02:43:22,794 INFO L374 stractBuchiCegarLoop]: Abstraction has 1003 states and 1639 transitions. [2022-07-22 02:43:22,794 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 02:43:22,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1003 states and 1639 transitions. [2022-07-22 02:43:22,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 928 [2022-07-22 02:43:22,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:22,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:22,799 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:22,799 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:22,800 INFO L752 eck$LassoCheckResult]: Stem: 12849#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; 12779#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; 12780#L404 assume !(1 == ~c_req_up~0); 12811#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 12812#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 12797#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 12798#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 12776#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 12777#L435-1 assume !(0 == ~e_f~0); 12754#L440-1 assume !(0 == ~e_g~0); 12755#L445-1 assume !(0 == ~e_e~0); 12789#L450-1 assume !(0 == ~e_c~0); 12790#L455-1 assume !(0 == ~e_wl~0); 12881#L460-1 assume !(1 == ~wl_pc~0); 12878#L472 assume !(2 == ~wl_pc~0); 12877#L473 assume !(1 == ~c1_pc~0); 12840#L483 assume !(1 == ~c2_pc~0); 12727#L492 assume !(1 == ~wb_pc~0); 12802#L501 assume !(1 == ~e_c~0); 12803#L510-1 assume !(1 == ~e_e~0); 12873#L515-1 assume !(1 == ~e_f~0); 12872#L520-1 assume !(1 == ~e_g~0); 12785#L525-1 assume !(1 == ~e_c~0); 12786#L530-1 assume !(1 == ~e_wl~0); 13238#L672-1 [2022-07-22 02:43:22,801 INFO L754 eck$LassoCheckResult]: Loop: 13238#L672-1 assume !false; 13239#L542 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; 13230#L377 assume !false; 13231#L295 assume !(0 == ~wl_st~0); 13226#L299 assume !(0 == ~c1_st~0); 13227#L302 assume !(0 == ~c2_st~0); 13219#L305 assume !(0 == ~wb_st~0); 13220#L308 assume !(0 == ~r_st~0); 13334#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 13335#L548 assume !(1 == ~c_req_up~0); 13330#L548-2 start_simulation_~kernel_st~0#1 := 3; 13325#L560 assume !(0 == ~e_f~0); 13326#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 13321#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 13322#L570-1 assume !(0 == ~e_c~0); 13317#L575-1 assume !(0 == ~e_wl~0); 13318#L580-1 assume !(1 == ~wl_pc~0); 13315#L592 assume !(2 == ~wl_pc~0); 13314#L593 assume !(1 == ~c1_pc~0); 13309#L603 assume !(1 == ~c2_pc~0); 13307#L612 assume !(1 == ~wb_pc~0); 13305#L621 assume !(1 == ~e_c~0); 13304#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 13302#L635-1 assume !(1 == ~e_f~0); 13303#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 13481#L645-1 assume !(1 == ~e_c~0); 13479#L650-1 assume !(1 == ~e_wl~0); 13288#L655-1 assume 0 == ~wl_st~0; 13238#L672-1 [2022-07-22 02:43:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2022-07-22 02:43:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271406605] [2022-07-22 02:43:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:22,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:22,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1197301634, now seen corresponding path program 1 times [2022-07-22 02:43:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990924771] [2022-07-22 02:43:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:22,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:22,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990924771] [2022-07-22 02:43:22,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990924771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:22,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:22,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:43:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990736941] [2022-07-22 02:43:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:22,845 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:22,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:22,846 INFO L87 Difference]: Start difference. First operand 1003 states and 1639 transitions. cyclomatic complexity: 640 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:43:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:22,871 INFO L93 Difference]: Finished difference Result 1585 states and 2559 transitions. [2022-07-22 02:43:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:22,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1585 states and 2559 transitions. [2022-07-22 02:43:22,884 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1510 [2022-07-22 02:43:22,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1585 states to 1585 states and 2559 transitions. [2022-07-22 02:43:22,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1585 [2022-07-22 02:43:22,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1585 [2022-07-22 02:43:22,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1585 states and 2559 transitions. [2022-07-22 02:43:22,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:22,897 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-22 02:43:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states and 2559 transitions. [2022-07-22 02:43:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2022-07-22 02:43:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1585 states have (on average 1.6145110410094636) internal successors, (2559), 1584 states have internal predecessors, (2559), 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) [2022-07-22 02:43:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2559 transitions. [2022-07-22 02:43:22,924 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-22 02:43:22,924 INFO L374 stractBuchiCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-22 02:43:22,925 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 02:43:22,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1585 states and 2559 transitions. [2022-07-22 02:43:22,931 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1510 [2022-07-22 02:43:22,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:22,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:22,932 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:22,932 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:22,933 INFO L752 eck$LassoCheckResult]: Stem: 15442#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; 15375#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; 15376#L404 assume !(1 == ~c_req_up~0); 15402#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 15338#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 15339#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 15392#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 15372#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 15373#L435-1 assume !(0 == ~e_f~0); 15350#L440-1 assume !(0 == ~e_g~0); 15351#L445-1 assume !(0 == ~e_e~0); 15379#L450-1 assume !(0 == ~e_c~0); 15384#L455-1 assume !(0 == ~e_wl~0); 15477#L460-1 assume !(1 == ~wl_pc~0); 15474#L472 assume !(2 == ~wl_pc~0); 15473#L473 assume !(1 == ~c1_pc~0); 15471#L483 assume !(1 == ~c2_pc~0); 15466#L492 assume !(1 == ~wb_pc~0); 15395#L501 assume !(1 == ~e_c~0); 15358#L510-1 assume !(1 == ~e_e~0); 15359#L515-1 assume !(1 == ~e_f~0); 15464#L520-1 assume !(1 == ~e_g~0); 15380#L525-1 assume !(1 == ~e_c~0); 15381#L530-1 assume !(1 == ~e_wl~0); 16050#L672-1 [2022-07-22 02:43:22,933 INFO L754 eck$LassoCheckResult]: Loop: 16050#L672-1 assume !false; 15983#L542 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; 15982#L377 assume !false; 15963#L295 assume !(0 == ~wl_st~0); 15964#L299 assume !(0 == ~c1_st~0); 16404#L302 assume !(0 == ~c2_st~0); 16401#L305 assume !(0 == ~wb_st~0); 16402#L308 assume !(0 == ~r_st~0); 16403#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 16466#L548 assume !(1 == ~c_req_up~0); 16463#L548-2 start_simulation_~kernel_st~0#1 := 3; 16461#L560 assume !(0 == ~e_f~0); 16460#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 16459#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 16458#L570-1 assume !(0 == ~e_c~0); 16457#L575-1 assume !(0 == ~e_wl~0); 16456#L580-1 assume !(1 == ~wl_pc~0); 16454#L592 assume 2 == ~wl_pc~0; 16452#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 16453#L593 assume !(1 == ~c1_pc~0); 16482#L603 assume !(1 == ~c2_pc~0); 16447#L612 assume !(1 == ~wb_pc~0); 16443#L621 assume !(1 == ~e_c~0); 16441#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 16439#L635-1 assume !(1 == ~e_f~0); 16437#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 16435#L645-1 assume !(1 == ~e_c~0); 16433#L650-1 assume !(1 == ~e_wl~0); 16430#L655-1 assume 0 == ~wl_st~0; 16050#L672-1 [2022-07-22 02:43:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 3 times [2022-07-22 02:43:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185091463] [2022-07-22 02:43:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:22,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:22,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -869781309, now seen corresponding path program 1 times [2022-07-22 02:43:22,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032232161] [2022-07-22 02:43:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:22,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:22,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash 44318509, now seen corresponding path program 1 times [2022-07-22 02:43:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:22,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298089947] [2022-07-22 02:43:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:23,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298089947] [2022-07-22 02:43:23,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298089947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:23,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:23,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243268229] [2022-07-22 02:43:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:23,222 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:23,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:23,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:23,223 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:23,223 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:43:23,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,223 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:23,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:23,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2022-07-22 02:43:23,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:23,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:23,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:23,499 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:23,501 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:43:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,502 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) [2022-07-22 02:43:23,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,512 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,524 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 [2022-07-22 02:43:23,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,531 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:23,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,559 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) [2022-07-22 02:43:23,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,567 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 [2022-07-22 02:43:23,579 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,580 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-22 02:43:23,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,597 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) [2022-07-22 02:43:23,598 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 [2022-07-22 02:43:23,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,607 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,607 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: [] [2022-07-22 02:43:23,623 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 [2022-07-22 02:43:23,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,624 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) [2022-07-22 02:43:23,626 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 [2022-07-22 02:43:23,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,634 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,635 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: [] [2022-07-22 02:43:23,651 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 [2022-07-22 02:43:23,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,653 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) [2022-07-22 02:43:23,653 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 [2022-07-22 02:43:23,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,680 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 [2022-07-22 02:43:23,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,681 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) [2022-07-22 02:43:23,682 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 [2022-07-22 02:43:23,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,700 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,701 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: [] [2022-07-22 02:43:23,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-22 02:43:23,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,719 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) [2022-07-22 02:43:23,719 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 [2022-07-22 02:43:23,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,728 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,728 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,747 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) [2022-07-22 02:43:23,758 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 [2022-07-22 02:43:23,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,783 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,784 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet5#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:23,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,808 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) [2022-07-22 02:43:23,808 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 [2022-07-22 02:43:23,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,823 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,823 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:23,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,840 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) [2022-07-22 02:43:23,841 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 [2022-07-22 02:43:23,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,854 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,854 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=-1} Honda state: {~wb_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,869 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 [2022-07-22 02:43:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,870 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) [2022-07-22 02:43:23,871 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 [2022-07-22 02:43:23,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,885 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,885 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,912 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 [2022-07-22 02:43:23,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,914 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) [2022-07-22 02:43:23,915 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 [2022-07-22 02:43:23,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,927 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:23,927 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_pc~0=4} Honda state: {~wb_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:23,942 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 [2022-07-22 02:43:23,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,944 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) [2022-07-22 02:43:23,946 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 [2022-07-22 02:43:23,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:23,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:23,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 02:43:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,980 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) [2022-07-22 02:43:23,983 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 [2022-07-22 02:43:23,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:43:23,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:24,031 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:43:24,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:24,039 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:24,040 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:24,040 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:24,040 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:24,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:43:24,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:24,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:24,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2022-07-22 02:43:24,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:24,040 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:24,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:24,280 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:24,280 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:43:24,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,284 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) [2022-07-22 02:43:24,292 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 [2022-07-22 02:43:24,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,299 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:24,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,300 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:24,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,303 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 [2022-07-22 02:43:24,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,352 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 [2022-07-22 02:43:24,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,355 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) [2022-07-22 02:43:24,356 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 [2022-07-22 02:43:24,358 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 [2022-07-22 02:43:24,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,365 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:24,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,366 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:24,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,408 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 [2022-07-22 02:43:24,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,410 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) [2022-07-22 02:43:24,410 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 [2022-07-22 02:43:24,412 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 [2022-07-22 02:43:24,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:24,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:24,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 02:43:24,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,437 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) [2022-07-22 02:43:24,438 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 [2022-07-22 02:43:24,440 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 [2022-07-22 02:43:24,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:24,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:24,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 02:43:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,464 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) [2022-07-22 02:43:24,465 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 [2022-07-22 02:43:24,466 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 [2022-07-22 02:43:24,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:24,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:24,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 02:43:24,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,491 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) [2022-07-22 02:43:24,491 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 [2022-07-22 02:43:24,493 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 [2022-07-22 02:43:24,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,499 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:24,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,499 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:24,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 02:43:24,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,538 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) [2022-07-22 02:43:24,538 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 [2022-07-22 02:43:24,540 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 [2022-07-22 02:43:24,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:24,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:24,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 02:43:24,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,569 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) [2022-07-22 02:43:24,570 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 [2022-07-22 02:43:24,571 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 [2022-07-22 02:43:24,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:24,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:24,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,613 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 [2022-07-22 02:43:24,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,614 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) [2022-07-22 02:43:24,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 [2022-07-22 02:43:24,626 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 [2022-07-22 02:43:24,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,626 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:24,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,627 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:24,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,644 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 [2022-07-22 02:43:24,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,645 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) [2022-07-22 02:43:24,646 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 [2022-07-22 02:43:24,648 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 [2022-07-22 02:43:24,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,654 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:24,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,655 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:24,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,673 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 [2022-07-22 02:43:24,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,675 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) [2022-07-22 02:43:24,675 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 [2022-07-22 02:43:24,677 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 [2022-07-22 02:43:24,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:24,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:24,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,703 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 [2022-07-22 02:43:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,705 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) [2022-07-22 02:43:24,705 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 [2022-07-22 02:43:24,707 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 [2022-07-22 02:43:24,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,713 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:24,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,713 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:24,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 02:43:24,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,732 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2022-07-22 02:43:24,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 02:43:24,734 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 [2022-07-22 02:43:24,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,740 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:24,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,742 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:24,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:24,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 02:43:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,771 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2022-07-22 02:43:24,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 02:43:24,776 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 [2022-07-22 02:43:24,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:24,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:24,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:24,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:24,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:24,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:24,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:24,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:43:24,799 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:43:24,799 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:43:24,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:24,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:24,800 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2022-07-22 02:43:24,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 02:43:24,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:43:24,802 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:43:24,802 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:43:24,802 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_g~0) = -1*~e_g~0 + 1 Supporting invariants [] [2022-07-22 02:43:24,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 02:43:24,819 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:43:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:24,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:43:24,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:24,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:43:24,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:24,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:24,993 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 [2022-07-22 02:43:24,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1585 states and 2559 transitions. cyclomatic complexity: 978 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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) [2022-07-22 02:43:25,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1585 states and 2559 transitions. cyclomatic complexity: 978. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 4473 states and 7197 transitions. Complement of second has 5 states. [2022-07-22 02:43:25,056 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 [2022-07-22 02:43:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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) [2022-07-22 02:43:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2022-07-22 02:43:25,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 24 letters. Loop has 29 letters. [2022-07-22 02:43:25,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:25,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 29 letters. [2022-07-22 02:43:25,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:25,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 24 letters. Loop has 58 letters. [2022-07-22 02:43:25,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:25,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4473 states and 7197 transitions. [2022-07-22 02:43:25,097 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2912 [2022-07-22 02:43:25,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4473 states to 4473 states and 7197 transitions. [2022-07-22 02:43:25,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2990 [2022-07-22 02:43:25,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3029 [2022-07-22 02:43:25,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4473 states and 7197 transitions. [2022-07-22 02:43:25,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:25,135 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4473 states and 7197 transitions. [2022-07-22 02:43:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states and 7197 transitions. [2022-07-22 02:43:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4434. [2022-07-22 02:43:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4434 states, 4434 states have (on average 1.6118628777627424) internal successors, (7147), 4433 states have internal predecessors, (7147), 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) [2022-07-22 02:43:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 7147 transitions. [2022-07-22 02:43:25,258 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4434 states and 7147 transitions. [2022-07-22 02:43:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:25,259 INFO L87 Difference]: Start difference. First operand 4434 states and 7147 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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) [2022-07-22 02:43:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:25,298 INFO L93 Difference]: Finished difference Result 3528 states and 5680 transitions. [2022-07-22 02:43:25,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:25,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3528 states and 5680 transitions. [2022-07-22 02:43:25,321 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2306 [2022-07-22 02:43:25,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3528 states to 3528 states and 5680 transitions. [2022-07-22 02:43:25,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2387 [2022-07-22 02:43:25,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2387 [2022-07-22 02:43:25,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3528 states and 5680 transitions. [2022-07-22 02:43:25,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:25,351 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3528 states and 5680 transitions. [2022-07-22 02:43:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states and 5680 transitions. [2022-07-22 02:43:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3180. [2022-07-22 02:43:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 3180 states have (on average 1.6182389937106918) internal successors, (5146), 3179 states have internal predecessors, (5146), 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) [2022-07-22 02:43:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 5146 transitions. [2022-07-22 02:43:25,414 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3180 states and 5146 transitions. [2022-07-22 02:43:25,414 INFO L374 stractBuchiCegarLoop]: Abstraction has 3180 states and 5146 transitions. [2022-07-22 02:43:25,414 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 02:43:25,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3180 states and 5146 transitions. [2022-07-22 02:43:25,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2072 [2022-07-22 02:43:25,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:25,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:25,460 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:25,461 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:25,461 INFO L752 eck$LassoCheckResult]: Stem: 29766#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; 29640#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; 29641#L404 assume !(1 == ~c_req_up~0); 29763#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 29801#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 29800#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 29799#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 29633#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 29634#L435-1 assume !(0 == ~e_f~0); 29594#L440-1 assume !(0 == ~e_g~0); 29595#L445-1 assume !(0 == ~e_e~0); 29651#L450-1 assume !(0 == ~e_c~0); 29652#L455-1 assume !(0 == ~e_wl~0); 29716#L460-1 assume !(1 == ~wl_pc~0); 29609#L472 assume !(2 == ~wl_pc~0); 29610#L473 assume !(1 == ~c1_pc~0); 29771#L483 assume !(1 == ~c2_pc~0); 29764#L492 assume !(1 == ~wb_pc~0); 29643#L501 assume !(1 == ~e_c~0); 29786#L510-1 assume !(1 == ~e_e~0); 29787#L515-1 assume !(1 == ~e_f~0); 29547#L520-1 assume !(1 == ~e_g~0); 29548#L525-1 assume !(1 == ~e_c~0); 29646#L530-1 assume !(1 == ~e_wl~0); 29726#L672-1 assume !false; 30692#L542 [2022-07-22 02:43:25,461 INFO L754 eck$LassoCheckResult]: Loop: 30692#L542 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; 32094#L377 assume !false; 32091#L295 assume 0 == ~wl_st~0; 32089#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 32033#L321 assume 0 != eval_~tmp~0#1;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0#1;havoc write_loop_~t~0#1; 29622#L66 assume 0 == ~wl_pc~0; 29623#L79 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 29673#L127 assume { :end_inline_write_loop } true; 31701#L317 assume !(0 == ~c1_st~0); 31696#L332 assume !(0 == ~c2_st~0); 31703#L347 assume !(0 == ~wb_st~0); 32003#L362 assume !(0 == ~r_st~0); 32000#L377 assume !false; 31999#L295 assume !(0 == ~wl_st~0); 31997#L299 assume !(0 == ~c1_st~0); 31998#L302 assume !(0 == ~c2_st~0); 31994#L305 assume !(0 == ~wb_st~0); 31995#L308 assume !(0 == ~r_st~0); 31996#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 31128#L548 assume !(1 == ~c_req_up~0); 31129#L548-2 start_simulation_~kernel_st~0#1 := 3; 32345#L560 assume !(0 == ~e_f~0); 32343#L560-2 assume !(0 == ~e_g~0); 32342#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 32341#L570-1 assume !(0 == ~e_c~0); 32300#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 32298#L580-1 assume 1 == ~wl_pc~0; 32299#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 32296#L593 assume !(1 == ~c1_pc~0); 32392#L603 assume !(1 == ~c2_pc~0); 32390#L612 assume !(1 == ~wb_pc~0); 32386#L621 assume !(1 == ~e_c~0); 32381#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 32379#L635-1 assume !(1 == ~e_f~0); 32377#L640-1 assume !(1 == ~e_g~0); 32353#L645-1 assume !(1 == ~e_c~0); 32321#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 32319#L655-1 assume 0 == ~wl_st~0; 32301#L672-1 assume !false; 30692#L542 [2022-07-22 02:43:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2022-07-22 02:43:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:25,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028153679] [2022-07-22 02:43:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:25,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:25,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1995227012, now seen corresponding path program 1 times [2022-07-22 02:43:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:25,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099553711] [2022-07-22 02:43:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:25,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:25,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:25,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1594093335, now seen corresponding path program 1 times [2022-07-22 02:43:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:25,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237648291] [2022-07-22 02:43:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:25,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237648291] [2022-07-22 02:43:25,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237648291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:25,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:25,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391632322] [2022-07-22 02:43:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:25,772 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:25,772 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:25,772 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:25,772 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:25,772 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:43:25,772 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:25,772 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:25,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:25,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration13_Loop [2022-07-22 02:43:25,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:25,772 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:25,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:25,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,039 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:26,040 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:43:26,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,041 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2022-07-22 02:43:26,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:26,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:26,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 02:43:26,074 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:26,074 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:43:26,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,100 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2022-07-22 02:43:26,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:26,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:26,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 02:43:26,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:26,122 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: [] [2022-07-22 02:43:26,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,148 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2022-07-22 02:43:26,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 02:43:26,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:26,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:26,168 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:26,168 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: [] [2022-07-22 02:43:26,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,196 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2022-07-22 02:43:26,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 02:43:26,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:26,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:26,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,262 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2022-07-22 02:43:26,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 02:43:26,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:43:26,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:26,286 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:43:26,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,310 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:26,310 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:26,310 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:26,310 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:26,310 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:43:26,311 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,311 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:26,311 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:26,311 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration13_Loop [2022-07-22 02:43:26,311 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:26,311 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:26,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:26,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:26,575 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:43:26,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,577 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2022-07-22 02:43:26,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 02:43:26,580 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 [2022-07-22 02:43:26,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:26,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:26,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:26,586 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:26,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:26,587 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:26,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:26,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:26,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 02:43:26,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,632 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2022-07-22 02:43:26,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 02:43:26,635 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 [2022-07-22 02:43:26,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:26,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:26,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:26,641 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:26,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:26,641 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:26,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:26,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:26,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 02:43:26,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,659 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2022-07-22 02:43:26,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 02:43:26,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:43:26,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:26,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:26,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:26,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:26,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:26,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:26,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:26,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:26,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 02:43:26,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,719 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2022-07-22 02:43:26,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 02:43:26,721 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 [2022-07-22 02:43:26,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:26,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:26,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:26,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:26,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:26,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:26,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:26,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:26,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,750 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2022-07-22 02:43:26,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 02:43:26,752 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 [2022-07-22 02:43:26,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:26,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:26,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:26,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:26,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:26,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:26,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:26,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:43:26,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:43:26,786 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:43:26,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:26,788 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2022-07-22 02:43:26,796 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:43:26,796 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:43:26,796 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:43:26,796 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2022-07-22 02:43:26,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 02:43:26,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,821 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:43:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:26,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:26,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:43:26,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:26,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:43:26,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 02:43:27,014 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 [2022-07-22 02:43:27,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3180 states and 5146 transitions. cyclomatic complexity: 1972 Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) [2022-07-22 02:43:27,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3180 states and 5146 transitions. cyclomatic complexity: 1972. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 8425 states and 13698 transitions. Complement of second has 5 states. [2022-07-22 02:43:27,080 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 [2022-07-22 02:43:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) [2022-07-22 02:43:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-07-22 02:43:27,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 25 letters. Loop has 39 letters. [2022-07-22 02:43:27,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:27,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 64 letters. Loop has 39 letters. [2022-07-22 02:43:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:27,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 25 letters. Loop has 78 letters. [2022-07-22 02:43:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:27,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8425 states and 13698 transitions. [2022-07-22 02:43:27,122 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3740 [2022-07-22 02:43:27,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8425 states to 8425 states and 13698 transitions. [2022-07-22 02:43:27,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3861 [2022-07-22 02:43:27,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3924 [2022-07-22 02:43:27,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8425 states and 13698 transitions. [2022-07-22 02:43:27,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:27,208 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8425 states and 13698 transitions. [2022-07-22 02:43:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8425 states and 13698 transitions. [2022-07-22 02:43:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8425 to 8362. [2022-07-22 02:43:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8362 states, 8362 states have (on average 1.6270031093039943) internal successors, (13605), 8361 states have internal predecessors, (13605), 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) [2022-07-22 02:43:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 13605 transitions. [2022-07-22 02:43:27,423 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8362 states and 13605 transitions. [2022-07-22 02:43:27,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:27,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:27,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:27,425 INFO L87 Difference]: Start difference. First operand 8362 states and 13605 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2022-07-22 02:43:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:27,488 INFO L93 Difference]: Finished difference Result 13026 states and 20958 transitions. [2022-07-22 02:43:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:27,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13026 states and 20958 transitions. [2022-07-22 02:43:27,610 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5899 [2022-07-22 02:43:27,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13026 states to 13026 states and 20958 transitions. [2022-07-22 02:43:27,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6028 [2022-07-22 02:43:27,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6028 [2022-07-22 02:43:27,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13026 states and 20958 transitions. [2022-07-22 02:43:27,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:27,735 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-22 02:43:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states and 20958 transitions. [2022-07-22 02:43:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 13026. [2022-07-22 02:43:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13026 states, 13026 states have (on average 1.6089359742054352) internal successors, (20958), 13025 states have internal predecessors, (20958), 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) [2022-07-22 02:43:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 20958 transitions. [2022-07-22 02:43:28,039 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-22 02:43:28,039 INFO L374 stractBuchiCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-22 02:43:28,039 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 02:43:28,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13026 states and 20958 transitions. [2022-07-22 02:43:28,094 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5899 [2022-07-22 02:43:28,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:28,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:28,095 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:28,095 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:28,095 INFO L752 eck$LassoCheckResult]: Stem: 62993#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; 62856#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; 62857#L404 assume !(1 == ~c_req_up~0); 62921#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 62792#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 62793#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 62956#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 62957#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63003#L435-1 assume !(0 == ~e_f~0); 63004#L440-1 assume !(0 == ~e_g~0); 62860#L445-1 assume !(0 == ~e_e~0); 62861#L450-1 assume !(0 == ~e_c~0); 62790#L455-1 assume !(0 == ~e_wl~0); 62791#L460-1 assume !(1 == ~wl_pc~0); 63034#L472 assume !(2 == ~wl_pc~0); 62997#L473 assume !(1 == ~c1_pc~0); 62972#L483 assume !(1 == ~c2_pc~0); 62760#L492 assume !(1 == ~wb_pc~0); 62859#L501 assume !(1 == ~e_c~0); 62889#L510-1 assume !(1 == ~e_e~0); 63017#L515-1 assume !(1 == ~e_f~0); 62757#L520-1 assume !(1 == ~e_g~0); 62758#L525-1 assume !(1 == ~e_c~0); 62862#L530-1 assume !(1 == ~e_wl~0); 64804#L672-1 assume !false; 64805#L542 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; 71626#L377 [2022-07-22 02:43:28,096 INFO L754 eck$LassoCheckResult]: Loop: 71626#L377 assume !false; 71623#L295 assume 0 == ~wl_st~0; 71620#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 71614#L321 assume !(0 != eval_~tmp~0#1); 71613#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 71345#L336 assume !(0 != eval_~tmp___0~0#1); 71610#L332 assume !(0 == ~c2_st~0); 73069#L347 assume !(0 == ~wb_st~0); 71633#L362 assume !(0 == ~r_st~0); 71626#L377 [2022-07-22 02:43:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2022-07-22 02:43:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:28,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104403620] [2022-07-22 02:43:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:28,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:28,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash 910089250, now seen corresponding path program 1 times [2022-07-22 02:43:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:28,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625577902] [2022-07-22 02:43:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:28,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:28,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1807696598, now seen corresponding path program 1 times [2022-07-22 02:43:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:28,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588240269] [2022-07-22 02:43:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:28,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588240269] [2022-07-22 02:43:28,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588240269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:28,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:28,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615923471] [2022-07-22 02:43:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:28,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:28,186 INFO L87 Difference]: Start difference. First operand 13026 states and 20958 transitions. cyclomatic complexity: 7950 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) [2022-07-22 02:43:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:28,321 INFO L93 Difference]: Finished difference Result 20176 states and 31971 transitions. [2022-07-22 02:43:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:28,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20176 states and 31971 transitions. [2022-07-22 02:43:28,423 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-22 02:43:28,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20176 states to 20176 states and 31971 transitions. [2022-07-22 02:43:28,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9426 [2022-07-22 02:43:28,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9426 [2022-07-22 02:43:28,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20176 states and 31971 transitions. [2022-07-22 02:43:28,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:28,616 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-22 02:43:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20176 states and 31971 transitions. [2022-07-22 02:43:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20176 to 20176. [2022-07-22 02:43:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20176 states, 20176 states have (on average 1.5846054718477398) internal successors, (31971), 20175 states have internal predecessors, (31971), 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) [2022-07-22 02:43:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20176 states to 20176 states and 31971 transitions. [2022-07-22 02:43:29,018 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-22 02:43:29,018 INFO L374 stractBuchiCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-22 02:43:29,018 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 02:43:29,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20176 states and 31971 transitions. [2022-07-22 02:43:29,072 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-22 02:43:29,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:29,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:29,077 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:29,077 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:29,077 INFO L752 eck$LassoCheckResult]: Stem: 96218#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; 96066#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; 96067#L404 assume !(1 == ~c_req_up~0); 96130#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 96000#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 96001#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 96280#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 98656#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 98655#L435-1 assume !(0 == ~e_f~0); 98654#L440-1 assume !(0 == ~e_g~0); 98653#L445-1 assume !(0 == ~e_e~0); 98652#L450-1 assume !(0 == ~e_c~0); 98651#L455-1 assume !(0 == ~e_wl~0); 98650#L460-1 assume !(1 == ~wl_pc~0); 98647#L472 assume !(2 == ~wl_pc~0); 98646#L473 assume !(1 == ~c1_pc~0); 98643#L483 assume !(1 == ~c2_pc~0); 96209#L492 assume !(1 == ~wb_pc~0); 96069#L501 assume !(1 == ~e_c~0); 96250#L510-1 assume !(1 == ~e_e~0); 96247#L515-1 assume !(1 == ~e_f~0); 95965#L520-1 assume !(1 == ~e_g~0); 95966#L525-1 assume !(1 == ~e_c~0); 96072#L530-1 assume !(1 == ~e_wl~0); 98634#L672-1 assume !false; 98635#L542 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; 108486#L377 [2022-07-22 02:43:29,077 INFO L754 eck$LassoCheckResult]: Loop: 108486#L377 assume !false; 108483#L295 assume 0 == ~wl_st~0; 108478#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 108475#L321 assume !(0 != eval_~tmp~0#1); 108473#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 108461#L336 assume !(0 != eval_~tmp___0~0#1); 108472#L332 assume !(0 == ~c2_st~0); 109228#L347 assume !(0 == ~wb_st~0); 108491#L362 assume !(0 == ~r_st~0); 108486#L377 [2022-07-22 02:43:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2022-07-22 02:43:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:29,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527019549] [2022-07-22 02:43:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:29,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527019549] [2022-07-22 02:43:29,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527019549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:29,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:29,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944427189] [2022-07-22 02:43:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:29,092 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash 910089250, now seen corresponding path program 2 times [2022-07-22 02:43:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:29,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510409191] [2022-07-22 02:43:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:29,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:29,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:29,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:29,136 INFO L87 Difference]: Start difference. First operand 20176 states and 31971 transitions. cyclomatic complexity: 11813 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) [2022-07-22 02:43:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:29,194 INFO L93 Difference]: Finished difference Result 20104 states and 31852 transitions. [2022-07-22 02:43:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:29,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20104 states and 31852 transitions. [2022-07-22 02:43:29,281 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-22 02:43:29,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20104 states to 20104 states and 31852 transitions. [2022-07-22 02:43:29,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9357 [2022-07-22 02:43:29,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9357 [2022-07-22 02:43:29,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20104 states and 31852 transitions. [2022-07-22 02:43:29,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:29,462 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-22 02:43:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20104 states and 31852 transitions. [2022-07-22 02:43:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20104 to 20104. [2022-07-22 02:43:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20104 states, 20104 states have (on average 1.5843613211301233) internal successors, (31852), 20103 states have internal predecessors, (31852), 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) [2022-07-22 02:43:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20104 states to 20104 states and 31852 transitions. [2022-07-22 02:43:29,840 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-22 02:43:29,840 INFO L374 stractBuchiCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-22 02:43:29,840 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 02:43:29,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20104 states and 31852 transitions. [2022-07-22 02:43:29,902 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-22 02:43:29,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:29,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:29,903 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:29,903 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:29,903 INFO L752 eck$LassoCheckResult]: Stem: 136495#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; 136346#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; 136347#L404 assume !(1 == ~c_req_up~0); 136416#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 136289#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 136290#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 136451#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 136452#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 136499#L435-1 assume !(0 == ~e_f~0); 136500#L440-1 assume !(0 == ~e_g~0); 136350#L445-1 assume !(0 == ~e_e~0); 136351#L450-1 assume !(0 == ~e_c~0); 136283#L455-1 assume !(0 == ~e_wl~0); 136284#L460-1 assume !(1 == ~wl_pc~0); 136532#L472 assume !(2 == ~wl_pc~0); 136497#L473 assume !(1 == ~c1_pc~0); 136476#L483 assume !(1 == ~c2_pc~0); 136253#L492 assume !(1 == ~wb_pc~0); 136349#L501 assume !(1 == ~e_c~0); 136380#L510-1 assume !(1 == ~e_e~0); 136515#L515-1 assume !(1 == ~e_f~0); 136250#L520-1 assume !(1 == ~e_g~0); 136251#L525-1 assume !(1 == ~e_c~0); 136352#L530-1 assume !(1 == ~e_wl~0); 138595#L672-1 assume !false; 138596#L542 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; 148552#L377 [2022-07-22 02:43:29,903 INFO L754 eck$LassoCheckResult]: Loop: 148552#L377 assume !false; 148550#L295 assume 0 == ~wl_st~0; 148548#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 148545#L321 assume !(0 != eval_~tmp~0#1); 148546#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 147594#L336 assume !(0 != eval_~tmp___0~0#1); 147609#L332 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 148567#L351 assume !(0 != eval_~tmp___1~0#1); 148566#L347 assume !(0 == ~wb_st~0); 148559#L362 assume !(0 == ~r_st~0); 148552#L377 [2022-07-22 02:43:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2022-07-22 02:43:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:29,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725743791] [2022-07-22 02:43:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:29,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:29,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:29,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1853655075, now seen corresponding path program 1 times [2022-07-22 02:43:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:29,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975897610] [2022-07-22 02:43:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:29,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:29,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:29,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -205670443, now seen corresponding path program 1 times [2022-07-22 02:43:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:29,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897564635] [2022-07-22 02:43:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:43:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897564635] [2022-07-22 02:43:29,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897564635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:29,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:29,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763436430] [2022-07-22 02:43:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:29,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:29,982 INFO L87 Difference]: Start difference. First operand 20104 states and 31852 transitions. cyclomatic complexity: 11766 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) [2022-07-22 02:43:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:30,206 INFO L93 Difference]: Finished difference Result 33433 states and 51943 transitions. [2022-07-22 02:43:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:30,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33433 states and 51943 transitions. [2022-07-22 02:43:30,396 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 15444 [2022-07-22 02:43:30,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33433 states to 33433 states and 51943 transitions. [2022-07-22 02:43:30,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15625 [2022-07-22 02:43:30,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15625 [2022-07-22 02:43:30,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33433 states and 51943 transitions. [2022-07-22 02:43:30,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:30,529 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-22 02:43:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33433 states and 51943 transitions. [2022-07-22 02:43:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33433 to 33433. [2022-07-22 02:43:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33433 states have (on average 1.553644602638112) internal successors, (51943), 33432 states have internal predecessors, (51943), 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) [2022-07-22 02:43:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 51943 transitions. [2022-07-22 02:43:31,159 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-22 02:43:31,159 INFO L374 stractBuchiCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-22 02:43:31,159 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-22 02:43:31,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33433 states and 51943 transitions. [2022-07-22 02:43:31,365 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 15444 [2022-07-22 02:43:31,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:31,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:31,365 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:43:31,365 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:31,365 INFO L752 eck$LassoCheckResult]: Stem: 190048#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; 189894#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; 189895#L404 assume !(1 == ~c_req_up~0); 189961#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 189829#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 189830#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 189997#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 189998#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 190055#L435-1 assume !(0 == ~e_f~0); 190056#L440-1 assume !(0 == ~e_g~0); 189898#L445-1 assume !(0 == ~e_e~0); 189899#L450-1 assume !(0 == ~e_c~0); 189827#L455-1 assume !(0 == ~e_wl~0); 189828#L460-1 assume !(1 == ~wl_pc~0); 190091#L472 assume !(2 == ~wl_pc~0); 190050#L473 assume !(1 == ~c1_pc~0); 190017#L483 assume !(1 == ~c2_pc~0); 189797#L492 assume !(1 == ~wb_pc~0); 189897#L501 assume !(1 == ~e_c~0); 189928#L510-1 assume !(1 == ~e_e~0); 190074#L515-1 assume !(1 == ~e_f~0); 189794#L520-1 assume !(1 == ~e_g~0); 189795#L525-1 assume !(1 == ~e_c~0); 189900#L530-1 assume !(1 == ~e_wl~0); 196797#L672-1 assume !false; 196798#L542 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; 207344#L377 [2022-07-22 02:43:31,366 INFO L754 eck$LassoCheckResult]: Loop: 207344#L377 assume !false; 209577#L295 assume 0 == ~wl_st~0; 209575#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 209573#L321 assume !(0 != eval_~tmp~0#1); 208610#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 208608#L336 assume !(0 != eval_~tmp___0~0#1); 208606#L332 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 208594#L351 assume !(0 != eval_~tmp___1~0#1); 208603#L347 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 208706#L366 assume !(0 != eval_~tmp___2~0#1); 208716#L362 assume !(0 == ~r_st~0); 207344#L377 [2022-07-22 02:43:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2022-07-22 02:43:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991363601] [2022-07-22 02:43:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:31,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:31,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:31,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:31,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1628767882, now seen corresponding path program 1 times [2022-07-22 02:43:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:31,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944264034] [2022-07-22 02:43:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:31,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:31,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:31,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:31,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2080851842, now seen corresponding path program 1 times [2022-07-22 02:43:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:31,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279952064] [2022-07-22 02:43:31,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:31,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:31,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:32,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 02:43:32 BoogieIcfgContainer [2022-07-22 02:43:32,203 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 02:43:32,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 02:43:32,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 02:43:32,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 02:43:32,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:43:18" (3/4) ... [2022-07-22 02:43:32,206 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 02:43:32,309 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 02:43:32,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 02:43:32,310 INFO L158 Benchmark]: Toolchain (without parser) took 14545.94ms. Allocated memory was 56.6MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 34.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 337.8MB. Max. memory is 16.1GB. [2022-07-22 02:43:32,310 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:43:32,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.77ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.5MB in the beginning and 48.9MB in the end (delta: -14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 02:43:32,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.27ms. Allocated memory is still 69.2MB. Free memory was 48.7MB in the beginning and 46.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:43:32,311 INFO L158 Benchmark]: Boogie Preprocessor took 31.47ms. Allocated memory is still 69.2MB. Free memory was 46.5MB in the beginning and 44.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:43:32,311 INFO L158 Benchmark]: RCFGBuilder took 544.78ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 41.9MB in the end (delta: 2.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-07-22 02:43:32,311 INFO L158 Benchmark]: BuchiAutomizer took 13465.68ms. Allocated memory was 69.2MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 41.6MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 308.2MB. Max. memory is 16.1GB. [2022-07-22 02:43:32,311 INFO L158 Benchmark]: Witness Printer took 105.94ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.2GB in the end (delta: -98.6MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-07-22 02:43:32,313 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.24ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.77ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.5MB in the beginning and 48.9MB in the end (delta: -14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.27ms. Allocated memory is still 69.2MB. Free memory was 48.7MB in the beginning and 46.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.47ms. Allocated memory is still 69.2MB. Free memory was 46.5MB in the beginning and 44.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.78ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 41.9MB in the end (delta: 2.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 13465.68ms. Allocated memory was 69.2MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 41.6MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 308.2MB. Max. memory is 16.1GB. * Witness Printer took 105.94ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.2GB in the end (delta: -98.6MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (16 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_wl + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_g + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 33433 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 17 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 0.4s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 10. Automata minimization 2.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 1573 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4286 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4283 mSDsluCounter, 7691 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3114 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 4577 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc2 concLT2 SILN1 SILU0 SILI8 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf100 smp100 dnf211 smp54 tf110 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 294]: 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@6d6a1b71=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5179c259=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a0be7f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8ef5540=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f5d16c9=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: 294]: 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 ; [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 [L404] COND FALSE !((int )c_req_up == 1) [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 [L440] COND FALSE !((int )e_f == 0) [L445] COND FALSE !((int )e_g == 0) [L450] COND FALSE !((int )e_e == 0) [L455] COND FALSE !((int )e_c == 0) [L460] COND FALSE !((int )e_wl == 0) [L465] COND FALSE !((int )wl_pc == 1) [L473] COND FALSE !((int )wl_pc == 2) [L483] COND FALSE !((int )c1_pc == 1) [L492] COND FALSE !((int )c2_pc == 1) [L501] COND FALSE !((int )wb_pc == 1) [L510] COND FALSE !((int )e_c == 1) [L515] COND FALSE !((int )e_e == 1) [L520] COND FALSE !((int )e_f == 1) [L525] COND FALSE !((int )e_g == 1) [L530] COND FALSE !((int )e_c == 1) [L535] COND FALSE !((int )e_wl == 1) [L541] COND TRUE 1 [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-22 02:43:32,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)