./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.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/pc_sfifo_1.cil-1.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 c74d959057dcef9924c2fba34a5baac5be90cef6ad1eac335d6f9d2397fc60bb --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:20:16,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:20:16,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:20:16,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:20:16,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:20:16,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:20:16,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:20:16,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:20:16,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:20:16,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:20:16,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:20:16,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:20:16,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:20:16,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:20:16,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:20:16,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:20:16,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:20:16,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:20:16,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:20:16,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:20:16,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:20:16,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:20:16,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:20:16,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:20:16,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:20:16,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:20:16,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:20:16,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:20:16,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:20:16,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:20:16,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:20:16,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:20:16,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:20:16,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:20:16,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:20:16,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:20:16,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:20:16,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:20:16,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:20:16,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:20:16,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:20:16,557 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:20:16,585 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:20:16,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:20:16,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:20:16,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:20:16,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:20:16,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:20:16,587 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:20:16,587 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:20:16,587 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:20:16,588 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:20:16,588 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:20:16,588 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:20:16,588 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:20:16,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:20:16,589 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:20:16,589 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:20:16,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:20:16,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:20:16,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:20:16,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:20:16,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:20:16,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:20:16,590 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:20:16,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:20:16,590 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:20:16,590 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:20:16,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:20:16,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:20:16,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:20:16,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:20:16,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:20:16,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:20:16,592 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:20:16,592 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 -> c74d959057dcef9924c2fba34a5baac5be90cef6ad1eac335d6f9d2397fc60bb [2021-12-15 17:20:16,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:20:16,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:20:16,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:20:16,789 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:20:16,790 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:20:16,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2021-12-15 17:20:16,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a625141/f19c5a850b334af6a7e577897f641b2f/FLAGeb421c8c1 [2021-12-15 17:20:17,186 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:20:17,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2021-12-15 17:20:17,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a625141/f19c5a850b334af6a7e577897f641b2f/FLAGeb421c8c1 [2021-12-15 17:20:17,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a625141/f19c5a850b334af6a7e577897f641b2f [2021-12-15 17:20:17,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:20:17,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:20:17,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:20:17,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:20:17,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:20:17,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1651333c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17, skipping insertion in model container [2021-12-15 17:20:17,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:20:17,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:20:17,325 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/pc_sfifo_1.cil-1.c[642,655] [2021-12-15 17:20:17,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:20:17,385 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:20:17,395 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/pc_sfifo_1.cil-1.c[642,655] [2021-12-15 17:20:17,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:20:17,433 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:20:17,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17 WrapperNode [2021-12-15 17:20:17,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:20:17,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:20:17,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:20:17,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:20:17,439 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:20:17" (1/1) ... [2021-12-15 17:20:17,451 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:20:17" (1/1) ... [2021-12-15 17:20:17,477 INFO L137 Inliner]: procedures = 24, calls = 23, calls flagged for inlining = 18, calls inlined = 20, statements flattened = 260 [2021-12-15 17:20:17,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:20:17,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:20:17,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:20:17,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:20:17,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:20:17,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:20:17,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:20:17,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:20:17,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (1/1) ... [2021-12-15 17:20:17,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:20:17,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:20:17,544 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:20:17,560 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:20:17,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:20:17,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:20:17,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:20:17,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:20:17,633 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:20:17,634 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:20:17,838 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:20:17,842 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:20:17,847 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 17:20:17,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:20:17 BoogieIcfgContainer [2021-12-15 17:20:17,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:20:17,849 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:20:17,849 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:20:17,851 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:20:17,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:20:17,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:20:17" (1/3) ... [2021-12-15 17:20:17,852 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f66f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:20:17, skipping insertion in model container [2021-12-15 17:20:17,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:20:17,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:20:17" (2/3) ... [2021-12-15 17:20:17,853 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f66f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:20:17, skipping insertion in model container [2021-12-15 17:20:17,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:20:17,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:20:17" (3/3) ... [2021-12-15 17:20:17,864 INFO L388 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-1.c [2021-12-15 17:20:17,901 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:20:17,901 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:20:17,902 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:20:17,902 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:20:17,902 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:20:17,902 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:20:17,902 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:20:17,902 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:20:17,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 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:20:17,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2021-12-15 17:20:17,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:17,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:17,932 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:20:17,932 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:17,932 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:20:17,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 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:20:17,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2021-12-15 17:20:17,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:17,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:17,936 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:20:17,936 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:17,941 INFO L791 eck$LassoCheckResult]: Stem: 62#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 44#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 21#L356true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 37#L206true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 4#L206-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 46#L211-1true assume { :end_inline_init_threads } true; 70#L323-2true [2021-12-15 17:20:17,941 INFO L793 eck$LassoCheckResult]: Loop: 70#L323-2true assume !false; 16#L324true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 50#L272true assume false; 29#L288true assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 63#L224-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 78#L236-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 11#L237-1true stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 17#L302true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 19#L309true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 10#L310true start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 57#L330true assume !(0 != start_simulation_~tmp~3#1); 70#L323-2true [2021-12-15 17:20:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2021-12-15 17:20:17,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:17,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331508101] [2021-12-15 17:20:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:17,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,057 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:20:18,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331508101] [2021-12-15 17:20:18,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331508101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:20:18,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141705813] [2021-12-15 17:20:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,063 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:20:18,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1504754769, now seen corresponding path program 1 times [2021-12-15 17:20:18,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706750949] [2021-12-15 17:20:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,078 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:20:18,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706750949] [2021-12-15 17:20:18,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706750949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:20:18,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416980515] [2021-12-15 17:20:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,080 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:20:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:20:18,107 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,130 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2021-12-15 17:20:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:20:18,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 106 transitions. [2021-12-15 17:20:18,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-15 17:20:18,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 99 transitions. [2021-12-15 17:20:18,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-15 17:20:18,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-12-15 17:20:18,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2021-12-15 17:20:18,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,154 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-12-15 17:20:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2021-12-15 17:20:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-15 17:20:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 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:20:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2021-12-15 17:20:18,177 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-12-15 17:20:18,178 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2021-12-15 17:20:18,178 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:20:18,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2021-12-15 17:20:18,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-15 17:20:18,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,181 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,181 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,182 INFO L791 eck$LassoCheckResult]: Stem: 233#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 195#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 196#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 174#L206-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 175#L211-1 assume { :end_inline_init_threads } true; 224#L323-2 [2021-12-15 17:20:18,182 INFO L793 eck$LassoCheckResult]: Loop: 224#L323-2 assume !false; 193#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 178#L272 assume !false; 229#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 188#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 189#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 221#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 222#L252 assume !(0 != eval_~tmp___1~0#1); 208#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 209#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 234#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 184#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 185#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 194#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 182#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 183#L330 assume !(0 != start_simulation_~tmp~3#1); 224#L323-2 [2021-12-15 17:20:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2021-12-15 17:20:18,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345797432] [2021-12-15 17:20:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,221 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:20:18,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345797432] [2021-12-15 17:20:18,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345797432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:20:18,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51418085] [2021-12-15 17:20:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,226 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:20:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1251467551, now seen corresponding path program 1 times [2021-12-15 17:20:18,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978840029] [2021-12-15 17:20:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:20:18,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978840029] [2021-12-15 17:20:18,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978840029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:20:18,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474795708] [2021-12-15 17:20:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,312 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:20:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:20:18,313 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,319 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2021-12-15 17:20:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:20:18,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 98 transitions. [2021-12-15 17:20:18,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-15 17:20:18,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 98 transitions. [2021-12-15 17:20:18,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-15 17:20:18,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-12-15 17:20:18,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 98 transitions. [2021-12-15 17:20:18,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,321 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2021-12-15 17:20:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 98 transitions. [2021-12-15 17:20:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-15 17:20:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.380281690140845) internal successors, (98), 70 states have internal predecessors, (98), 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:20:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2021-12-15 17:20:18,329 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2021-12-15 17:20:18,329 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2021-12-15 17:20:18,329 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:20:18,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2021-12-15 17:20:18,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-12-15 17:20:18,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,330 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,330 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,330 INFO L791 eck$LassoCheckResult]: Stem: 387#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 346#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 347#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 325#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 326#L211-1 assume { :end_inline_init_threads } true; 375#L323-2 [2021-12-15 17:20:18,330 INFO L793 eck$LassoCheckResult]: Loop: 375#L323-2 assume !false; 345#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 329#L272 assume !false; 379#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 339#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 340#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 371#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 372#L252 assume !(0 != eval_~tmp___1~0#1); 359#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 360#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 384#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 335#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 336#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 344#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 333#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 334#L330 assume !(0 != start_simulation_~tmp~3#1); 375#L323-2 [2021-12-15 17:20:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2021-12-15 17:20:18,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255062557] [2021-12-15 17:20:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,336 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,356 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1251467551, now seen corresponding path program 2 times [2021-12-15 17:20:18,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380219037] [2021-12-15 17:20:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,398 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:20:18,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380219037] [2021-12-15 17:20:18,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380219037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:20:18,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291359236] [2021-12-15 17:20:18,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,400 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:20:18,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:20:18,401 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:20:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,510 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2021-12-15 17:20:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:20:18,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 190 transitions. [2021-12-15 17:20:18,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 133 [2021-12-15 17:20:18,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 190 transitions. [2021-12-15 17:20:18,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-15 17:20:18,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-15 17:20:18,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 190 transitions. [2021-12-15 17:20:18,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,516 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 190 transitions. [2021-12-15 17:20:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 190 transitions. [2021-12-15 17:20:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 74. [2021-12-15 17:20:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.364864864864865) internal successors, (101), 73 states have internal predecessors, (101), 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:20:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2021-12-15 17:20:18,524 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 101 transitions. [2021-12-15 17:20:18,524 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 101 transitions. [2021-12-15 17:20:18,524 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:20:18,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 101 transitions. [2021-12-15 17:20:18,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:20:18,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,526 INFO L791 eck$LassoCheckResult]: Stem: 611#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 573#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 574#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 549#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 550#L211-1 assume { :end_inline_init_threads } true; 602#L323-2 [2021-12-15 17:20:18,528 INFO L793 eck$LassoCheckResult]: Loop: 602#L323-2 assume !false; 570#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 555#L272 assume !false; 607#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 565#L224 assume !(0 == ~p_dw_st~0); 567#L228 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 572#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 617#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 618#L252 assume !(0 != eval_~tmp___1~0#1); 586#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 587#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 612#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 561#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 562#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 571#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 559#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 560#L330 assume !(0 != start_simulation_~tmp~3#1); 602#L323-2 [2021-12-15 17:20:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2021-12-15 17:20:18,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138950235] [2021-12-15 17:20:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,540 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 960183933, now seen corresponding path program 1 times [2021-12-15 17:20:18,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350449836] [2021-12-15 17:20:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,555 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:20:18,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350449836] [2021-12-15 17:20:18,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350449836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:20:18,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900494961] [2021-12-15 17:20:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,557 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:20:18,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:20:18,558 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:20:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,573 INFO L93 Difference]: Finished difference Result 120 states and 160 transitions. [2021-12-15 17:20:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:20:18,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 160 transitions. [2021-12-15 17:20:18,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-15 17:20:18,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 160 transitions. [2021-12-15 17:20:18,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2021-12-15 17:20:18,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2021-12-15 17:20:18,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 160 transitions. [2021-12-15 17:20:18,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,576 INFO L681 BuchiCegarLoop]: Abstraction has 120 states and 160 transitions. [2021-12-15 17:20:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 160 transitions. [2021-12-15 17:20:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2021-12-15 17:20:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 102 states have internal predecessors, (136), 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:20:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2021-12-15 17:20:18,580 INFO L704 BuchiCegarLoop]: Abstraction has 103 states and 136 transitions. [2021-12-15 17:20:18,580 INFO L587 BuchiCegarLoop]: Abstraction has 103 states and 136 transitions. [2021-12-15 17:20:18,580 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:20:18,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 136 transitions. [2021-12-15 17:20:18,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:20:18,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,581 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,581 INFO L791 eck$LassoCheckResult]: Stem: 815#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 803#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 774#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 775#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 745#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 746#L211-1 assume { :end_inline_init_threads } true; 804#L323-2 assume !false; 835#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 833#L272 [2021-12-15 17:20:18,582 INFO L793 eck$LassoCheckResult]: Loop: 833#L272 assume !false; 832#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 830#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 828#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 827#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 826#L252 assume 0 != eval_~tmp___1~0#1; 825#L252-1 assume !(0 == ~p_dw_st~0); 797#L257 assume 0 == ~c_dr_st~0;eval_~tmp___0~1#1 := eval_#t~nondet9#1;havoc eval_#t~nondet9#1; 754#L276 assume 0 != eval_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; 755#L149 assume !(0 == ~c_dr_pc~0); 784#L152 assume 1 == ~c_dr_pc~0; 764#L153 do_read_c_~a~0#1 := ~a_t~0; 765#L162-1 do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret4#1, immediate_notify_threads_#t~ret5#1, immediate_notify_threads_~tmp~0#1, immediate_notify_threads_~tmp___0~0#1;havoc immediate_notify_threads_~tmp~0#1;havoc immediate_notify_threads_~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; 777#L42-3 assume 1 == ~p_dw_pc~0; 778#L43-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; 846#L53-1 is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; 776#L54-1 immediate_notify_threads_#t~ret4#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0#1 := immediate_notify_threads_#t~ret4#1;havoc immediate_notify_threads_#t~ret4#1; 749#L84-3 assume 0 != immediate_notify_threads_~tmp~0#1;~p_dw_st~0 := 0; 750#L84-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; 806#L61-3 assume !(1 == ~c_dr_pc~0); 785#L61-5 is_do_read_c_triggered_~__retres1~1#1 := 0; 752#L72-1 is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; 753#L73-1 immediate_notify_threads_#t~ret5#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0#1 := immediate_notify_threads_#t~ret5#1;havoc immediate_notify_threads_#t~ret5#1; 810#L92-3 assume 0 != immediate_notify_threads_~tmp___0~0#1;~c_dr_st~0 := 0; 839#L92-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 838#L182 assume ~p_last_write~0 == ~c_last_read~0; 837#L183 assume ~p_num_write~0 == ~c_num_read~0; 822#L182-1 assume !false; 823#L161 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; 834#L196 assume { :end_inline_do_read_c } true; 833#L272 [2021-12-15 17:20:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 1 times [2021-12-15 17:20:18,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890486765] [2021-12-15 17:20:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,587 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1011488296, now seen corresponding path program 1 times [2021-12-15 17:20:18,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345825592] [2021-12-15 17:20:18,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,605 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:20:18,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345825592] [2021-12-15 17:20:18,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345825592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:20:18,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073368531] [2021-12-15 17:20:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,606 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:20:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:20:18,607 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:20:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,618 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2021-12-15 17:20:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:20:18,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 158 transitions. [2021-12-15 17:20:18,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-15 17:20:18,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 158 transitions. [2021-12-15 17:20:18,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2021-12-15 17:20:18,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2021-12-15 17:20:18,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 158 transitions. [2021-12-15 17:20:18,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,622 INFO L681 BuchiCegarLoop]: Abstraction has 120 states and 158 transitions. [2021-12-15 17:20:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 158 transitions. [2021-12-15 17:20:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2021-12-15 17:20:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 102 states have internal predecessors, (134), 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:20:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2021-12-15 17:20:18,625 INFO L704 BuchiCegarLoop]: Abstraction has 103 states and 134 transitions. [2021-12-15 17:20:18,625 INFO L587 BuchiCegarLoop]: Abstraction has 103 states and 134 transitions. [2021-12-15 17:20:18,625 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:20:18,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 134 transitions. [2021-12-15 17:20:18,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:20:18,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,626 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,626 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,627 INFO L791 eck$LassoCheckResult]: Stem: 1045#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1032#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1003#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1004#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 974#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 975#L211-1 assume { :end_inline_init_threads } true; 1033#L323-2 assume !false; 1066#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1064#L272 [2021-12-15 17:20:18,627 INFO L793 eck$LassoCheckResult]: Loop: 1064#L272 assume !false; 1063#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1061#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1059#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1058#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1057#L252 assume 0 != eval_~tmp___1~0#1; 1056#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1055#L261 assume 0 != eval_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet6#1; 1042#L106 assume 0 == ~p_dw_pc~0; 1018#L117-1 assume !false; 1009#L118 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 1010#L138 assume { :end_inline_do_write_p } true; 1026#L257 assume 0 == ~c_dr_st~0;eval_~tmp___0~1#1 := eval_#t~nondet9#1;havoc eval_#t~nondet9#1; 983#L276 assume 0 != eval_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; 984#L149 assume 0 == ~c_dr_pc~0; 1012#L182-1 assume !false; 997#L161 assume !(1 == ~q_free~0); 994#L162-1 do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret4#1, immediate_notify_threads_#t~ret5#1, immediate_notify_threads_~tmp~0#1, immediate_notify_threads_~tmp___0~0#1;havoc immediate_notify_threads_~tmp~0#1;havoc immediate_notify_threads_~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; 1040#L42-3 assume !(1 == ~p_dw_pc~0); 1029#L42-5 is_do_write_p_triggered_~__retres1~0#1 := 0; 1030#L53-1 is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; 1005#L54-1 immediate_notify_threads_#t~ret4#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0#1 := immediate_notify_threads_#t~ret4#1;havoc immediate_notify_threads_#t~ret4#1; 978#L84-3 assume 0 != immediate_notify_threads_~tmp~0#1;~p_dw_st~0 := 0; 979#L84-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; 1073#L61-3 assume 1 == ~c_dr_pc~0; 1044#L62-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1#1 := 1; 981#L72-1 is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; 982#L73-1 immediate_notify_threads_#t~ret5#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0#1 := immediate_notify_threads_#t~ret5#1;havoc immediate_notify_threads_#t~ret5#1; 1039#L92-3 assume 0 != immediate_notify_threads_~tmp___0~0#1;~c_dr_st~0 := 0; 1070#L92-5 assume { :end_inline_immediate_notify_threads } true;~q_read_ev~0 := 2; 1069#L182 assume ~p_last_write~0 == ~c_last_read~0; 1068#L183 assume ~p_num_write~0 == ~c_num_read~0; 1053#L182-1 assume !false; 1054#L161 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; 1065#L196 assume { :end_inline_do_read_c } true; 1064#L272 [2021-12-15 17:20:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 2 times [2021-12-15 17:20:18,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044476687] [2021-12-15 17:20:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1777713214, now seen corresponding path program 1 times [2021-12-15 17:20:18,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999310629] [2021-12-15 17:20:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:20:18,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999310629] [2021-12-15 17:20:18,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999310629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:20:18,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224408973] [2021-12-15 17:20:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,658 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:20:18,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:20:18,659 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:20:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,674 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2021-12-15 17:20:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:20:18,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 163 transitions. [2021-12-15 17:20:18,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 111 [2021-12-15 17:20:18,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 163 transitions. [2021-12-15 17:20:18,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2021-12-15 17:20:18,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2021-12-15 17:20:18,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 163 transitions. [2021-12-15 17:20:18,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,680 INFO L681 BuchiCegarLoop]: Abstraction has 129 states and 163 transitions. [2021-12-15 17:20:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 163 transitions. [2021-12-15 17:20:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-15 17:20:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 128 states have internal predecessors, (163), 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:20:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2021-12-15 17:20:18,684 INFO L704 BuchiCegarLoop]: Abstraction has 129 states and 163 transitions. [2021-12-15 17:20:18,684 INFO L587 BuchiCegarLoop]: Abstraction has 129 states and 163 transitions. [2021-12-15 17:20:18,685 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:20:18,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 163 transitions. [2021-12-15 17:20:18,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 111 [2021-12-15 17:20:18,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,686 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,686 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,686 INFO L791 eck$LassoCheckResult]: Stem: 1284#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1243#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1244#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1212#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1213#L211-1 assume { :end_inline_init_threads } true; 1272#L323-2 assume !false; 1237#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1238#L272 assume !false; 1340#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1339#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1338#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1337#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1336#L252 assume 0 != eval_~tmp___1~0#1; 1335#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1334#L261 assume 0 != eval_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet6#1; 1323#L106 assume 0 == ~p_dw_pc~0; 1257#L117-1 [2021-12-15 17:20:18,686 INFO L793 eck$LassoCheckResult]: Loop: 1257#L117-1 assume !false; 1248#L118 assume !(0 == ~q_free~0); 1250#L119 ~q_buf_0~0 := do_write_p_#t~nondet6#1;havoc do_write_p_#t~nondet6#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret4#1, immediate_notify_threads_#t~ret5#1, immediate_notify_threads_~tmp~0#1, immediate_notify_threads_~tmp___0~0#1;havoc immediate_notify_threads_~tmp~0#1;havoc immediate_notify_threads_~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; 1285#L42 assume !(1 == ~p_dw_pc~0); 1293#L42-2 is_do_write_p_triggered_~__retres1~0#1 := 0; 1264#L53 is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; 1214#L54 immediate_notify_threads_#t~ret4#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0#1 := immediate_notify_threads_#t~ret4#1;havoc immediate_notify_threads_#t~ret4#1; 1215#L84 assume 0 != immediate_notify_threads_~tmp~0#1;~p_dw_st~0 := 0; 1254#L84-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; 1223#L61 assume 1 == ~c_dr_pc~0; 1224#L62 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1#1 := 1; 1280#L72 is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; 1262#L73 immediate_notify_threads_#t~ret5#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0#1 := immediate_notify_threads_#t~ret5#1;havoc immediate_notify_threads_#t~ret5#1; 1263#L92 assume 0 != immediate_notify_threads_~tmp___0~0#1;~c_dr_st~0 := 0; 1279#L92-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 1257#L117-1 [2021-12-15 17:20:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1617121625, now seen corresponding path program 1 times [2021-12-15 17:20:18,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165391114] [2021-12-15 17:20:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,698 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,698 INFO L85 PathProgramCache]: Analyzing trace with hash -572267128, now seen corresponding path program 1 times [2021-12-15 17:20:18,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854762057] [2021-12-15 17:20:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,745 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:20:18,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854762057] [2021-12-15 17:20:18,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854762057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:20:18,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061480142] [2021-12-15 17:20:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,750 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:20:18,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:20:18,751 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:20:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,799 INFO L93 Difference]: Finished difference Result 285 states and 356 transitions. [2021-12-15 17:20:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:20:18,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 356 transitions. [2021-12-15 17:20:18,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 264 [2021-12-15 17:20:18,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 356 transitions. [2021-12-15 17:20:18,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2021-12-15 17:20:18,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2021-12-15 17:20:18,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 356 transitions. [2021-12-15 17:20:18,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,804 INFO L681 BuchiCegarLoop]: Abstraction has 285 states and 356 transitions. [2021-12-15 17:20:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 356 transitions. [2021-12-15 17:20:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 138. [2021-12-15 17:20:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 137 states have internal predecessors, (171), 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:20:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2021-12-15 17:20:18,812 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 171 transitions. [2021-12-15 17:20:18,812 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 171 transitions. [2021-12-15 17:20:18,812 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:20:18,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 171 transitions. [2021-12-15 17:20:18,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 120 [2021-12-15 17:20:18,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,813 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,813 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,813 INFO L791 eck$LassoCheckResult]: Stem: 1716#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1669#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1670#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1643#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1644#L211-1 assume { :end_inline_init_threads } true; 1702#L323-2 assume !false; 1746#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1744#L272 assume !false; 1742#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1740#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1738#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1735#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1733#L252 assume 0 != eval_~tmp___1~0#1; 1731#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1729#L261 assume 0 != eval_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet6#1; 1726#L106 assume 0 == ~p_dw_pc~0; 1725#L117-1 [2021-12-15 17:20:18,814 INFO L793 eck$LassoCheckResult]: Loop: 1725#L117-1 assume !false; 1674#L118 assume !(0 == ~q_free~0); 1676#L119 ~q_buf_0~0 := do_write_p_#t~nondet6#1;havoc do_write_p_#t~nondet6#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret4#1, immediate_notify_threads_#t~ret5#1, immediate_notify_threads_~tmp~0#1, immediate_notify_threads_~tmp___0~0#1;havoc immediate_notify_threads_~tmp~0#1;havoc immediate_notify_threads_~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; 1717#L42 assume !(1 == ~p_dw_pc~0); 1724#L42-2 is_do_write_p_triggered_~__retres1~0#1 := 0; 1747#L53 is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; 1745#L54 immediate_notify_threads_#t~ret4#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0#1 := immediate_notify_threads_#t~ret4#1;havoc immediate_notify_threads_#t~ret4#1; 1743#L84 assume !(0 != immediate_notify_threads_~tmp~0#1); 1741#L84-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; 1739#L61 assume !(1 == ~c_dr_pc~0); 1736#L61-2 is_do_read_c_triggered_~__retres1~1#1 := 0; 1734#L72 is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; 1732#L73 immediate_notify_threads_#t~ret5#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0#1 := immediate_notify_threads_#t~ret5#1;havoc immediate_notify_threads_#t~ret5#1; 1730#L92 assume 0 != immediate_notify_threads_~tmp___0~0#1;~c_dr_st~0 := 0; 1728#L92-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 1725#L117-1 [2021-12-15 17:20:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1617121625, now seen corresponding path program 2 times [2021-12-15 17:20:18,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800164148] [2021-12-15 17:20:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,823 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1175668571, now seen corresponding path program 1 times [2021-12-15 17:20:18,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093194953] [2021-12-15 17:20:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:20:18,856 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:20:18,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:20:18,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093194953] [2021-12-15 17:20:18,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093194953] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:20:18,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:20:18,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:20:18,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132826723] [2021-12-15 17:20:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:20:18,857 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:20:18,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:20:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:20:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:20:18,857 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. cyclomatic complexity: 35 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:20:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:20:18,894 INFO L93 Difference]: Finished difference Result 306 states and 370 transitions. [2021-12-15 17:20:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:20:18,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 370 transitions. [2021-12-15 17:20:18,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 288 [2021-12-15 17:20:18,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 306 states and 370 transitions. [2021-12-15 17:20:18,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2021-12-15 17:20:18,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2021-12-15 17:20:18,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 370 transitions. [2021-12-15 17:20:18,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:20:18,898 INFO L681 BuchiCegarLoop]: Abstraction has 306 states and 370 transitions. [2021-12-15 17:20:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 370 transitions. [2021-12-15 17:20:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 150. [2021-12-15 17:20:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.22) internal successors, (183), 149 states have internal predecessors, (183), 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:20:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2021-12-15 17:20:18,900 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 183 transitions. [2021-12-15 17:20:18,900 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 183 transitions. [2021-12-15 17:20:18,900 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:20:18,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 183 transitions. [2021-12-15 17:20:18,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 132 [2021-12-15 17:20:18,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:20:18,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:20:18,901 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,901 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:20:18,902 INFO L791 eck$LassoCheckResult]: Stem: 2175#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2128#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 2129#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2099#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2100#L211-1 assume { :end_inline_init_threads } true; 2160#L323-2 assume !false; 2123#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 2124#L272 assume !false; 2234#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2233#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2232#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2231#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 2230#L252 assume 0 != eval_~tmp___1~0#1; 2229#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 2228#L261 assume 0 != eval_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet6#1; 2226#L106 assume 0 == ~p_dw_pc~0; 2225#L117-1 [2021-12-15 17:20:18,902 INFO L793 eck$LassoCheckResult]: Loop: 2225#L117-1 assume !false; 2224#L118 assume !(0 == ~q_free~0); 2223#L119 ~q_buf_0~0 := do_write_p_#t~nondet6#1;havoc do_write_p_#t~nondet6#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;assume { :begin_inline_immediate_notify_threads } true;havoc immediate_notify_threads_#t~ret4#1, immediate_notify_threads_#t~ret5#1, immediate_notify_threads_~tmp~0#1, immediate_notify_threads_~tmp___0~0#1;havoc immediate_notify_threads_~tmp~0#1;havoc immediate_notify_threads_~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; 2222#L42 assume !(1 == ~p_dw_pc~0); 2190#L42-2 is_do_write_p_triggered_~__retres1~0#1 := 0; 2150#L53 is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; 2101#L54 immediate_notify_threads_#t~ret4#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;immediate_notify_threads_~tmp~0#1 := immediate_notify_threads_#t~ret4#1;havoc immediate_notify_threads_#t~ret4#1; 2102#L84 assume !(0 != immediate_notify_threads_~tmp~0#1); 2173#L84-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; 2241#L61 assume !(1 == ~c_dr_pc~0); 2169#L61-2 is_do_read_c_triggered_~__retres1~1#1 := 0; 2170#L72 is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; 2191#L73 immediate_notify_threads_#t~ret5#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;immediate_notify_threads_~tmp___0~0#1 := immediate_notify_threads_#t~ret5#1;havoc immediate_notify_threads_#t~ret5#1; 2166#L92 assume !(0 != immediate_notify_threads_~tmp___0~0#1); 2167#L92-2 assume { :end_inline_immediate_notify_threads } true;~q_write_ev~0 := 2; 2225#L117-1 [2021-12-15 17:20:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1617121625, now seen corresponding path program 3 times [2021-12-15 17:20:18,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791440274] [2021-12-15 17:20:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,919 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1175668509, now seen corresponding path program 1 times [2021-12-15 17:20:18,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456671395] [2021-12-15 17:20:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,925 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:20:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash -667670147, now seen corresponding path program 1 times [2021-12-15 17:20:18,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:20:18,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073145100] [2021-12-15 17:20:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:20:18,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:20:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:20:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:20:18,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:20:19,058 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:855) 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:20:19,061 INFO L158 Benchmark]: Toolchain (without parser) took 1858.76ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 57.2MB in the beginning and 81.4MB in the end (delta: -24.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2021-12-15 17:20:19,062 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 41.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:20:19,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.76ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 57.0MB in the beginning and 96.7MB in the end (delta: -39.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:20:19,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.31ms. Allocated memory is still 121.6MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:20:19,063 INFO L158 Benchmark]: Boogie Preprocessor took 41.32ms. Allocated memory is still 121.6MB. Free memory was 94.6MB in the beginning and 93.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:20:19,063 INFO L158 Benchmark]: RCFGBuilder took 328.41ms. Allocated memory is still 121.6MB. Free memory was 93.2MB in the beginning and 79.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:20:19,063 INFO L158 Benchmark]: BuchiAutomizer took 1211.26ms. Allocated memory is still 121.6MB. Free memory was 79.2MB in the beginning and 81.4MB in the end (delta: -2.2MB). Peak memory consumption was 1.0MB. Max. memory is 16.1GB. [2021-12-15 17:20:19,065 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 41.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.76ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 57.0MB in the beginning and 96.7MB in the end (delta: -39.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.31ms. Allocated memory is still 121.6MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.32ms. Allocated memory is still 121.6MB. Free memory was 94.6MB in the beginning and 93.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 328.41ms. Allocated memory is still 121.6MB. Free memory was 93.2MB in the beginning and 79.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1211.26ms. Allocated memory is still 121.6MB. Free memory was 79.2MB in the beginning and 81.4MB in the end (delta: -2.2MB). Peak memory consumption was 1.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:20:19,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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