/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:45:09,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:45:09,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:45:09,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:45:09,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:45:09,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:45:09,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:45:09,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:45:09,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:45:09,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:45:09,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:45:09,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:45:09,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:45:09,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:45:09,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:45:09,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:45:09,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:45:09,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:45:09,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:45:09,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:45:09,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:45:09,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:45:09,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:45:09,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:45:09,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:45:09,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:45:09,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:45:09,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:45:09,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:45:09,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:45:09,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:45:09,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:45:09,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:45:09,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:45:09,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:45:09,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:45:09,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:45:09,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:45:09,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:45:09,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:45:09,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:45:09,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:45:09,926 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:45:09,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:45:09,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:45:09,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:45:09,928 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:45:09,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:45:09,929 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:45:09,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:45:09,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:45:09,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:45:09,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:45:09,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:45:09,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:45:09,930 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:45:09,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:45:09,930 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:45:09,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:45:09,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:45:09,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:45:09,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:45:09,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:45:09,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:45:09,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:45:09,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:45:09,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:45:09,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:45:09,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:45:09,933 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:45:09,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:45:09,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:45:10,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:45:10,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:45:10,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:45:10,276 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:45:10,277 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:45:10,277 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2020-10-11 18:45:10,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae24c5eb/d6f8626be73e40049a4ab662d687e000/FLAG2ba64a727 [2020-10-11 18:45:10,900 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:45:10,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2020-10-11 18:45:10,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae24c5eb/d6f8626be73e40049a4ab662d687e000/FLAG2ba64a727 [2020-10-11 18:45:11,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae24c5eb/d6f8626be73e40049a4ab662d687e000 [2020-10-11 18:45:11,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:45:11,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:45:11,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:11,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:45:11,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:45:11,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:11" (1/1) ... [2020-10-11 18:45:11,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:11, skipping insertion in model container [2020-10-11 18:45:11,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:11" (1/1) ... [2020-10-11 18:45:11,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:45:11,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:45:11,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:11,913 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:45:11,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:12,064 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:45:12,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12 WrapperNode [2020-10-11 18:45:12,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:12,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:12,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:45:12,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:45:12,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:12,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:45:12,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:45:12,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:45:12,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... [2020-10-11 18:45:12,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:45:12,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:45:12,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:45:12,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:45:12,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:45:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:45:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:45:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:45:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:45:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:45:12,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:45:12,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:45:12,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:45:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:45:12,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:45:12,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:45:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:45:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:45:12,319 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:45:15,582 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:45:15,582 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:45:15,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:15 BoogieIcfgContainer [2020-10-11 18:45:15,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:45:15,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:45:15,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:45:15,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:45:15,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:45:11" (1/3) ... [2020-10-11 18:45:15,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b1484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:15, skipping insertion in model container [2020-10-11 18:45:15,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:12" (2/3) ... [2020-10-11 18:45:15,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7b1484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:15, skipping insertion in model container [2020-10-11 18:45:15,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:15" (3/3) ... [2020-10-11 18:45:15,595 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.opt.i [2020-10-11 18:45:15,608 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:45:15,616 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:45:15,617 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:45:15,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,654 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,688 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,689 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,701 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,753 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:15,771 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:45:15,793 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:45:15,793 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:45:15,793 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:45:15,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:45:15,793 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:45:15,793 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:45:15,794 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:45:15,794 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:45:15,810 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:45:15,875 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-11 18:45:15,875 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:15,882 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-11 18:45:15,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:45:15,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-11 18:45:15,915 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:45:15,915 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:15,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:15,917 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:15,917 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash 546711899, now seen corresponding path program 1 times [2020-10-11 18:45:15,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:15,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874387003] [2020-10-11 18:45:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:16,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874387003] [2020-10-11 18:45:16,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:16,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:45:16,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665157206] [2020-10-11 18:45:16,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:45:16,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:16,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:45:16,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:45:16,521 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 92 [2020-10-11 18:45:16,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states. [2020-10-11 18:45:16,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:16,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 92 [2020-10-11 18:45:16,525 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:16,556 INFO L129 PetriNetUnfolder]: 0/86 cut-off events. [2020-10-11 18:45:16,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:16,557 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:45:16,558 INFO L132 encePairwiseOnDemand]: 87/92 looper letters, 0 selfloop transitions, 2 changer transitions 11/86 dead transitions. [2020-10-11 18:45:16,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 185 flow [2020-10-11 18:45:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:45:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:45:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2020-10-11 18:45:16,575 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9710144927536232 [2020-10-11 18:45:16,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2020-10-11 18:45:16,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2020-10-11 18:45:16,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:16,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2020-10-11 18:45:16,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:45:16,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:45:16,591 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:45:16,594 INFO L185 Difference]: Start difference. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states and 268 transitions. [2020-10-11 18:45:16,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 185 flow [2020-10-11 18:45:16,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:45:16,603 INFO L241 Difference]: Finished difference. Result has 95 places, 75 transitions, 160 flow [2020-10-11 18:45:16,606 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2020-10-11 18:45:16,607 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2020-10-11 18:45:16,607 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 160 flow [2020-10-11 18:45:16,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:45:16,607 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:16,608 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:16,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:45:16,608 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1437305828, now seen corresponding path program 1 times [2020-10-11 18:45:16,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:16,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167824991] [2020-10-11 18:45:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:16,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167824991] [2020-10-11 18:45:16,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:16,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:16,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646640977] [2020-10-11 18:45:16,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:16,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:16,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:16,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:17,011 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:45:17,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 160 flow. Second operand 6 states. [2020-10-11 18:45:17,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:17,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:45:17,013 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:17,157 INFO L129 PetriNetUnfolder]: 24/148 cut-off events. [2020-10-11 18:45:17,157 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:17,158 INFO L80 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 148 events. 24/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 430 event pairs, 5 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 178. Up to 31 conditions per place. [2020-10-11 18:45:17,159 INFO L132 encePairwiseOnDemand]: 85/92 looper letters, 8 selfloop transitions, 3 changer transitions 19/96 dead transitions. [2020-10-11 18:45:17,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 262 flow [2020-10-11 18:45:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 761 transitions. [2020-10-11 18:45:17,167 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9190821256038647 [2020-10-11 18:45:17,167 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 761 transitions. [2020-10-11 18:45:17,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 761 transitions. [2020-10-11 18:45:17,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:17,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 761 transitions. [2020-10-11 18:45:17,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:17,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:17,176 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:17,176 INFO L185 Difference]: Start difference. First operand has 95 places, 75 transitions, 160 flow. Second operand 9 states and 761 transitions. [2020-10-11 18:45:17,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 262 flow [2020-10-11 18:45:17,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:45:17,180 INFO L241 Difference]: Finished difference. Result has 97 places, 77 transitions, 199 flow [2020-10-11 18:45:17,180 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2020-10-11 18:45:17,181 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2020-10-11 18:45:17,181 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 199 flow [2020-10-11 18:45:17,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:17,181 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:17,182 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:17,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:45:17,182 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1974773853, now seen corresponding path program 1 times [2020-10-11 18:45:17,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:17,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146468206] [2020-10-11 18:45:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:17,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146468206] [2020-10-11 18:45:17,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:17,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:17,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411094187] [2020-10-11 18:45:17,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:17,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:17,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:17,551 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 92 [2020-10-11 18:45:17,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 199 flow. Second operand 6 states. [2020-10-11 18:45:17,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:17,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 92 [2020-10-11 18:45:17,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:17,768 INFO L129 PetriNetUnfolder]: 28/171 cut-off events. [2020-10-11 18:45:17,768 INFO L130 PetriNetUnfolder]: For 172/173 co-relation queries the response was YES. [2020-10-11 18:45:17,773 INFO L80 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 171 events. 28/171 cut-off events. For 172/173 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 535 event pairs, 9 based on Foata normal form. 6/172 useless extension candidates. Maximal degree in co-relation 337. Up to 31 conditions per place. [2020-10-11 18:45:17,774 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 6 selfloop transitions, 2 changer transitions 10/87 dead transitions. [2020-10-11 18:45:17,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 273 flow [2020-10-11 18:45:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2020-10-11 18:45:17,780 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2020-10-11 18:45:17,780 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2020-10-11 18:45:17,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2020-10-11 18:45:17,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:17,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2020-10-11 18:45:17,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:17,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:17,785 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:17,785 INFO L185 Difference]: Start difference. First operand has 97 places, 77 transitions, 199 flow. Second operand 9 states and 758 transitions. [2020-10-11 18:45:17,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 273 flow [2020-10-11 18:45:17,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 87 transitions, 256 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:45:17,791 INFO L241 Difference]: Finished difference. Result has 102 places, 77 transitions, 210 flow [2020-10-11 18:45:17,792 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=102, PETRI_TRANSITIONS=77} [2020-10-11 18:45:17,792 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 5 predicate places. [2020-10-11 18:45:17,792 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 77 transitions, 210 flow [2020-10-11 18:45:17,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:17,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:17,793 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:17,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:45:17,793 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:17,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1417914563, now seen corresponding path program 1 times [2020-10-11 18:45:17,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:17,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760574068] [2020-10-11 18:45:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:18,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760574068] [2020-10-11 18:45:18,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:18,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:45:18,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456341655] [2020-10-11 18:45:18,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:45:18,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:18,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:45:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:45:19,814 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2020-10-11 18:45:19,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 77 transitions, 210 flow. Second operand 13 states. [2020-10-11 18:45:19,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:19,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2020-10-11 18:45:19,816 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:20,986 INFO L129 PetriNetUnfolder]: 386/831 cut-off events. [2020-10-11 18:45:20,986 INFO L130 PetriNetUnfolder]: For 1135/1297 co-relation queries the response was YES. [2020-10-11 18:45:20,992 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 831 events. 386/831 cut-off events. For 1135/1297 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4354 event pairs, 39 based on Foata normal form. 34/841 useless extension candidates. Maximal degree in co-relation 2140. Up to 245 conditions per place. [2020-10-11 18:45:20,997 INFO L132 encePairwiseOnDemand]: 75/92 looper letters, 16 selfloop transitions, 18 changer transitions 51/143 dead transitions. [2020-10-11 18:45:20,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 143 transitions, 578 flow [2020-10-11 18:45:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-11 18:45:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-11 18:45:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1629 transitions. [2020-10-11 18:45:21,003 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8048418972332015 [2020-10-11 18:45:21,004 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1629 transitions. [2020-10-11 18:45:21,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1629 transitions. [2020-10-11 18:45:21,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:21,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1629 transitions. [2020-10-11 18:45:21,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-11 18:45:21,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-11 18:45:21,018 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-11 18:45:21,018 INFO L185 Difference]: Start difference. First operand has 102 places, 77 transitions, 210 flow. Second operand 22 states and 1629 transitions. [2020-10-11 18:45:21,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 143 transitions, 578 flow [2020-10-11 18:45:21,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 143 transitions, 526 flow, removed 22 selfloop flow, removed 8 redundant places. [2020-10-11 18:45:21,038 INFO L241 Difference]: Finished difference. Result has 124 places, 87 transitions, 332 flow [2020-10-11 18:45:21,039 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=332, PETRI_PLACES=124, PETRI_TRANSITIONS=87} [2020-10-11 18:45:21,039 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 27 predicate places. [2020-10-11 18:45:21,039 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 87 transitions, 332 flow [2020-10-11 18:45:21,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:45:21,039 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:21,040 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:21,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:45:21,040 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:21,041 INFO L82 PathProgramCache]: Analyzing trace with hash -154831901, now seen corresponding path program 1 times [2020-10-11 18:45:21,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:21,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987223635] [2020-10-11 18:45:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:21,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987223635] [2020-10-11 18:45:21,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:21,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:21,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911742142] [2020-10-11 18:45:21,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:21,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:21,476 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:45:21,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 87 transitions, 332 flow. Second operand 6 states. [2020-10-11 18:45:21,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:21,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:45:21,477 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:21,815 INFO L129 PetriNetUnfolder]: 182/672 cut-off events. [2020-10-11 18:45:21,815 INFO L130 PetriNetUnfolder]: For 4909/5560 co-relation queries the response was YES. [2020-10-11 18:45:21,822 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 672 events. 182/672 cut-off events. For 4909/5560 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4451 event pairs, 85 based on Foata normal form. 23/680 useless extension candidates. Maximal degree in co-relation 2824. Up to 208 conditions per place. [2020-10-11 18:45:21,828 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 14 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2020-10-11 18:45:21,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 101 transitions, 514 flow [2020-10-11 18:45:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 755 transitions. [2020-10-11 18:45:21,831 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9118357487922706 [2020-10-11 18:45:21,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 755 transitions. [2020-10-11 18:45:21,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 755 transitions. [2020-10-11 18:45:21,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:21,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 755 transitions. [2020-10-11 18:45:21,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:21,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:21,837 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:21,837 INFO L185 Difference]: Start difference. First operand has 124 places, 87 transitions, 332 flow. Second operand 9 states and 755 transitions. [2020-10-11 18:45:21,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 101 transitions, 514 flow [2020-10-11 18:45:21,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 425 flow, removed 40 selfloop flow, removed 13 redundant places. [2020-10-11 18:45:21,846 INFO L241 Difference]: Finished difference. Result has 114 places, 95 transitions, 406 flow [2020-10-11 18:45:21,846 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=406, PETRI_PLACES=114, PETRI_TRANSITIONS=95} [2020-10-11 18:45:21,846 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 17 predicate places. [2020-10-11 18:45:21,847 INFO L481 AbstractCegarLoop]: Abstraction has has 114 places, 95 transitions, 406 flow [2020-10-11 18:45:21,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:21,847 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:21,847 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:21,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:45:21,847 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash 299000511, now seen corresponding path program 1 times [2020-10-11 18:45:21,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:21,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085058318] [2020-10-11 18:45:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:22,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085058318] [2020-10-11 18:45:22,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:22,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:45:22,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119206102] [2020-10-11 18:45:22,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:45:22,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:45:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:45:23,294 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2020-10-11 18:45:23,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 95 transitions, 406 flow. Second operand 12 states. [2020-10-11 18:45:23,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:23,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2020-10-11 18:45:23,296 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:24,302 INFO L129 PetriNetUnfolder]: 730/1706 cut-off events. [2020-10-11 18:45:24,302 INFO L130 PetriNetUnfolder]: For 7764/7951 co-relation queries the response was YES. [2020-10-11 18:45:24,313 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6895 conditions, 1706 events. 730/1706 cut-off events. For 7764/7951 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11849 event pairs, 74 based on Foata normal form. 28/1676 useless extension candidates. Maximal degree in co-relation 6830. Up to 713 conditions per place. [2020-10-11 18:45:24,321 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 32 selfloop transitions, 14 changer transitions 42/146 dead transitions. [2020-10-11 18:45:24,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 146 transitions, 1007 flow [2020-10-11 18:45:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:45:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:45:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 972 transitions. [2020-10-11 18:45:24,326 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8127090301003345 [2020-10-11 18:45:24,326 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 972 transitions. [2020-10-11 18:45:24,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 972 transitions. [2020-10-11 18:45:24,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:24,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 972 transitions. [2020-10-11 18:45:24,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:45:24,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:45:24,332 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:45:24,332 INFO L185 Difference]: Start difference. First operand has 114 places, 95 transitions, 406 flow. Second operand 13 states and 972 transitions. [2020-10-11 18:45:24,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 146 transitions, 1007 flow [2020-10-11 18:45:24,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 146 transitions, 952 flow, removed 26 selfloop flow, removed 1 redundant places. [2020-10-11 18:45:24,352 INFO L241 Difference]: Finished difference. Result has 133 places, 95 transitions, 437 flow [2020-10-11 18:45:24,352 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=437, PETRI_PLACES=133, PETRI_TRANSITIONS=95} [2020-10-11 18:45:24,353 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 36 predicate places. [2020-10-11 18:45:24,353 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 95 transitions, 437 flow [2020-10-11 18:45:24,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:45:24,353 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:24,353 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:24,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:45:24,354 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash 94553279, now seen corresponding path program 2 times [2020-10-11 18:45:24,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:24,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427033966] [2020-10-11 18:45:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:24,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427033966] [2020-10-11 18:45:24,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:24,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:45:24,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197498182] [2020-10-11 18:45:24,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:45:24,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:45:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:45:26,452 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2020-10-11 18:45:26,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 95 transitions, 437 flow. Second operand 11 states. [2020-10-11 18:45:26,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:26,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2020-10-11 18:45:26,454 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:27,557 INFO L129 PetriNetUnfolder]: 504/1470 cut-off events. [2020-10-11 18:45:27,558 INFO L130 PetriNetUnfolder]: For 13194/13713 co-relation queries the response was YES. [2020-10-11 18:45:27,569 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7275 conditions, 1470 events. 504/1470 cut-off events. For 13194/13713 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10861 event pairs, 95 based on Foata normal form. 105/1536 useless extension candidates. Maximal degree in co-relation 7199. Up to 483 conditions per place. [2020-10-11 18:45:27,581 INFO L132 encePairwiseOnDemand]: 78/92 looper letters, 35 selfloop transitions, 25 changer transitions 25/145 dead transitions. [2020-10-11 18:45:27,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 145 transitions, 1247 flow [2020-10-11 18:45:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:45:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:45:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1063 transitions. [2020-10-11 18:45:27,585 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8253105590062112 [2020-10-11 18:45:27,586 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1063 transitions. [2020-10-11 18:45:27,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1063 transitions. [2020-10-11 18:45:27,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:27,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1063 transitions. [2020-10-11 18:45:27,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:45:27,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:45:27,592 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:45:27,592 INFO L185 Difference]: Start difference. First operand has 133 places, 95 transitions, 437 flow. Second operand 14 states and 1063 transitions. [2020-10-11 18:45:27,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 145 transitions, 1247 flow [2020-10-11 18:45:27,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 145 transitions, 1158 flow, removed 38 selfloop flow, removed 12 redundant places. [2020-10-11 18:45:27,610 INFO L241 Difference]: Finished difference. Result has 131 places, 107 transitions, 667 flow [2020-10-11 18:45:27,611 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=667, PETRI_PLACES=131, PETRI_TRANSITIONS=107} [2020-10-11 18:45:27,611 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 34 predicate places. [2020-10-11 18:45:27,611 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 107 transitions, 667 flow [2020-10-11 18:45:27,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:45:27,611 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:27,611 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:27,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:45:27,612 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2061189151, now seen corresponding path program 1 times [2020-10-11 18:45:27,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:27,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661771002] [2020-10-11 18:45:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:27,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661771002] [2020-10-11 18:45:27,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:27,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:45:27,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863953760] [2020-10-11 18:45:27,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:45:27,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:45:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:45:29,613 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:45:29,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 107 transitions, 667 flow. Second operand 13 states. [2020-10-11 18:45:29,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:29,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:45:29,614 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:30,742 INFO L129 PetriNetUnfolder]: 724/1961 cut-off events. [2020-10-11 18:45:30,742 INFO L130 PetriNetUnfolder]: For 30337/31306 co-relation queries the response was YES. [2020-10-11 18:45:30,754 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11723 conditions, 1961 events. 724/1961 cut-off events. For 30337/31306 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15712 event pairs, 54 based on Foata normal form. 167/2062 useless extension candidates. Maximal degree in co-relation 11644. Up to 798 conditions per place. [2020-10-11 18:45:30,770 INFO L132 encePairwiseOnDemand]: 78/92 looper letters, 66 selfloop transitions, 75 changer transitions 30/227 dead transitions. [2020-10-11 18:45:30,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 227 transitions, 2625 flow [2020-10-11 18:45:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 18:45:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 18:45:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1255 transitions. [2020-10-11 18:45:30,776 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8024296675191815 [2020-10-11 18:45:30,776 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1255 transitions. [2020-10-11 18:45:30,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1255 transitions. [2020-10-11 18:45:30,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:30,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1255 transitions. [2020-10-11 18:45:30,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 18:45:30,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 18:45:30,783 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 18:45:30,783 INFO L185 Difference]: Start difference. First operand has 131 places, 107 transitions, 667 flow. Second operand 17 states and 1255 transitions. [2020-10-11 18:45:30,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 227 transitions, 2625 flow [2020-10-11 18:45:30,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 227 transitions, 2450 flow, removed 79 selfloop flow, removed 7 redundant places. [2020-10-11 18:45:30,823 INFO L241 Difference]: Finished difference. Result has 144 places, 175 transitions, 1741 flow [2020-10-11 18:45:30,824 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1741, PETRI_PLACES=144, PETRI_TRANSITIONS=175} [2020-10-11 18:45:30,824 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 47 predicate places. [2020-10-11 18:45:30,824 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 175 transitions, 1741 flow [2020-10-11 18:45:30,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:45:30,825 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:30,825 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:30,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:45:30,825 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2046931311, now seen corresponding path program 1 times [2020-10-11 18:45:30,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:30,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900313579] [2020-10-11 18:45:30,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:31,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900313579] [2020-10-11 18:45:31,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:31,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 18:45:31,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749762371] [2020-10-11 18:45:31,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 18:45:31,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:31,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 18:45:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-10-11 18:45:34,733 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2020-10-11 18:45:34,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 175 transitions, 1741 flow. Second operand 16 states. [2020-10-11 18:45:34,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:34,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2020-10-11 18:45:34,734 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:35,510 INFO L129 PetriNetUnfolder]: 629/1847 cut-off events. [2020-10-11 18:45:35,510 INFO L130 PetriNetUnfolder]: For 28300/31568 co-relation queries the response was YES. [2020-10-11 18:45:35,522 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11440 conditions, 1847 events. 629/1847 cut-off events. For 28300/31568 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15042 event pairs, 61 based on Foata normal form. 130/1907 useless extension candidates. Maximal degree in co-relation 11354. Up to 647 conditions per place. [2020-10-11 18:45:35,532 INFO L132 encePairwiseOnDemand]: 79/92 looper letters, 64 selfloop transitions, 69 changer transitions 51/241 dead transitions. [2020-10-11 18:45:35,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 241 transitions, 3367 flow [2020-10-11 18:45:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:45:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:45:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1097 transitions. [2020-10-11 18:45:35,537 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7949275362318841 [2020-10-11 18:45:35,537 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1097 transitions. [2020-10-11 18:45:35,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1097 transitions. [2020-10-11 18:45:35,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:35,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1097 transitions. [2020-10-11 18:45:35,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:45:35,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:45:35,544 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:45:35,544 INFO L185 Difference]: Start difference. First operand has 144 places, 175 transitions, 1741 flow. Second operand 15 states and 1097 transitions. [2020-10-11 18:45:35,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 241 transitions, 3367 flow [2020-10-11 18:45:35,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 241 transitions, 2790 flow, removed 285 selfloop flow, removed 10 redundant places. [2020-10-11 18:45:35,628 INFO L241 Difference]: Finished difference. Result has 151 places, 176 transitions, 1794 flow [2020-10-11 18:45:35,628 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1794, PETRI_PLACES=151, PETRI_TRANSITIONS=176} [2020-10-11 18:45:35,629 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 54 predicate places. [2020-10-11 18:45:35,629 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 176 transitions, 1794 flow [2020-10-11 18:45:35,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 18:45:35,629 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:35,629 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:35,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:45:35,630 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:35,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2004756459, now seen corresponding path program 2 times [2020-10-11 18:45:35,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:35,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884528792] [2020-10-11 18:45:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:36,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884528792] [2020-10-11 18:45:36,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:36,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 18:45:36,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487837657] [2020-10-11 18:45:36,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 18:45:36,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 18:45:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-10-11 18:45:39,793 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2020-10-11 18:45:39,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 176 transitions, 1794 flow. Second operand 16 states. [2020-10-11 18:45:39,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:39,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2020-10-11 18:45:39,795 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:40,697 INFO L129 PetriNetUnfolder]: 540/1759 cut-off events. [2020-10-11 18:45:40,697 INFO L130 PetriNetUnfolder]: For 18477/20085 co-relation queries the response was YES. [2020-10-11 18:45:40,712 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9762 conditions, 1759 events. 540/1759 cut-off events. For 18477/20085 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 15374 event pairs, 47 based on Foata normal form. 172/1874 useless extension candidates. Maximal degree in co-relation 9671. Up to 736 conditions per place. [2020-10-11 18:45:40,723 INFO L132 encePairwiseOnDemand]: 75/92 looper letters, 101 selfloop transitions, 37 changer transitions 59/252 dead transitions. [2020-10-11 18:45:40,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 252 transitions, 3255 flow [2020-10-11 18:45:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:45:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:45:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1281 transitions. [2020-10-11 18:45:40,726 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7735507246376812 [2020-10-11 18:45:40,726 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1281 transitions. [2020-10-11 18:45:40,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1281 transitions. [2020-10-11 18:45:40,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:40,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1281 transitions. [2020-10-11 18:45:40,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:45:40,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:45:40,732 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:45:40,732 INFO L185 Difference]: Start difference. First operand has 151 places, 176 transitions, 1794 flow. Second operand 18 states and 1281 transitions. [2020-10-11 18:45:40,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 252 transitions, 3255 flow [2020-10-11 18:45:40,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 252 transitions, 3008 flow, removed 115 selfloop flow, removed 15 redundant places. [2020-10-11 18:45:40,787 INFO L241 Difference]: Finished difference. Result has 157 places, 185 transitions, 1943 flow [2020-10-11 18:45:40,787 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1943, PETRI_PLACES=157, PETRI_TRANSITIONS=185} [2020-10-11 18:45:40,787 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 60 predicate places. [2020-10-11 18:45:40,787 INFO L481 AbstractCegarLoop]: Abstraction has has 157 places, 185 transitions, 1943 flow [2020-10-11 18:45:40,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 18:45:40,788 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:40,788 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:40,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:45:40,788 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 116824261, now seen corresponding path program 3 times [2020-10-11 18:45:40,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:40,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033809812] [2020-10-11 18:45:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:41,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033809812] [2020-10-11 18:45:41,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:41,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 18:45:41,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568424286] [2020-10-11 18:45:41,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 18:45:41,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:41,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 18:45:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-10-11 18:45:46,110 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2020-10-11 18:45:46,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 185 transitions, 1943 flow. Second operand 17 states. [2020-10-11 18:45:46,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:46,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2020-10-11 18:45:46,112 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:47,394 INFO L129 PetriNetUnfolder]: 493/1578 cut-off events. [2020-10-11 18:45:47,394 INFO L130 PetriNetUnfolder]: For 17899/19599 co-relation queries the response was YES. [2020-10-11 18:45:47,402 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9189 conditions, 1578 events. 493/1578 cut-off events. For 17899/19599 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13269 event pairs, 50 based on Foata normal form. 159/1673 useless extension candidates. Maximal degree in co-relation 9095. Up to 530 conditions per place. [2020-10-11 18:45:47,411 INFO L132 encePairwiseOnDemand]: 78/92 looper letters, 68 selfloop transitions, 67 changer transitions 75/264 dead transitions. [2020-10-11 18:45:47,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 264 transitions, 3548 flow [2020-10-11 18:45:47,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-11 18:45:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-11 18:45:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1396 transitions. [2020-10-11 18:45:47,415 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.758695652173913 [2020-10-11 18:45:47,415 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1396 transitions. [2020-10-11 18:45:47,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1396 transitions. [2020-10-11 18:45:47,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:47,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1396 transitions. [2020-10-11 18:45:47,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 21 states. [2020-10-11 18:45:47,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 21 states. [2020-10-11 18:45:47,421 INFO L81 ComplementDD]: Finished complementDD. Result 21 states. [2020-10-11 18:45:47,421 INFO L185 Difference]: Start difference. First operand has 157 places, 185 transitions, 1943 flow. Second operand 20 states and 1396 transitions. [2020-10-11 18:45:47,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 264 transitions, 3548 flow [2020-10-11 18:45:47,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 264 transitions, 3381 flow, removed 80 selfloop flow, removed 11 redundant places. [2020-10-11 18:45:47,463 INFO L241 Difference]: Finished difference. Result has 166 places, 177 transitions, 1959 flow [2020-10-11 18:45:47,463 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1959, PETRI_PLACES=166, PETRI_TRANSITIONS=177} [2020-10-11 18:45:47,463 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 69 predicate places. [2020-10-11 18:45:47,464 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 177 transitions, 1959 flow [2020-10-11 18:45:47,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 18:45:47,464 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:47,464 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:47,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:45:47,464 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:47,465 INFO L82 PathProgramCache]: Analyzing trace with hash 438249895, now seen corresponding path program 4 times [2020-10-11 18:45:47,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:47,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853866537] [2020-10-11 18:45:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:47,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853866537] [2020-10-11 18:45:47,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:47,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:45:47,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521121465] [2020-10-11 18:45:47,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:45:47,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:47,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:45:47,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:45:49,489 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2020-10-11 18:45:49,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 177 transitions, 1959 flow. Second operand 11 states. [2020-10-11 18:45:49,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:49,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2020-10-11 18:45:49,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:50,057 INFO L129 PetriNetUnfolder]: 428/1446 cut-off events. [2020-10-11 18:45:50,058 INFO L130 PetriNetUnfolder]: For 17207/18792 co-relation queries the response was YES. [2020-10-11 18:45:50,065 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8378 conditions, 1446 events. 428/1446 cut-off events. For 17207/18792 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12182 event pairs, 35 based on Foata normal form. 98/1494 useless extension candidates. Maximal degree in co-relation 8283. Up to 563 conditions per place. [2020-10-11 18:45:50,072 INFO L132 encePairwiseOnDemand]: 81/92 looper letters, 86 selfloop transitions, 38 changer transitions 26/208 dead transitions. [2020-10-11 18:45:50,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 208 transitions, 2721 flow [2020-10-11 18:45:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:45:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:45:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 829 transitions. [2020-10-11 18:45:50,075 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8191699604743083 [2020-10-11 18:45:50,075 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 829 transitions. [2020-10-11 18:45:50,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 829 transitions. [2020-10-11 18:45:50,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:50,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 829 transitions. [2020-10-11 18:45:50,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:45:50,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:45:50,079 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:45:50,079 INFO L185 Difference]: Start difference. First operand has 166 places, 177 transitions, 1959 flow. Second operand 11 states and 829 transitions. [2020-10-11 18:45:50,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 208 transitions, 2721 flow [2020-10-11 18:45:50,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 208 transitions, 2379 flow, removed 68 selfloop flow, removed 21 redundant places. [2020-10-11 18:45:50,120 INFO L241 Difference]: Finished difference. Result has 153 places, 176 transitions, 1808 flow [2020-10-11 18:45:50,120 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1808, PETRI_PLACES=153, PETRI_TRANSITIONS=176} [2020-10-11 18:45:50,121 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 56 predicate places. [2020-10-11 18:45:50,121 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 176 transitions, 1808 flow [2020-10-11 18:45:50,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:45:50,121 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:50,121 INFO L255 CegarLoopForPetriNet]: trace 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, 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] [2020-10-11 18:45:50,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:45:50,121 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -938030101, now seen corresponding path program 5 times [2020-10-11 18:45:50,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:50,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808658350] [2020-10-11 18:45:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:50,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808658350] [2020-10-11 18:45:50,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:50,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:45:50,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990120576] [2020-10-11 18:45:50,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:45:50,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:45:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:45:55,158 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:45:55,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 176 transitions, 1808 flow. Second operand 15 states. [2020-10-11 18:45:55,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:55,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:45:55,159 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:56,423 INFO L129 PetriNetUnfolder]: 387/1479 cut-off events. [2020-10-11 18:45:56,423 INFO L130 PetriNetUnfolder]: For 12467/14109 co-relation queries the response was YES. [2020-10-11 18:45:56,432 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7587 conditions, 1479 events. 387/1479 cut-off events. For 12467/14109 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13164 event pairs, 44 based on Foata normal form. 106/1541 useless extension candidates. Maximal degree in co-relation 7499. Up to 390 conditions per place. [2020-10-11 18:45:56,437 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 105 selfloop transitions, 27 changer transitions 51/239 dead transitions. [2020-10-11 18:45:56,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 239 transitions, 2963 flow [2020-10-11 18:45:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 18:45:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 18:45:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1231 transitions. [2020-10-11 18:45:56,440 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7870843989769821 [2020-10-11 18:45:56,440 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1231 transitions. [2020-10-11 18:45:56,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1231 transitions. [2020-10-11 18:45:56,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:56,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1231 transitions. [2020-10-11 18:45:56,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 18:45:56,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 18:45:56,445 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 18:45:56,445 INFO L185 Difference]: Start difference. First operand has 153 places, 176 transitions, 1808 flow. Second operand 17 states and 1231 transitions. [2020-10-11 18:45:56,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 239 transitions, 2963 flow [2020-10-11 18:45:56,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 239 transitions, 2874 flow, removed 39 selfloop flow, removed 8 redundant places. [2020-10-11 18:45:56,489 INFO L241 Difference]: Finished difference. Result has 165 places, 162 transitions, 1659 flow [2020-10-11 18:45:56,490 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1659, PETRI_PLACES=165, PETRI_TRANSITIONS=162} [2020-10-11 18:45:56,490 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 68 predicate places. [2020-10-11 18:45:56,490 INFO L481 AbstractCegarLoop]: Abstraction has has 165 places, 162 transitions, 1659 flow [2020-10-11 18:45:56,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:45:56,490 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:56,490 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:56,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:45:56,491 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1305451176, now seen corresponding path program 1 times [2020-10-11 18:45:56,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:56,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486877252] [2020-10-11 18:45:56,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:56,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486877252] [2020-10-11 18:45:56,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:56,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:56,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406003115] [2020-10-11 18:45:56,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:56,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:56,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:56,770 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:45:56,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 162 transitions, 1659 flow. Second operand 6 states. [2020-10-11 18:45:56,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:56,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:45:56,771 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:57,491 INFO L129 PetriNetUnfolder]: 1448/3605 cut-off events. [2020-10-11 18:45:57,491 INFO L130 PetriNetUnfolder]: For 10843/11073 co-relation queries the response was YES. [2020-10-11 18:45:57,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9783 conditions, 3605 events. 1448/3605 cut-off events. For 10843/11073 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 35287 event pairs, 96 based on Foata normal form. 118/3453 useless extension candidates. Maximal degree in co-relation 9695. Up to 1145 conditions per place. [2020-10-11 18:45:57,523 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 17 selfloop transitions, 16 changer transitions 2/157 dead transitions. [2020-10-11 18:45:57,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 157 transitions, 1337 flow [2020-10-11 18:45:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2020-10-11 18:45:57,525 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2020-10-11 18:45:57,526 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2020-10-11 18:45:57,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2020-10-11 18:45:57,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:57,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2020-10-11 18:45:57,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:57,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:57,528 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:57,529 INFO L185 Difference]: Start difference. First operand has 165 places, 162 transitions, 1659 flow. Second operand 9 states and 748 transitions. [2020-10-11 18:45:57,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 157 transitions, 1337 flow [2020-10-11 18:45:57,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 157 transitions, 1241 flow, removed 27 selfloop flow, removed 19 redundant places. [2020-10-11 18:45:57,561 INFO L241 Difference]: Finished difference. Result has 151 places, 147 transitions, 1232 flow [2020-10-11 18:45:57,561 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1232, PETRI_PLACES=151, PETRI_TRANSITIONS=147} [2020-10-11 18:45:57,562 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 54 predicate places. [2020-10-11 18:45:57,562 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 147 transitions, 1232 flow [2020-10-11 18:45:57,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:57,562 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:57,562 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:57,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:45:57,562 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:57,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash 278298021, now seen corresponding path program 1 times [2020-10-11 18:45:57,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:57,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976348133] [2020-10-11 18:45:57,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:57,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976348133] [2020-10-11 18:45:57,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:57,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:45:57,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970186338] [2020-10-11 18:45:57,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:45:57,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:57,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:45:57,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:45:57,995 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:45:57,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 147 transitions, 1232 flow. Second operand 7 states. [2020-10-11 18:45:57,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:57,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:45:57,996 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:58,629 INFO L129 PetriNetUnfolder]: 1154/3778 cut-off events. [2020-10-11 18:45:58,629 INFO L130 PetriNetUnfolder]: For 8671/11349 co-relation queries the response was YES. [2020-10-11 18:45:58,651 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11711 conditions, 3778 events. 1154/3778 cut-off events. For 8671/11349 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 41958 event pairs, 20 based on Foata normal form. 707/4280 useless extension candidates. Maximal degree in co-relation 11633. Up to 929 conditions per place. [2020-10-11 18:45:58,660 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 15 selfloop transitions, 29 changer transitions 10/161 dead transitions. [2020-10-11 18:45:58,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 161 transitions, 1313 flow [2020-10-11 18:45:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:45:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:45:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions. [2020-10-11 18:45:58,663 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9039855072463768 [2020-10-11 18:45:58,663 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 998 transitions. [2020-10-11 18:45:58,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions. [2020-10-11 18:45:58,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:58,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions. [2020-10-11 18:45:58,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:45:58,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:45:58,666 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:45:58,666 INFO L185 Difference]: Start difference. First operand has 151 places, 147 transitions, 1232 flow. Second operand 12 states and 998 transitions. [2020-10-11 18:45:58,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 161 transitions, 1313 flow [2020-10-11 18:45:58,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 161 transitions, 1214 flow, removed 8 selfloop flow, removed 11 redundant places. [2020-10-11 18:45:58,697 INFO L241 Difference]: Finished difference. Result has 156 places, 148 transitions, 1162 flow [2020-10-11 18:45:58,697 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1162, PETRI_PLACES=156, PETRI_TRANSITIONS=148} [2020-10-11 18:45:58,698 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 59 predicate places. [2020-10-11 18:45:58,698 INFO L481 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 1162 flow [2020-10-11 18:45:58,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:45:58,698 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:58,698 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:45:58,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:45:58,698 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash 685675332, now seen corresponding path program 1 times [2020-10-11 18:45:58,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:58,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293195291] [2020-10-11 18:45:58,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:45:58,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293195291] [2020-10-11 18:45:58,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:58,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:45:58,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183490485] [2020-10-11 18:45:58,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:45:58,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:45:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:45:59,881 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2020-10-11 18:45:59,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 1162 flow. Second operand 9 states. [2020-10-11 18:45:59,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:59,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2020-10-11 18:45:59,882 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:00,654 INFO L129 PetriNetUnfolder]: 1061/4263 cut-off events. [2020-10-11 18:46:00,654 INFO L130 PetriNetUnfolder]: For 13924/14921 co-relation queries the response was YES. [2020-10-11 18:46:00,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14616 conditions, 4263 events. 1061/4263 cut-off events. For 13924/14921 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 52064 event pairs, 21 based on Foata normal form. 54/4145 useless extension candidates. Maximal degree in co-relation 14533. Up to 960 conditions per place. [2020-10-11 18:46:00,688 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 46 selfloop transitions, 23 changer transitions 15/172 dead transitions. [2020-10-11 18:46:00,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 172 transitions, 1575 flow [2020-10-11 18:46:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:46:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:46:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 747 transitions. [2020-10-11 18:46:00,691 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8119565217391305 [2020-10-11 18:46:00,692 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 747 transitions. [2020-10-11 18:46:00,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 747 transitions. [2020-10-11 18:46:00,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:00,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 747 transitions. [2020-10-11 18:46:00,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:46:00,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:46:00,694 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:46:00,694 INFO L185 Difference]: Start difference. First operand has 156 places, 148 transitions, 1162 flow. Second operand 10 states and 747 transitions. [2020-10-11 18:46:00,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 172 transitions, 1575 flow [2020-10-11 18:46:00,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 172 transitions, 1493 flow, removed 28 selfloop flow, removed 6 redundant places. [2020-10-11 18:46:00,959 INFO L241 Difference]: Finished difference. Result has 165 places, 156 transitions, 1260 flow [2020-10-11 18:46:00,960 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1260, PETRI_PLACES=165, PETRI_TRANSITIONS=156} [2020-10-11 18:46:00,960 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 68 predicate places. [2020-10-11 18:46:00,960 INFO L481 AbstractCegarLoop]: Abstraction has has 165 places, 156 transitions, 1260 flow [2020-10-11 18:46:00,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:46:00,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:00,960 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:00,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:46:00,961 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2106388416, now seen corresponding path program 2 times [2020-10-11 18:46:00,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:00,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108948520] [2020-10-11 18:46:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:01,474 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-10-11 18:46:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:01,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108948520] [2020-10-11 18:46:01,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:01,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 18:46:01,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923949177] [2020-10-11 18:46:01,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 18:46:01,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:01,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 18:46:01,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-10-11 18:46:06,607 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 92 [2020-10-11 18:46:06,608 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 156 transitions, 1260 flow. Second operand 17 states. [2020-10-11 18:46:06,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:06,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 92 [2020-10-11 18:46:06,608 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:08,162 INFO L129 PetriNetUnfolder]: 1159/4749 cut-off events. [2020-10-11 18:46:08,162 INFO L130 PetriNetUnfolder]: For 9867/10704 co-relation queries the response was YES. [2020-10-11 18:46:08,193 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13615 conditions, 4749 events. 1159/4749 cut-off events. For 9867/10704 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 59335 event pairs, 9 based on Foata normal form. 74/4644 useless extension candidates. Maximal degree in co-relation 13524. Up to 808 conditions per place. [2020-10-11 18:46:08,198 INFO L132 encePairwiseOnDemand]: 75/92 looper letters, 46 selfloop transitions, 35 changer transitions 13/176 dead transitions. [2020-10-11 18:46:08,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 176 transitions, 1631 flow [2020-10-11 18:46:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-11 18:46:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-11 18:46:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1358 transitions. [2020-10-11 18:46:08,200 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7380434782608696 [2020-10-11 18:46:08,201 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1358 transitions. [2020-10-11 18:46:08,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1358 transitions. [2020-10-11 18:46:08,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:08,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1358 transitions. [2020-10-11 18:46:08,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 21 states. [2020-10-11 18:46:08,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 21 states. [2020-10-11 18:46:08,205 INFO L81 ComplementDD]: Finished complementDD. Result 21 states. [2020-10-11 18:46:08,205 INFO L185 Difference]: Start difference. First operand has 165 places, 156 transitions, 1260 flow. Second operand 20 states and 1358 transitions. [2020-10-11 18:46:08,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 176 transitions, 1631 flow [2020-10-11 18:46:08,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 176 transitions, 1542 flow, removed 37 selfloop flow, removed 5 redundant places. [2020-10-11 18:46:08,313 INFO L241 Difference]: Finished difference. Result has 183 places, 156 transitions, 1308 flow [2020-10-11 18:46:08,313 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1308, PETRI_PLACES=183, PETRI_TRANSITIONS=156} [2020-10-11 18:46:08,314 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 86 predicate places. [2020-10-11 18:46:08,314 INFO L481 AbstractCegarLoop]: Abstraction has has 183 places, 156 transitions, 1308 flow [2020-10-11 18:46:08,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 18:46:08,314 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:08,314 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:08,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:46:08,314 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:08,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1728200100, now seen corresponding path program 3 times [2020-10-11 18:46:08,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:08,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505561941] [2020-10-11 18:46:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:08,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505561941] [2020-10-11 18:46:08,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:08,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:46:08,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82334097] [2020-10-11 18:46:08,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:46:08,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:46:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:46:09,351 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2020-10-11 18:46:09,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 156 transitions, 1308 flow. Second operand 10 states. [2020-10-11 18:46:09,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:09,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2020-10-11 18:46:09,352 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:10,330 INFO L129 PetriNetUnfolder]: 943/4408 cut-off events. [2020-10-11 18:46:10,330 INFO L130 PetriNetUnfolder]: For 11503/12126 co-relation queries the response was YES. [2020-10-11 18:46:10,368 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13080 conditions, 4408 events. 943/4408 cut-off events. For 11503/12126 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 56736 event pairs, 13 based on Foata normal form. 62/4315 useless extension candidates. Maximal degree in co-relation 12985. Up to 801 conditions per place. [2020-10-11 18:46:10,374 INFO L132 encePairwiseOnDemand]: 82/92 looper letters, 34 selfloop transitions, 18 changer transitions 33/176 dead transitions. [2020-10-11 18:46:10,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 176 transitions, 1852 flow [2020-10-11 18:46:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:46:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:46:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 915 transitions. [2020-10-11 18:46:10,380 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8288043478260869 [2020-10-11 18:46:10,380 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 915 transitions. [2020-10-11 18:46:10,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 915 transitions. [2020-10-11 18:46:10,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:10,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 915 transitions. [2020-10-11 18:46:10,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:46:10,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:46:10,382 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:46:10,382 INFO L185 Difference]: Start difference. First operand has 183 places, 156 transitions, 1308 flow. Second operand 12 states and 915 transitions. [2020-10-11 18:46:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 176 transitions, 1852 flow [2020-10-11 18:46:10,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 176 transitions, 1722 flow, removed 47 selfloop flow, removed 16 redundant places. [2020-10-11 18:46:10,473 INFO L241 Difference]: Finished difference. Result has 179 places, 141 transitions, 1096 flow [2020-10-11 18:46:10,473 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1096, PETRI_PLACES=179, PETRI_TRANSITIONS=141} [2020-10-11 18:46:10,473 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 82 predicate places. [2020-10-11 18:46:10,473 INFO L481 AbstractCegarLoop]: Abstraction has has 179 places, 141 transitions, 1096 flow [2020-10-11 18:46:10,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:46:10,474 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:10,474 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:10,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:46:10,474 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash 864066228, now seen corresponding path program 1 times [2020-10-11 18:46:10,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:10,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044785602] [2020-10-11 18:46:10,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:10,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044785602] [2020-10-11 18:46:10,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:10,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:46:10,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412714758] [2020-10-11 18:46:10,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:46:10,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:46:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:46:10,840 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:46:10,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 141 transitions, 1096 flow. Second operand 8 states. [2020-10-11 18:46:10,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:10,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:46:10,841 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:11,628 INFO L129 PetriNetUnfolder]: 799/3480 cut-off events. [2020-10-11 18:46:11,629 INFO L130 PetriNetUnfolder]: For 7756/11280 co-relation queries the response was YES. [2020-10-11 18:46:11,663 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11089 conditions, 3480 events. 799/3480 cut-off events. For 7756/11280 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 43171 event pairs, 2 based on Foata normal form. 763/4068 useless extension candidates. Maximal degree in co-relation 11037. Up to 632 conditions per place. [2020-10-11 18:46:11,666 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 10 selfloop transitions, 30 changer transitions 37/157 dead transitions. [2020-10-11 18:46:11,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 157 transitions, 1291 flow [2020-10-11 18:46:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:46:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:46:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1232 transitions. [2020-10-11 18:46:11,668 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2020-10-11 18:46:11,668 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1232 transitions. [2020-10-11 18:46:11,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1232 transitions. [2020-10-11 18:46:11,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:11,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1232 transitions. [2020-10-11 18:46:11,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:46:11,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:46:11,671 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:46:11,672 INFO L185 Difference]: Start difference. First operand has 179 places, 141 transitions, 1096 flow. Second operand 15 states and 1232 transitions. [2020-10-11 18:46:11,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 157 transitions, 1291 flow [2020-10-11 18:46:11,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 157 transitions, 1134 flow, removed 34 selfloop flow, removed 17 redundant places. [2020-10-11 18:46:11,730 INFO L241 Difference]: Finished difference. Result has 176 places, 117 transitions, 767 flow [2020-10-11 18:46:11,730 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=767, PETRI_PLACES=176, PETRI_TRANSITIONS=117} [2020-10-11 18:46:11,730 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 79 predicate places. [2020-10-11 18:46:11,730 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 117 transitions, 767 flow [2020-10-11 18:46:11,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:46:11,731 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:11,731 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:11,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:46:11,731 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:11,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash -52511595, now seen corresponding path program 1 times [2020-10-11 18:46:11,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:11,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622614891] [2020-10-11 18:46:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:46:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:46:12,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622614891] [2020-10-11 18:46:12,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:46:12,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 18:46:12,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389566683] [2020-10-11 18:46:12,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 18:46:12,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:46:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 18:46:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-11 18:46:19,490 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2020-10-11 18:46:19,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 117 transitions, 767 flow. Second operand 16 states. [2020-10-11 18:46:19,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:46:19,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2020-10-11 18:46:19,492 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:46:19,970 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-10-11 18:46:20,129 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-10-11 18:46:20,138 INFO L129 PetriNetUnfolder]: 113/737 cut-off events. [2020-10-11 18:46:20,138 INFO L130 PetriNetUnfolder]: For 1963/2069 co-relation queries the response was YES. [2020-10-11 18:46:20,142 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 737 events. 113/737 cut-off events. For 1963/2069 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6610 event pairs, 1 based on Foata normal form. 1/707 useless extension candidates. Maximal degree in co-relation 2323. Up to 119 conditions per place. [2020-10-11 18:46:20,143 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 17 selfloop transitions, 8 changer transitions 15/121 dead transitions. [2020-10-11 18:46:20,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 121 transitions, 863 flow [2020-10-11 18:46:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:46:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:46:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 845 transitions. [2020-10-11 18:46:20,145 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7653985507246377 [2020-10-11 18:46:20,145 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 845 transitions. [2020-10-11 18:46:20,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 845 transitions. [2020-10-11 18:46:20,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:46:20,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 845 transitions. [2020-10-11 18:46:20,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:46:20,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:46:20,149 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:46:20,149 INFO L185 Difference]: Start difference. First operand has 176 places, 117 transitions, 767 flow. Second operand 12 states and 845 transitions. [2020-10-11 18:46:20,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 121 transitions, 863 flow [2020-10-11 18:46:20,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 121 transitions, 685 flow, removed 35 selfloop flow, removed 33 redundant places. [2020-10-11 18:46:20,164 INFO L241 Difference]: Finished difference. Result has 153 places, 106 transitions, 517 flow [2020-10-11 18:46:20,165 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=517, PETRI_PLACES=153, PETRI_TRANSITIONS=106} [2020-10-11 18:46:20,165 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 56 predicate places. [2020-10-11 18:46:20,165 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 106 transitions, 517 flow [2020-10-11 18:46:20,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 18:46:20,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:46:20,165 INFO L255 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:46:20,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 18:46:20,166 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:46:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:46:20,166 INFO L82 PathProgramCache]: Analyzing trace with hash -709464873, now seen corresponding path program 2 times [2020-10-11 18:46:20,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:46:20,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070010220] [2020-10-11 18:46:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:46:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:46:20,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:46:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:46:20,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:46:20,362 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:46:20,362 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:46:20,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 18:46:20,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,420 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,420 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,421 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,421 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,421 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,421 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,421 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,421 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,421 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,422 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,422 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,422 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,422 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,422 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,422 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,422 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,423 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,423 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,423 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,423 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,423 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,423 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,423 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,423 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,424 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,424 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,424 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,424 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,425 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,425 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,425 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,425 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,425 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,425 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,427 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,427 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,427 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,427 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,430 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,430 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,431 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,431 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,432 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,432 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,433 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,433 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,434 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,435 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:46:20,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:46:20,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:46:20 BasicIcfg [2020-10-11 18:46:20,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:46:20,619 INFO L168 Benchmark]: Toolchain (without parser) took 69456.79 ms. Allocated memory was 248.5 MB in the beginning and 1.2 GB in the end (delta: 976.7 MB). Free memory was 203.6 MB in the beginning and 499.6 MB in the end (delta: -296.0 MB). Peak memory consumption was 680.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:20,620 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:46:20,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 902.25 ms. Allocated memory was 248.5 MB in the beginning and 305.7 MB in the end (delta: 57.1 MB). Free memory was 203.6 MB in the beginning and 253.4 MB in the end (delta: -49.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:20,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.84 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 250.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:20,625 INFO L168 Benchmark]: Boogie Preprocessor took 88.15 ms. Allocated memory is still 305.7 MB. Free memory was 250.9 MB in the beginning and 248.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:20,627 INFO L168 Benchmark]: RCFGBuilder took 3348.38 ms. Allocated memory was 305.7 MB in the beginning and 367.5 MB in the end (delta: 61.9 MB). Free memory was 248.4 MB in the beginning and 171.3 MB in the end (delta: 77.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:20,627 INFO L168 Benchmark]: TraceAbstraction took 65030.28 ms. Allocated memory was 367.5 MB in the beginning and 1.2 GB in the end (delta: 857.7 MB). Free memory was 171.3 MB in the beginning and 499.6 MB in the end (delta: -328.3 MB). Peak memory consumption was 529.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:46:20,637 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 902.25 ms. Allocated memory was 248.5 MB in the beginning and 305.7 MB in the end (delta: 57.1 MB). Free memory was 203.6 MB in the beginning and 253.4 MB in the end (delta: -49.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 81.84 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 250.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 88.15 ms. Allocated memory is still 305.7 MB. Free memory was 250.9 MB in the beginning and 248.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3348.38 ms. Allocated memory was 305.7 MB in the beginning and 367.5 MB in the end (delta: 61.9 MB). Free memory was 248.4 MB in the beginning and 171.3 MB in the end (delta: 77.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 65030.28 ms. Allocated memory was 367.5 MB in the beginning and 1.2 GB in the end (delta: 857.7 MB). Free memory was 171.3 MB in the beginning and 499.6 MB in the end (delta: -328.3 MB). Peak memory consumption was 529.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L703] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L713] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L714] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L715] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L716] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L717] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L718] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L719] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L720] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L721] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L722] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L723] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L838] 0 pthread_t t2540; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L839] FCALL, FORK 0 pthread_create(&t2540, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2541; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L841] FCALL, FORK 0 pthread_create(&t2541, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2542; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L843] FCALL, FORK 0 pthread_create(&t2542, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L851] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 64.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 56.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1121 SDtfs, 1689 SDslu, 7136 SDs, 0 SdLazy, 6642 SolverSat, 976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1959occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1222 ConstructedInterpolants, 0 QuantifiedInterpolants, 573677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...