./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:21:21,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:21:21,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:21:21,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:21:21,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:21:21,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:21:21,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:21:21,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:21:21,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:21:21,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:21:21,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:21:21,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:21:21,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:21:21,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:21:21,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:21:21,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:21:21,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:21:21,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:21:21,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:21:21,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:21:21,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:21:21,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:21:21,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:21:21,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:21:21,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:21:21,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:21:21,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:21:21,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:21:21,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:21:21,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:21:21,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:21:21,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:21:21,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:21:21,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:21:21,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:21:21,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:21:21,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:21:21,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:21:21,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:21:21,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:21:21,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:21:21,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:21:21,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:21:21,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:21:21,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:21:21,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:21:21,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:21:21,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:21:21,471 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:21:21,472 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:21:21,472 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:21:21,472 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:21:21,473 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:21:21,473 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:21:21,473 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:21:21,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:21:21,474 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:21:21,474 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:21:21,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:21:21,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:21:21,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:21:21,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:21:21,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:21:21,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:21:21,476 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:21:21,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:21:21,477 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:21:21,477 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:21:21,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:21:21,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:21:21,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:21:21,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:21:21,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:21:21,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:21:21,479 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:21:21,479 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2021-12-15 17:21:21,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:21:21,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:21:21,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:21:21,718 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:21:21,719 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:21:21,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2021-12-15 17:21:21,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e07f2315/b53ad475b3d94c00ac00112f1c1bbebd/FLAG613238d9e [2021-12-15 17:21:22,151 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:21:22,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2021-12-15 17:21:22,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e07f2315/b53ad475b3d94c00ac00112f1c1bbebd/FLAG613238d9e [2021-12-15 17:21:22,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e07f2315/b53ad475b3d94c00ac00112f1c1bbebd [2021-12-15 17:21:22,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:21:22,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:21:22,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:21:22,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:21:22,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:21:22,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4639b521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22, skipping insertion in model container [2021-12-15 17:21:22,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:21:22,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:21:22,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[698,711] [2021-12-15 17:21:22,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:21:22,794 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:21:22,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[698,711] [2021-12-15 17:21:22,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:21:22,843 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:21:22,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22 WrapperNode [2021-12-15 17:21:22,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:21:22,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:21:22,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:21:22,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:21:22,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,894 INFO L137 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 363 [2021-12-15 17:21:22,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:21:22,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:21:22,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:21:22,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:21:22,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:21:22,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:21:22,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:21:22,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:21:22,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:21:22,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:21:22,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:21:23,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:21:23,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:21:23,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:21:23,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:21:23,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:21:23,109 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:21:23,110 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:21:23,454 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:21:23,461 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:21:23,461 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-15 17:21:23,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:21:23 BoogieIcfgContainer [2021-12-15 17:21:23,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:21:23,464 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:21:23,464 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:21:23,473 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:21:23,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:23,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:21:22" (1/3) ... [2021-12-15 17:21:23,475 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d2c62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:21:23, skipping insertion in model container [2021-12-15 17:21:23,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:23,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (2/3) ... [2021-12-15 17:21:23,476 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d2c62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:21:23, skipping insertion in model container [2021-12-15 17:21:23,476 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:23,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:21:23" (3/3) ... [2021-12-15 17:21:23,477 INFO L388 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2021-12-15 17:21:23,568 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:21:23,568 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:21:23,568 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:21:23,569 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:21:23,569 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:21:23,569 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:21:23,569 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:21:23,570 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:21:23,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:23,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2021-12-15 17:21:23,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,633 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:23,634 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:23,634 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:21:23,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:23,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2021-12-15 17:21:23,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,655 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:23,656 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:23,662 INFO L791 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 21#L416true assume !(1 == ~c_req_up~0); 112#L416-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 62#L427-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 71#L432-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 33#L437-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 45#L442-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 108#L447-1true assume !(0 == ~e_f~0); 36#L452-1true assume !(0 == ~e_g~0); 9#L457-1true assume !(0 == ~e_e~0); 120#L462-1true assume !(0 == ~e_c~0); 25#L467-1true assume !(0 == ~e_wl~0); 101#L472-1true assume !(1 == ~wl_pc~0); 125#L484true assume !(2 == ~wl_pc~0); 94#L485true assume !(1 == ~c1_pc~0); 26#L495true assume !(1 == ~c2_pc~0); 75#L504true assume !(1 == ~wb_pc~0); 98#L513true assume !(1 == ~e_c~0); 17#L522-1true assume !(1 == ~e_e~0); 106#L527-1true assume !(1 == ~e_f~0); 38#L532-1true assume !(1 == ~e_g~0); 85#L537-1true assume !(1 == ~e_c~0); 56#L542-1true assume !(1 == ~e_wl~0); 103#L684-1true [2021-12-15 17:21:23,664 INFO L793 eck$LassoCheckResult]: Loop: 103#L684-1true assume !false; 134#L554true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 19#L389true assume false; 78#L405true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 24#L560true assume !(1 == ~c_req_up~0); 100#L560-2true start_simulation_~kernel_st~0#1 := 3; 109#L572true assume 0 == ~e_f~0;~e_f~0 := 1; 23#L572-2true assume 0 == ~e_g~0;~e_g~0 := 1; 49#L577-1true assume !(0 == ~e_e~0); 34#L582-1true assume 0 == ~e_c~0;~e_c~0 := 1; 42#L587-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 57#L592-1true assume !(1 == ~wl_pc~0); 50#L604true assume !(2 == ~wl_pc~0); 58#L605true assume !(1 == ~c1_pc~0); 8#L615true assume !(1 == ~c2_pc~0); 47#L624true assume !(1 == ~wb_pc~0); 127#L633true assume 1 == ~e_c~0;~r_st~0 := 0; 88#L642-1true assume 1 == ~e_e~0;~e_e~0 := 2; 27#L647-1true assume 1 == ~e_f~0;~e_f~0 := 2; 13#L652-1true assume !(1 == ~e_g~0); 89#L657-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L662-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 104#L667-1true assume 0 == ~wl_st~0; 103#L684-1true [2021-12-15 17:21:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-12-15 17:21:23,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567753496] [2021-12-15 17:21:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:23,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567753496] [2021-12-15 17:21:23,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567753496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031025099] [2021-12-15 17:21:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,906 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash -696614142, now seen corresponding path program 1 times [2021-12-15 17:21:23,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405744281] [2021-12-15 17:21:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:23,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405744281] [2021-12-15 17:21:23,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405744281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:21:23,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266090997] [2021-12-15 17:21:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,923 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:23,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:23,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:21:23,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:21:23,956 INFO L87 Difference]: Start difference. First operand has 134 states, 133 states have (on average 1.8195488721804511) internal successors, (242), 133 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:23,969 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2021-12-15 17:21:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:21:23,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2021-12-15 17:21:23,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:23,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2021-12-15 17:21:23,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-15 17:21:23,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-15 17:21:23,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2021-12-15 17:21:23,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:23,984 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2021-12-15 17:21:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2021-12-15 17:21:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-15 17:21:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.746031746031746) internal successors, (220), 125 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2021-12-15 17:21:24,010 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2021-12-15 17:21:24,010 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2021-12-15 17:21:24,010 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:21:24,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2021-12-15 17:21:24,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,013 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,013 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,014 INFO L791 eck$LassoCheckResult]: Stem: 400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 309#L416 assume !(1 == ~c_req_up~0); 311#L416-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 369#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 370#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 334#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 335#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 352#L447-1 assume !(0 == ~e_f~0); 340#L452-1 assume !(0 == ~e_g~0); 287#L457-1 assume !(0 == ~e_e~0); 288#L462-1 assume !(0 == ~e_c~0); 319#L467-1 assume !(0 == ~e_wl~0); 320#L472-1 assume !(1 == ~wl_pc~0); 395#L484 assume !(2 == ~wl_pc~0); 391#L485 assume !(1 == ~c1_pc~0); 321#L495 assume !(1 == ~c2_pc~0); 323#L504 assume !(1 == ~wb_pc~0); 379#L513 assume !(1 == ~e_c~0); 300#L522-1 assume !(1 == ~e_e~0); 301#L527-1 assume !(1 == ~e_f~0); 341#L532-1 assume !(1 == ~e_g~0); 342#L537-1 assume !(1 == ~e_c~0); 363#L542-1 assume !(1 == ~e_wl~0); 278#L684-1 [2021-12-15 17:21:24,014 INFO L793 eck$LassoCheckResult]: Loop: 278#L684-1 assume !false; 397#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 305#L389 assume !false; 306#L307 assume !(0 == ~wl_st~0); 358#L311 assume !(0 == ~c1_st~0); 359#L314 assume !(0 == ~c2_st~0); 279#L317 assume !(0 == ~wb_st~0); 281#L320 assume !(0 == ~r_st~0); 382#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 316#L560 assume !(1 == ~c_req_up~0); 318#L560-2 start_simulation_~kernel_st~0#1 := 3; 394#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 315#L577-1 assume !(0 == ~e_e~0); 336#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 337#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 349#L592-1 assume !(1 == ~wl_pc~0); 357#L604 assume !(2 == ~wl_pc~0); 308#L605 assume !(1 == ~c1_pc~0); 284#L615 assume !(1 == ~c2_pc~0); 286#L624 assume !(1 == ~wb_pc~0); 355#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 388#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 324#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 294#L652-1 assume !(1 == ~e_g~0); 295#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 385#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 386#L667-1 assume 0 == ~wl_st~0; 278#L684-1 [2021-12-15 17:21:24,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-12-15 17:21:24,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243991645] [2021-12-15 17:21:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243991645] [2021-12-15 17:21:24,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243991645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755221858] [2021-12-15 17:21:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,052 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 1 times [2021-12-15 17:21:24,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429429105] [2021-12-15 17:21:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429429105] [2021-12-15 17:21:24,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429429105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542568026] [2021-12-15 17:21:24,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,101 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:24,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:24,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:24,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:24,102 INFO L87 Difference]: Start difference. First operand 126 states and 220 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:24,121 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2021-12-15 17:21:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:24,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2021-12-15 17:21:24,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2021-12-15 17:21:24,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-15 17:21:24,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-15 17:21:24,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2021-12-15 17:21:24,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:24,127 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2021-12-15 17:21:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2021-12-15 17:21:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-15 17:21:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 125 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2021-12-15 17:21:24,133 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2021-12-15 17:21:24,134 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2021-12-15 17:21:24,134 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:21:24,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2021-12-15 17:21:24,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,136 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,137 INFO L791 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 568#L416 assume !(1 == ~c_req_up~0); 570#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 628#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 629#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 593#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 594#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 611#L447-1 assume !(0 == ~e_f~0); 599#L452-1 assume !(0 == ~e_g~0); 546#L457-1 assume !(0 == ~e_e~0); 547#L462-1 assume !(0 == ~e_c~0); 578#L467-1 assume !(0 == ~e_wl~0); 579#L472-1 assume !(1 == ~wl_pc~0); 654#L484 assume !(2 == ~wl_pc~0); 650#L485 assume !(1 == ~c1_pc~0); 580#L495 assume !(1 == ~c2_pc~0); 582#L504 assume !(1 == ~wb_pc~0); 638#L513 assume !(1 == ~e_c~0); 559#L522-1 assume !(1 == ~e_e~0); 560#L527-1 assume !(1 == ~e_f~0); 600#L532-1 assume !(1 == ~e_g~0); 601#L537-1 assume !(1 == ~e_c~0); 622#L542-1 assume !(1 == ~e_wl~0); 537#L684-1 [2021-12-15 17:21:24,137 INFO L793 eck$LassoCheckResult]: Loop: 537#L684-1 assume !false; 656#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 564#L389 assume !false; 565#L307 assume !(0 == ~wl_st~0); 617#L311 assume !(0 == ~c1_st~0); 618#L314 assume !(0 == ~c2_st~0); 538#L317 assume !(0 == ~wb_st~0); 540#L320 assume !(0 == ~r_st~0); 641#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 575#L560 assume !(1 == ~c_req_up~0); 577#L560-2 start_simulation_~kernel_st~0#1 := 3; 653#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 573#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 574#L577-1 assume !(0 == ~e_e~0); 595#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 596#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 608#L592-1 assume !(1 == ~wl_pc~0); 616#L604 assume !(2 == ~wl_pc~0); 567#L605 assume !(1 == ~c1_pc~0); 543#L615 assume !(1 == ~c2_pc~0); 545#L624 assume !(1 == ~wb_pc~0); 614#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 647#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 583#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 553#L652-1 assume !(1 == ~e_g~0); 554#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 644#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 645#L667-1 assume 0 == ~wl_st~0; 537#L684-1 [2021-12-15 17:21:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-12-15 17:21:24,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406392486] [2021-12-15 17:21:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406392486] [2021-12-15 17:21:24,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406392486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237513949] [2021-12-15 17:21:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,171 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 2 times [2021-12-15 17:21:24,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752449092] [2021-12-15 17:21:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752449092] [2021-12-15 17:21:24,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752449092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842730021] [2021-12-15 17:21:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,248 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:24,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:24,249 INFO L87 Difference]: Start difference. First operand 126 states and 219 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:24,263 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2021-12-15 17:21:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:24,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 218 transitions. [2021-12-15 17:21:24,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 218 transitions. [2021-12-15 17:21:24,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-15 17:21:24,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-15 17:21:24,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 218 transitions. [2021-12-15 17:21:24,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:24,282 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2021-12-15 17:21:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 218 transitions. [2021-12-15 17:21:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-15 17:21:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7301587301587302) internal successors, (218), 125 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 218 transitions. [2021-12-15 17:21:24,291 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2021-12-15 17:21:24,291 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2021-12-15 17:21:24,291 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:21:24,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 218 transitions. [2021-12-15 17:21:24,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,296 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,296 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,296 INFO L791 eck$LassoCheckResult]: Stem: 918#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 871#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 827#L416 assume !(1 == ~c_req_up~0); 829#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 887#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 888#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 854#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 855#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 870#L447-1 assume !(0 == ~e_f~0); 858#L452-1 assume !(0 == ~e_g~0); 805#L457-1 assume !(0 == ~e_e~0); 806#L462-1 assume !(0 == ~e_c~0); 837#L467-1 assume !(0 == ~e_wl~0); 838#L472-1 assume !(1 == ~wl_pc~0); 913#L484 assume !(2 == ~wl_pc~0); 909#L485 assume !(1 == ~c1_pc~0); 839#L495 assume !(1 == ~c2_pc~0); 841#L504 assume !(1 == ~wb_pc~0); 897#L513 assume !(1 == ~e_c~0); 818#L522-1 assume !(1 == ~e_e~0); 819#L527-1 assume !(1 == ~e_f~0); 859#L532-1 assume !(1 == ~e_g~0); 860#L537-1 assume !(1 == ~e_c~0); 881#L542-1 assume !(1 == ~e_wl~0); 796#L684-1 [2021-12-15 17:21:24,296 INFO L793 eck$LassoCheckResult]: Loop: 796#L684-1 assume !false; 915#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 823#L389 assume !false; 824#L307 assume !(0 == ~wl_st~0); 876#L311 assume !(0 == ~c1_st~0); 877#L314 assume !(0 == ~c2_st~0); 797#L317 assume !(0 == ~wb_st~0); 799#L320 assume !(0 == ~r_st~0); 900#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 834#L560 assume !(1 == ~c_req_up~0); 836#L560-2 start_simulation_~kernel_st~0#1 := 3; 912#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 832#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 833#L577-1 assume !(0 == ~e_e~0); 852#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 853#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 867#L592-1 assume 1 == ~wl_pc~0; 882#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 826#L605 assume !(1 == ~c1_pc~0); 802#L615 assume !(1 == ~c2_pc~0); 804#L624 assume !(1 == ~wb_pc~0); 873#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 906#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 842#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 812#L652-1 assume !(1 == ~e_g~0); 813#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 903#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 904#L667-1 assume 0 == ~wl_st~0; 796#L684-1 [2021-12-15 17:21:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-12-15 17:21:24,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432391931] [2021-12-15 17:21:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432391931] [2021-12-15 17:21:24,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432391931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486294874] [2021-12-15 17:21:24,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,365 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 1 times [2021-12-15 17:21:24,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42616516] [2021-12-15 17:21:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42616516] [2021-12-15 17:21:24,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42616516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722813248] [2021-12-15 17:21:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,413 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:24,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:24,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:24,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:24,415 INFO L87 Difference]: Start difference. First operand 126 states and 218 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:24,436 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2021-12-15 17:21:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:24,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 217 transitions. [2021-12-15 17:21:24,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 217 transitions. [2021-12-15 17:21:24,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-12-15 17:21:24,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-12-15 17:21:24,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 217 transitions. [2021-12-15 17:21:24,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:24,447 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2021-12-15 17:21:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 217 transitions. [2021-12-15 17:21:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-15 17:21:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2021-12-15 17:21:24,458 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2021-12-15 17:21:24,458 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2021-12-15 17:21:24,458 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:21:24,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 217 transitions. [2021-12-15 17:21:24,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,460 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,461 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,461 INFO L791 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1086#L416 assume !(1 == ~c_req_up~0); 1088#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1146#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1147#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1113#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1114#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1129#L447-1 assume !(0 == ~e_f~0); 1117#L452-1 assume !(0 == ~e_g~0); 1064#L457-1 assume !(0 == ~e_e~0); 1065#L462-1 assume !(0 == ~e_c~0); 1096#L467-1 assume !(0 == ~e_wl~0); 1097#L472-1 assume !(1 == ~wl_pc~0); 1172#L484 assume !(2 == ~wl_pc~0); 1168#L485 assume !(1 == ~c1_pc~0); 1098#L495 assume !(1 == ~c2_pc~0); 1100#L504 assume !(1 == ~wb_pc~0); 1156#L513 assume !(1 == ~e_c~0); 1077#L522-1 assume !(1 == ~e_e~0); 1078#L527-1 assume !(1 == ~e_f~0); 1118#L532-1 assume !(1 == ~e_g~0); 1119#L537-1 assume !(1 == ~e_c~0); 1140#L542-1 assume !(1 == ~e_wl~0); 1055#L684-1 [2021-12-15 17:21:24,462 INFO L793 eck$LassoCheckResult]: Loop: 1055#L684-1 assume !false; 1174#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1082#L389 assume !false; 1083#L307 assume !(0 == ~wl_st~0); 1135#L311 assume !(0 == ~c1_st~0); 1136#L314 assume !(0 == ~c2_st~0); 1056#L317 assume !(0 == ~wb_st~0); 1058#L320 assume !(0 == ~r_st~0); 1159#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1093#L560 assume !(1 == ~c_req_up~0); 1095#L560-2 start_simulation_~kernel_st~0#1 := 3; 1171#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1091#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1092#L577-1 assume !(0 == ~e_e~0); 1111#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1112#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1126#L592-1 assume 1 == ~wl_pc~0; 1141#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1085#L605 assume !(1 == ~c1_pc~0); 1061#L615 assume !(1 == ~c2_pc~0); 1063#L624 assume !(1 == ~wb_pc~0); 1132#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1165#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1101#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1071#L652-1 assume !(1 == ~e_g~0); 1072#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1162#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1163#L667-1 assume 0 == ~wl_st~0; 1055#L684-1 [2021-12-15 17:21:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-12-15 17:21:24,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348742162] [2021-12-15 17:21:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:21:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,518 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:21:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 2 times [2021-12-15 17:21:24,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878526706] [2021-12-15 17:21:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878526706] [2021-12-15 17:21:24,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878526706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747256517] [2021-12-15 17:21:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,560 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:24,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:24,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:24,561 INFO L87 Difference]: Start difference. First operand 126 states and 217 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:24,610 INFO L93 Difference]: Finished difference Result 160 states and 279 transitions. [2021-12-15 17:21:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:24,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 279 transitions. [2021-12-15 17:21:24,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-15 17:21:24,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 279 transitions. [2021-12-15 17:21:24,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2021-12-15 17:21:24,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2021-12-15 17:21:24,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 279 transitions. [2021-12-15 17:21:24,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:24,621 INFO L681 BuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2021-12-15 17:21:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 279 transitions. [2021-12-15 17:21:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-15 17:21:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 160 states have (on average 1.74375) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 279 transitions. [2021-12-15 17:21:24,636 INFO L704 BuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2021-12-15 17:21:24,637 INFO L587 BuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2021-12-15 17:21:24,637 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:21:24,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 279 transitions. [2021-12-15 17:21:24,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-15 17:21:24,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,639 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,642 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,643 INFO L791 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1378#L416 assume !(1 == ~c_req_up~0); 1380#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1441#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1442#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1406#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1407#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1424#L447-1 assume !(0 == ~e_f~0); 1410#L452-1 assume 0 == ~e_g~0;~e_g~0 := 1; 1411#L457-1 assume !(0 == ~e_e~0); 1502#L462-1 assume !(0 == ~e_c~0); 1501#L467-1 assume !(0 == ~e_wl~0); 1500#L472-1 assume !(1 == ~wl_pc~0); 1498#L484 assume !(2 == ~wl_pc~0); 1496#L485 assume !(1 == ~c1_pc~0); 1391#L495 assume !(1 == ~c2_pc~0); 1393#L504 assume !(1 == ~wb_pc~0); 1451#L513 assume !(1 == ~e_c~0); 1369#L522-1 assume !(1 == ~e_e~0); 1370#L527-1 assume !(1 == ~e_f~0); 1412#L532-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1413#L537-1 assume !(1 == ~e_c~0); 1435#L542-1 assume !(1 == ~e_wl~0); 1347#L684-1 [2021-12-15 17:21:24,643 INFO L793 eck$LassoCheckResult]: Loop: 1347#L684-1 assume !false; 1470#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1374#L389 assume !false; 1375#L307 assume !(0 == ~wl_st~0); 1430#L311 assume !(0 == ~c1_st~0); 1431#L314 assume !(0 == ~c2_st~0); 1348#L317 assume !(0 == ~wb_st~0); 1350#L320 assume !(0 == ~r_st~0); 1454#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1386#L560 assume !(1 == ~c_req_up~0); 1388#L560-2 start_simulation_~kernel_st~0#1 := 3; 1466#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1383#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1384#L577-1 assume !(0 == ~e_e~0); 1503#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1420#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1421#L592-1 assume !(1 == ~wl_pc~0); 1429#L604 assume !(2 == ~wl_pc~0); 1377#L605 assume !(1 == ~c1_pc~0); 1353#L615 assume !(1 == ~c2_pc~0); 1355#L624 assume !(1 == ~wb_pc~0); 1427#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1461#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1394#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1363#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1364#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1457#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1458#L667-1 assume 0 == ~wl_st~0; 1347#L684-1 [2021-12-15 17:21:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2021-12-15 17:21:24,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845436634] [2021-12-15 17:21:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845436634] [2021-12-15 17:21:24,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845436634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:21:24,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126086813] [2021-12-15 17:21:24,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,674 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1432528190, now seen corresponding path program 1 times [2021-12-15 17:21:24,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064038677] [2021-12-15 17:21:24,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064038677] [2021-12-15 17:21:24,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064038677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:21:24,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034639230] [2021-12-15 17:21:24,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,703 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:24,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:21:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:21:24,704 INFO L87 Difference]: Start difference. First operand 160 states and 279 transitions. cyclomatic complexity: 120 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:24,792 INFO L93 Difference]: Finished difference Result 226 states and 380 transitions. [2021-12-15 17:21:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:21:24,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 380 transitions. [2021-12-15 17:21:24,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2021-12-15 17:21:24,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 380 transitions. [2021-12-15 17:21:24,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2021-12-15 17:21:24,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2021-12-15 17:21:24,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 380 transitions. [2021-12-15 17:21:24,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:24,799 INFO L681 BuchiCegarLoop]: Abstraction has 226 states and 380 transitions. [2021-12-15 17:21:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 380 transitions. [2021-12-15 17:21:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 215. [2021-12-15 17:21:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.697674418604651) internal successors, (365), 214 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 365 transitions. [2021-12-15 17:21:24,814 INFO L704 BuchiCegarLoop]: Abstraction has 215 states and 365 transitions. [2021-12-15 17:21:24,814 INFO L587 BuchiCegarLoop]: Abstraction has 215 states and 365 transitions. [2021-12-15 17:21:24,814 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:21:24,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 365 transitions. [2021-12-15 17:21:24,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2021-12-15 17:21:24,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,819 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,820 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:21:24,820 INFO L791 eck$LassoCheckResult]: Stem: 1869#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1776#L416 assume !(1 == ~c_req_up~0); 1778#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1834#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1835#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1801#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1802#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1817#L447-1 assume !(0 == ~e_f~0); 1808#L452-1 assume !(0 == ~e_g~0); 1752#L457-1 assume !(0 == ~e_e~0); 1753#L462-1 assume !(0 == ~e_c~0); 1784#L467-1 assume !(0 == ~e_wl~0); 1785#L472-1 assume !(1 == ~wl_pc~0); 1862#L484 assume !(2 == ~wl_pc~0); 1858#L485 assume !(1 == ~c1_pc~0); 1786#L495 assume !(1 == ~c2_pc~0); 1788#L504 assume !(1 == ~wb_pc~0); 1844#L513 assume !(1 == ~e_c~0); 1876#L522-1 assume !(1 == ~e_e~0); 1874#L527-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1873#L532-1 assume !(1 == ~e_g~0); 1806#L537-1 assume !(1 == ~e_c~0); 1828#L542-1 assume !(1 == ~e_wl~0); 1746#L684-1 [2021-12-15 17:21:24,820 INFO L793 eck$LassoCheckResult]: Loop: 1746#L684-1 assume !false; 1864#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1770#L389 assume !false; 1771#L307 assume !(0 == ~wl_st~0); 1823#L311 assume !(0 == ~c1_st~0); 1824#L314 assume !(0 == ~c2_st~0); 1742#L317 assume !(0 == ~wb_st~0); 1744#L320 assume !(0 == ~r_st~0); 1848#L405 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1781#L560 assume !(1 == ~c_req_up~0); 1783#L560-2 start_simulation_~kernel_st~0#1 := 3; 1860#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1779#L572-2 assume !(0 == ~e_g~0); 1780#L577-1 assume !(0 == ~e_e~0); 1799#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1800#L587-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1814#L592-1 assume 1 == ~wl_pc~0; 1829#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1773#L605 assume !(1 == ~c1_pc~0); 1749#L615 assume !(1 == ~c2_pc~0); 1751#L624 assume !(1 == ~wb_pc~0); 1820#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1870#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1872#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1871#L652-1 assume !(1 == ~e_g~0); 1760#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1851#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1852#L667-1 assume 0 == ~wl_st~0; 1746#L684-1 [2021-12-15 17:21:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2021-12-15 17:21:24,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488561353] [2021-12-15 17:21:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:21:24,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488561353] [2021-12-15 17:21:24,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488561353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:21:24,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275243532] [2021-12-15 17:21:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,859 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash -137740303, now seen corresponding path program 1 times [2021-12-15 17:21:24,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891830705] [2021-12-15 17:21:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:21:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,871 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:21:25,173 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:818) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:21:25,177 INFO L158 Benchmark]: Toolchain (without parser) took 2610.43ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 74.7MB in the beginning and 73.1MB in the end (delta: 1.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2021-12-15 17:21:25,177 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 102.8MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:21:25,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.02ms. Allocated memory is still 102.8MB. Free memory was 74.7MB in the beginning and 76.1MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:21:25,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 73.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:21:25,179 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:21:25,179 INFO L158 Benchmark]: RCFGBuilder took 540.44ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 52.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-15 17:21:25,180 INFO L158 Benchmark]: BuchiAutomizer took 1711.46ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 52.8MB in the beginning and 73.1MB in the end (delta: -20.4MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2021-12-15 17:21:25,182 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.77ms. Allocated memory is still 102.8MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.02ms. Allocated memory is still 102.8MB. Free memory was 74.7MB in the beginning and 76.1MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 73.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 540.44ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 52.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 1711.46ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 52.8MB in the beginning and 73.1MB in the end (delta: -20.4MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:21:25,216 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable