/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/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:13:51,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:13:51,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:13:52,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:13:52,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:13:52,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:13:52,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:13:52,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:13:52,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:13:52,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:13:52,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:13:52,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:13:52,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:13:52,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:13:52,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:13:52,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:13:52,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:13:52,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:13:52,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:13:52,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:13:52,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:13:52,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:13:52,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:13:52,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:13:52,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:13:52,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:13:52,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:13:52,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:13:52,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:13:52,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:13:52,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:13:52,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:13:52,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:13:52,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:13:52,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:13:52,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:13:52,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:13:52,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:13:52,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:13:52,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:13:52,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:13:52,089 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:13:52,125 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:13:52,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:13:52,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:13:52,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:13:52,126 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:13:52,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:13:52,127 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:13:52,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:13:52,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:13:52,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:13:52,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:13:52,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:13:52,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:13:52,128 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:13:52,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:13:52,129 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:13:52,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:13:52,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:13:52,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:13:52,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:13:52,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:13:52,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:13:52,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:13:52,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:13:52,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:13:52,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:13:52,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:13:52,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:13:52,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:13:52,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:13:52,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:13:52,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:13:52,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:13:52,438 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:13:52,438 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:13:52,439 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2020-10-11 18:13:52,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b8ed072a/fa8a8fd735a940a8a3f7734261c56f84/FLAGe954e73d0 [2020-10-11 18:13:52,964 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:13:52,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2020-10-11 18:13:52,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b8ed072a/fa8a8fd735a940a8a3f7734261c56f84/FLAGe954e73d0 [2020-10-11 18:13:53,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b8ed072a/fa8a8fd735a940a8a3f7734261c56f84 [2020-10-11 18:13:53,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:13:53,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:13:53,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:13:53,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:13:53,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:13:53,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:53" (1/1) ... [2020-10-11 18:13:53,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e793a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:53, skipping insertion in model container [2020-10-11 18:13:53,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:13:53" (1/1) ... [2020-10-11 18:13:53,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:13:53,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:13:53,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:13:53,929 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:13:53,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:13:54,061 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:13:54,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54 WrapperNode [2020-10-11 18:13:54,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:13:54,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:13:54,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:13:54,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:13:54,073 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:13:54" (1/1) ... [2020-10-11 18:13:54,093 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:13:54" (1/1) ... [2020-10-11 18:13:54,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:13:54,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:13:54,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:13:54,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:13:54,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (1/1) ... [2020-10-11 18:13:54,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (1/1) ... [2020-10-11 18:13:54,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (1/1) ... [2020-10-11 18:13:54,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (1/1) ... [2020-10-11 18:13:54,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (1/1) ... [2020-10-11 18:13:54,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (1/1) ... [2020-10-11 18:13:54,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (1/1) ... [2020-10-11 18:13:54,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:13:54,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:13:54,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:13:54,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:13:54,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (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:13:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:13:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:13:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:13:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:13:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:13:54,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:13:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:13:54,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:13:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:13:54,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:13:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:13:54,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:13:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:13:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:13:54,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:13:54,268 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:13:56,331 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:13:56,332 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:13:56,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:56 BoogieIcfgContainer [2020-10-11 18:13:56,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:13:56,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:13:56,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:13:56,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:13:56,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:13:53" (1/3) ... [2020-10-11 18:13:56,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c301dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:56, skipping insertion in model container [2020-10-11 18:13:56,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:13:54" (2/3) ... [2020-10-11 18:13:56,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c301dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:13:56, skipping insertion in model container [2020-10-11 18:13:56,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:13:56" (3/3) ... [2020-10-11 18:13:56,344 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2020-10-11 18:13:56,358 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:13:56,368 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:13:56,369 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:13:56,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,405 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,415 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,418 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,419 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,427 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,427 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,438 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,438 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:13:56,457 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:13:56,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:13:56,516 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:13:56,516 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:13:56,516 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:13:56,516 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:13:56,517 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:13:56,517 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:13:56,517 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:13:56,532 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-11 18:13:56,584 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-11 18:13:56,584 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:13:56,590 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-11 18:13:56,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow [2020-10-11 18:13:56,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow [2020-10-11 18:13:56,611 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2020-10-11 18:13:56,611 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:13:56,612 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:13:56,613 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] [2020-10-11 18:13:56,614 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:13:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:13:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1234135215, now seen corresponding path program 1 times [2020-10-11 18:13:56,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:13:56,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016830931] [2020-10-11 18:13:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:13:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:13:56,976 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:13:56,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016830931] [2020-10-11 18:13:56,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:13:56,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:13:56,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122752789] [2020-10-11 18:13:56,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:13:56,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:13:57,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:13:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:13:57,115 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 111 [2020-10-11 18:13:57,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 107 transitions, 226 flow. Second operand 3 states. [2020-10-11 18:13:57,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:13:57,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 111 [2020-10-11 18:13:57,120 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:13:57,154 INFO L129 PetriNetUnfolder]: 0/104 cut-off events. [2020-10-11 18:13:57,155 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:13:57,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 104 events. 0/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 4/106 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:13:57,157 INFO L132 encePairwiseOnDemand]: 106/111 looper letters, 0 selfloop transitions, 2 changer transitions 13/104 dead transitions. [2020-10-11 18:13:57,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 104 transitions, 224 flow [2020-10-11 18:13:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:13:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:13:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2020-10-11 18:13:57,175 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.975975975975976 [2020-10-11 18:13:57,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2020-10-11 18:13:57,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2020-10-11 18:13:57,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:13:57,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2020-10-11 18:13:57,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:13:57,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:13:57,192 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:13:57,194 INFO L185 Difference]: Start difference. First operand has 118 places, 107 transitions, 226 flow. Second operand 3 states and 325 transitions. [2020-10-11 18:13:57,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 104 transitions, 224 flow [2020-10-11 18:13:57,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 104 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:13:57,203 INFO L241 Difference]: Finished difference. Result has 115 places, 91 transitions, 194 flow [2020-10-11 18:13:57,207 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=115, PETRI_TRANSITIONS=91} [2020-10-11 18:13:57,208 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2020-10-11 18:13:57,208 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 91 transitions, 194 flow [2020-10-11 18:13:57,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:13:57,208 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:13:57,208 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:13:57,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:13:57,209 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:13:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:13:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 444824441, now seen corresponding path program 1 times [2020-10-11 18:13:57,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:13:57,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380594088] [2020-10-11 18:13:57,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:13:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:13:57,435 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:13:57,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380594088] [2020-10-11 18:13:57,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:13:57,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:13:57,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401521368] [2020-10-11 18:13:57,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:13:57,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:13:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:13:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:13:57,663 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 111 [2020-10-11 18:13:57,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 91 transitions, 194 flow. Second operand 6 states. [2020-10-11 18:13:57,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:13:57,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 111 [2020-10-11 18:13:57,664 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:13:57,838 INFO L129 PetriNetUnfolder]: 3/107 cut-off events. [2020-10-11 18:13:57,838 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:13:57,841 INFO L80 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 2/109 useless extension candidates. Maximal degree in co-relation 98. Up to 7 conditions per place. [2020-10-11 18:13:57,842 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 6 selfloop transitions, 2 changer transitions 10/101 dead transitions. [2020-10-11 18:13:57,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 250 flow [2020-10-11 18:13:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:13:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:13:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 929 transitions. [2020-10-11 18:13:57,859 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.92992992992993 [2020-10-11 18:13:57,859 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 929 transitions. [2020-10-11 18:13:57,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 929 transitions. [2020-10-11 18:13:57,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:13:57,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 929 transitions. [2020-10-11 18:13:57,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:13:57,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:13:57,870 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:13:57,870 INFO L185 Difference]: Start difference. First operand has 115 places, 91 transitions, 194 flow. Second operand 9 states and 929 transitions. [2020-10-11 18:13:57,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 250 flow [2020-10-11 18:13:57,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:13:57,876 INFO L241 Difference]: Finished difference. Result has 115 places, 91 transitions, 210 flow [2020-10-11 18:13:57,877 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=115, PETRI_TRANSITIONS=91} [2020-10-11 18:13:57,877 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2020-10-11 18:13:57,877 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 91 transitions, 210 flow [2020-10-11 18:13:57,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:13:57,878 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:13:57,878 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] [2020-10-11 18:13:57,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:13:57,879 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:13:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:13:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash 765558607, now seen corresponding path program 1 times [2020-10-11 18:13:57,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:13:57,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035857469] [2020-10-11 18:13:57,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:13:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:13:58,145 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:13:58,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035857469] [2020-10-11 18:13:58,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:13:58,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:13:58,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027282904] [2020-10-11 18:13:58,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:13:58,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:13:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:13:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:13:58,386 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:13:58,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 91 transitions, 210 flow. Second operand 6 states. [2020-10-11 18:13:58,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:13:58,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:13:58,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:13:58,531 INFO L129 PetriNetUnfolder]: 24/165 cut-off events. [2020-10-11 18:13:58,532 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2020-10-11 18:13:58,534 INFO L80 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 165 events. 24/165 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 455 event pairs, 5 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 255. Up to 31 conditions per place. [2020-10-11 18:13:58,535 INFO L132 encePairwiseOnDemand]: 104/111 looper letters, 8 selfloop transitions, 3 changer transitions 19/112 dead transitions. [2020-10-11 18:13:58,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 112 transitions, 330 flow [2020-10-11 18:13:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:13:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:13:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 932 transitions. [2020-10-11 18:13:58,539 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9329329329329329 [2020-10-11 18:13:58,539 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 932 transitions. [2020-10-11 18:13:58,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 932 transitions. [2020-10-11 18:13:58,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:13:58,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 932 transitions. [2020-10-11 18:13:58,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:13:58,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:13:58,547 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:13:58,547 INFO L185 Difference]: Start difference. First operand has 115 places, 91 transitions, 210 flow. Second operand 9 states and 932 transitions. [2020-10-11 18:13:58,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 112 transitions, 330 flow [2020-10-11 18:13:58,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 298 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:13:58,555 INFO L241 Difference]: Finished difference. Result has 116 places, 93 transitions, 237 flow [2020-10-11 18:13:58,555 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=116, PETRI_TRANSITIONS=93} [2020-10-11 18:13:58,555 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2020-10-11 18:13:58,555 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 93 transitions, 237 flow [2020-10-11 18:13:58,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:13:58,556 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:13:58,557 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] [2020-10-11 18:13:58,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:13:58,557 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:13:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:13:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2078175150, now seen corresponding path program 1 times [2020-10-11 18:13:58,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:13:58,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85930020] [2020-10-11 18:13:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:13:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:13:58,903 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:13:58,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85930020] [2020-10-11 18:13:58,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:13:58,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:13:58,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635986719] [2020-10-11 18:13:58,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:13:58,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:13:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:13:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:13:59,482 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:13:59,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 93 transitions, 237 flow. Second operand 10 states. [2020-10-11 18:13:59,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:13:59,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:13:59,483 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:00,245 INFO L129 PetriNetUnfolder]: 755/1469 cut-off events. [2020-10-11 18:14:00,245 INFO L130 PetriNetUnfolder]: For 1253/1257 co-relation queries the response was YES. [2020-10-11 18:14:00,262 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 1469 events. 755/1469 cut-off events. For 1253/1257 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9236 event pairs, 324 based on Foata normal form. 42/1456 useless extension candidates. Maximal degree in co-relation 3479. Up to 608 conditions per place. [2020-10-11 18:14:00,273 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 14 selfloop transitions, 10 changer transitions 44/145 dead transitions. [2020-10-11 18:14:00,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 145 transitions, 509 flow [2020-10-11 18:14:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:14:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:14:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1451 transitions. [2020-10-11 18:14:00,279 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8714714714714715 [2020-10-11 18:14:00,279 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1451 transitions. [2020-10-11 18:14:00,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1451 transitions. [2020-10-11 18:14:00,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:00,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1451 transitions. [2020-10-11 18:14:00,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:14:00,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:14:00,288 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:14:00,289 INFO L185 Difference]: Start difference. First operand has 116 places, 93 transitions, 237 flow. Second operand 15 states and 1451 transitions. [2020-10-11 18:14:00,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 145 transitions, 509 flow [2020-10-11 18:14:00,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 145 transitions, 488 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-11 18:14:00,303 INFO L241 Difference]: Finished difference. Result has 131 places, 99 transitions, 312 flow [2020-10-11 18:14:00,304 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=312, PETRI_PLACES=131, PETRI_TRANSITIONS=99} [2020-10-11 18:14:00,304 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2020-10-11 18:14:00,304 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 99 transitions, 312 flow [2020-10-11 18:14:00,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:14:00,305 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:00,305 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:14:00,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:14:00,305 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:00,306 INFO L82 PathProgramCache]: Analyzing trace with hash -948270200, now seen corresponding path program 1 times [2020-10-11 18:14:00,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:00,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144199724] [2020-10-11 18:14:00,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:00,577 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:14:00,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144199724] [2020-10-11 18:14:00,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:00,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:14:00,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557925362] [2020-10-11 18:14:00,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:14:00,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:14:00,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:14:01,356 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2020-10-11 18:14:01,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 99 transitions, 312 flow. Second operand 9 states. [2020-10-11 18:14:01,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:01,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2020-10-11 18:14:01,357 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:02,031 INFO L129 PetriNetUnfolder]: 624/1250 cut-off events. [2020-10-11 18:14:02,032 INFO L130 PetriNetUnfolder]: For 4061/4112 co-relation queries the response was YES. [2020-10-11 18:14:02,045 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 1250 events. 624/1250 cut-off events. For 4061/4112 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7541 event pairs, 133 based on Foata normal form. 31/1243 useless extension candidates. Maximal degree in co-relation 4409. Up to 476 conditions per place. [2020-10-11 18:14:02,058 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 29 selfloop transitions, 9 changer transitions 37/153 dead transitions. [2020-10-11 18:14:02,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 153 transitions, 786 flow [2020-10-11 18:14:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:14:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:14:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1374 transitions. [2020-10-11 18:14:02,066 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8841698841698842 [2020-10-11 18:14:02,066 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1374 transitions. [2020-10-11 18:14:02,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1374 transitions. [2020-10-11 18:14:02,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:02,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1374 transitions. [2020-10-11 18:14:02,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:14:02,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:14:02,075 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:14:02,075 INFO L185 Difference]: Start difference. First operand has 131 places, 99 transitions, 312 flow. Second operand 14 states and 1374 transitions. [2020-10-11 18:14:02,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 153 transitions, 786 flow [2020-10-11 18:14:02,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 153 transitions, 752 flow, removed 15 selfloop flow, removed 5 redundant places. [2020-10-11 18:14:02,087 INFO L241 Difference]: Finished difference. Result has 141 places, 103 transitions, 390 flow [2020-10-11 18:14:02,088 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=390, PETRI_PLACES=141, PETRI_TRANSITIONS=103} [2020-10-11 18:14:02,088 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2020-10-11 18:14:02,088 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 103 transitions, 390 flow [2020-10-11 18:14:02,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:14:02,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:02,089 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, 1] [2020-10-11 18:14:02,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:14:02,090 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash -839513425, now seen corresponding path program 1 times [2020-10-11 18:14:02,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:02,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812093607] [2020-10-11 18:14:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:02,521 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:14:02,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812093607] [2020-10-11 18:14:02,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:02,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:14:02,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90597978] [2020-10-11 18:14:02,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:14:02,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:02,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:14:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:14:03,684 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:14:03,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 103 transitions, 390 flow. Second operand 12 states. [2020-10-11 18:14:03,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:03,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:14:03,685 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:04,796 INFO L129 PetriNetUnfolder]: 574/1376 cut-off events. [2020-10-11 18:14:04,797 INFO L130 PetriNetUnfolder]: For 9306/10046 co-relation queries the response was YES. [2020-10-11 18:14:04,816 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6523 conditions, 1376 events. 574/1376 cut-off events. For 9306/10046 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9444 event pairs, 51 based on Foata normal form. 47/1388 useless extension candidates. Maximal degree in co-relation 6443. Up to 347 conditions per place. [2020-10-11 18:14:04,829 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 29 selfloop transitions, 16 changer transitions 41/163 dead transitions. [2020-10-11 18:14:04,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 1223 flow [2020-10-11 18:14:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-11 18:14:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-11 18:14:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2015 transitions. [2020-10-11 18:14:04,837 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8644358644358644 [2020-10-11 18:14:04,838 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2015 transitions. [2020-10-11 18:14:04,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2015 transitions. [2020-10-11 18:14:04,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:04,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2015 transitions. [2020-10-11 18:14:04,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 22 states. [2020-10-11 18:14:04,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 22 states. [2020-10-11 18:14:04,851 INFO L81 ComplementDD]: Finished complementDD. Result 22 states. [2020-10-11 18:14:04,851 INFO L185 Difference]: Start difference. First operand has 141 places, 103 transitions, 390 flow. Second operand 21 states and 2015 transitions. [2020-10-11 18:14:04,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 1223 flow [2020-10-11 18:14:04,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 163 transitions, 1126 flow, removed 42 selfloop flow, removed 8 redundant places. [2020-10-11 18:14:04,871 INFO L241 Difference]: Finished difference. Result has 158 places, 107 transitions, 496 flow [2020-10-11 18:14:04,872 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=496, PETRI_PLACES=158, PETRI_TRANSITIONS=107} [2020-10-11 18:14:04,872 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2020-10-11 18:14:04,872 INFO L481 AbstractCegarLoop]: Abstraction has has 158 places, 107 transitions, 496 flow [2020-10-11 18:14:04,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:14:04,873 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:04,873 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, 1] [2020-10-11 18:14:04,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:14:04,874 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:04,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1013084753, now seen corresponding path program 1 times [2020-10-11 18:14:04,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:04,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950152332] [2020-10-11 18:14:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:05,206 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:14:05,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950152332] [2020-10-11 18:14:05,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:05,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:14:05,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207846008] [2020-10-11 18:14:05,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:14:05,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:05,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:14:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:14:05,930 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2020-10-11 18:14:05,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 107 transitions, 496 flow. Second operand 11 states. [2020-10-11 18:14:05,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:05,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2020-10-11 18:14:05,932 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:06,579 INFO L129 PetriNetUnfolder]: 535/1249 cut-off events. [2020-10-11 18:14:06,579 INFO L130 PetriNetUnfolder]: For 13126/13576 co-relation queries the response was YES. [2020-10-11 18:14:06,596 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6667 conditions, 1249 events. 535/1249 cut-off events. For 13126/13576 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8168 event pairs, 139 based on Foata normal form. 42/1240 useless extension candidates. Maximal degree in co-relation 6576. Up to 613 conditions per place. [2020-10-11 18:14:06,610 INFO L132 encePairwiseOnDemand]: 97/111 looper letters, 24 selfloop transitions, 16 changer transitions 40/156 dead transitions. [2020-10-11 18:14:06,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 1225 flow [2020-10-11 18:14:06,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:14:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:14:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1519 transitions. [2020-10-11 18:14:06,616 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8552927927927928 [2020-10-11 18:14:06,617 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1519 transitions. [2020-10-11 18:14:06,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1519 transitions. [2020-10-11 18:14:06,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:06,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1519 transitions. [2020-10-11 18:14:06,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:14:06,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:14:06,625 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:14:06,625 INFO L185 Difference]: Start difference. First operand has 158 places, 107 transitions, 496 flow. Second operand 16 states and 1519 transitions. [2020-10-11 18:14:06,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 1225 flow [2020-10-11 18:14:06,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 156 transitions, 1041 flow, removed 78 selfloop flow, removed 17 redundant places. [2020-10-11 18:14:06,657 INFO L241 Difference]: Finished difference. Result has 155 places, 115 transitions, 605 flow [2020-10-11 18:14:06,657 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=605, PETRI_PLACES=155, PETRI_TRANSITIONS=115} [2020-10-11 18:14:06,658 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2020-10-11 18:14:06,658 INFO L481 AbstractCegarLoop]: Abstraction has has 155 places, 115 transitions, 605 flow [2020-10-11 18:14:06,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:14:06,658 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:06,658 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, 1, 1] [2020-10-11 18:14:06,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:14:06,659 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1931027647, now seen corresponding path program 1 times [2020-10-11 18:14:06,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:06,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109197189] [2020-10-11 18:14:06,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:06,990 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:14:06,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109197189] [2020-10-11 18:14:06,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:06,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:14:06,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981066286] [2020-10-11 18:14:06,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:14:06,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:14:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:14:07,912 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2020-10-11 18:14:07,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 115 transitions, 605 flow. Second operand 13 states. [2020-10-11 18:14:07,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:07,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2020-10-11 18:14:07,914 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:08,538 INFO L129 PetriNetUnfolder]: 439/1055 cut-off events. [2020-10-11 18:14:08,538 INFO L130 PetriNetUnfolder]: For 10891/11426 co-relation queries the response was YES. [2020-10-11 18:14:08,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5682 conditions, 1055 events. 439/1055 cut-off events. For 10891/11426 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6494 event pairs, 118 based on Foata normal form. 36/1047 useless extension candidates. Maximal degree in co-relation 5589. Up to 526 conditions per place. [2020-10-11 18:14:08,564 INFO L132 encePairwiseOnDemand]: 100/111 looper letters, 31 selfloop transitions, 12 changer transitions 19/137 dead transitions. [2020-10-11 18:14:08,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 137 transitions, 1018 flow [2020-10-11 18:14:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:14:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:14:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1306 transitions. [2020-10-11 18:14:08,569 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8404118404118404 [2020-10-11 18:14:08,569 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1306 transitions. [2020-10-11 18:14:08,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1306 transitions. [2020-10-11 18:14:08,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:08,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1306 transitions. [2020-10-11 18:14:08,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:14:08,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:14:08,578 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:14:08,578 INFO L185 Difference]: Start difference. First operand has 155 places, 115 transitions, 605 flow. Second operand 14 states and 1306 transitions. [2020-10-11 18:14:08,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 137 transitions, 1018 flow [2020-10-11 18:14:08,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 137 transitions, 908 flow, removed 47 selfloop flow, removed 10 redundant places. [2020-10-11 18:14:08,600 INFO L241 Difference]: Finished difference. Result has 156 places, 115 transitions, 578 flow [2020-10-11 18:14:08,600 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=578, PETRI_PLACES=156, PETRI_TRANSITIONS=115} [2020-10-11 18:14:08,601 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 38 predicate places. [2020-10-11 18:14:08,601 INFO L481 AbstractCegarLoop]: Abstraction has has 156 places, 115 transitions, 578 flow [2020-10-11 18:14:08,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:14:08,601 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:08,601 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, 1, 1, 1] [2020-10-11 18:14:08,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:14:08,602 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash 599621009, now seen corresponding path program 1 times [2020-10-11 18:14:08,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:08,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035071354] [2020-10-11 18:14:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:08,771 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:14:08,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035071354] [2020-10-11 18:14:08,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:08,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:14:08,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702938273] [2020-10-11 18:14:08,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:14:08,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:14:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:14:08,897 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:14:08,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 115 transitions, 578 flow. Second operand 6 states. [2020-10-11 18:14:08,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:08,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:14:08,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:09,902 INFO L129 PetriNetUnfolder]: 2012/4393 cut-off events. [2020-10-11 18:14:09,903 INFO L130 PetriNetUnfolder]: For 21818/22074 co-relation queries the response was YES. [2020-10-11 18:14:09,970 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14675 conditions, 4393 events. 2012/4393 cut-off events. For 21818/22074 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 38844 event pairs, 304 based on Foata normal form. 105/4073 useless extension candidates. Maximal degree in co-relation 14584. Up to 1162 conditions per place. [2020-10-11 18:14:10,006 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 23 selfloop transitions, 19 changer transitions 0/146 dead transitions. [2020-10-11 18:14:10,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 146 transitions, 724 flow [2020-10-11 18:14:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:14:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:14:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions. [2020-10-11 18:14:10,010 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9179179179179179 [2020-10-11 18:14:10,010 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 917 transitions. [2020-10-11 18:14:10,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions. [2020-10-11 18:14:10,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:10,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions. [2020-10-11 18:14:10,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:14:10,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:14:10,016 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:14:10,016 INFO L185 Difference]: Start difference. First operand has 156 places, 115 transitions, 578 flow. Second operand 9 states and 917 transitions. [2020-10-11 18:14:10,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 146 transitions, 724 flow [2020-10-11 18:14:10,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 671 flow, removed 14 selfloop flow, removed 16 redundant places. [2020-10-11 18:14:10,050 INFO L241 Difference]: Finished difference. Result has 147 places, 132 transitions, 659 flow [2020-10-11 18:14:10,050 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=659, PETRI_PLACES=147, PETRI_TRANSITIONS=132} [2020-10-11 18:14:10,050 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 29 predicate places. [2020-10-11 18:14:10,051 INFO L481 AbstractCegarLoop]: Abstraction has has 147 places, 132 transitions, 659 flow [2020-10-11 18:14:10,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:14:10,051 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:10,051 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, 1, 1, 1, 1] [2020-10-11 18:14:10,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:14:10,051 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1426382021, now seen corresponding path program 1 times [2020-10-11 18:14:10,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:10,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757804069] [2020-10-11 18:14:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:10,197 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:14:10,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757804069] [2020-10-11 18:14:10,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:10,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:14:10,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979710989] [2020-10-11 18:14:10,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:14:10,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:10,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:14:10,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:14:10,330 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:14:10,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 132 transitions, 659 flow. Second operand 7 states. [2020-10-11 18:14:10,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:10,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:14:10,331 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:11,000 INFO L129 PetriNetUnfolder]: 1620/3752 cut-off events. [2020-10-11 18:14:11,000 INFO L130 PetriNetUnfolder]: For 15355/27524 co-relation queries the response was YES. [2020-10-11 18:14:11,035 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14538 conditions, 3752 events. 1620/3752 cut-off events. For 15355/27524 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 33982 event pairs, 111 based on Foata normal form. 535/3913 useless extension candidates. Maximal degree in co-relation 14455. Up to 1526 conditions per place. [2020-10-11 18:14:11,062 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 25 selfloop transitions, 37 changer transitions 0/163 dead transitions. [2020-10-11 18:14:11,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 163 transitions, 988 flow [2020-10-11 18:14:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:14:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:14:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1224 transitions. [2020-10-11 18:14:11,065 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2020-10-11 18:14:11,065 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1224 transitions. [2020-10-11 18:14:11,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1224 transitions. [2020-10-11 18:14:11,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:11,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1224 transitions. [2020-10-11 18:14:11,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:14:11,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:14:11,071 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:14:11,072 INFO L185 Difference]: Start difference. First operand has 147 places, 132 transitions, 659 flow. Second operand 12 states and 1224 transitions. [2020-10-11 18:14:11,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 163 transitions, 988 flow [2020-10-11 18:14:11,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 163 transitions, 986 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:14:11,102 INFO L241 Difference]: Finished difference. Result has 162 places, 148 transitions, 913 flow [2020-10-11 18:14:11,102 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=913, PETRI_PLACES=162, PETRI_TRANSITIONS=148} [2020-10-11 18:14:11,103 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 44 predicate places. [2020-10-11 18:14:11,103 INFO L481 AbstractCegarLoop]: Abstraction has has 162 places, 148 transitions, 913 flow [2020-10-11 18:14:11,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:14:11,103 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:11,103 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, 1, 1, 1, 1, 1, 1] [2020-10-11 18:14:11,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:14:11,104 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:11,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:11,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1121005768, now seen corresponding path program 1 times [2020-10-11 18:14:11,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:11,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284511606] [2020-10-11 18:14:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:11,202 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:14:11,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284511606] [2020-10-11 18:14:11,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:11,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:14:11,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005181998] [2020-10-11 18:14:11,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:14:11,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:14:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:14:11,364 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:14:11,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 148 transitions, 913 flow. Second operand 6 states. [2020-10-11 18:14:11,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:11,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:14:11,365 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:12,065 INFO L129 PetriNetUnfolder]: 1373/4301 cut-off events. [2020-10-11 18:14:12,065 INFO L130 PetriNetUnfolder]: For 26253/37098 co-relation queries the response was YES. [2020-10-11 18:14:12,101 INFO L80 FinitePrefix]: Finished finitePrefix Result has 18524 conditions, 4301 events. 1373/4301 cut-off events. For 26253/37098 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 44872 event pairs, 231 based on Foata normal form. 124/3991 useless extension candidates. Maximal degree in co-relation 18434. Up to 1407 conditions per place. [2020-10-11 18:14:12,126 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 15 selfloop transitions, 12 changer transitions 0/163 dead transitions. [2020-10-11 18:14:12,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 1103 flow [2020-10-11 18:14:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:14:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:14:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2020-10-11 18:14:12,129 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9269269269269269 [2020-10-11 18:14:12,129 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2020-10-11 18:14:12,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2020-10-11 18:14:12,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:12,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2020-10-11 18:14:12,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:14:12,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:14:12,133 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:14:12,133 INFO L185 Difference]: Start difference. First operand has 162 places, 148 transitions, 913 flow. Second operand 9 states and 926 transitions. [2020-10-11 18:14:12,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 1103 flow [2020-10-11 18:14:12,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 163 transitions, 1000 flow, removed 42 selfloop flow, removed 4 redundant places. [2020-10-11 18:14:12,302 INFO L241 Difference]: Finished difference. Result has 173 places, 157 transitions, 971 flow [2020-10-11 18:14:12,303 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=971, PETRI_PLACES=173, PETRI_TRANSITIONS=157} [2020-10-11 18:14:12,303 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 55 predicate places. [2020-10-11 18:14:12,303 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 157 transitions, 971 flow [2020-10-11 18:14:12,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:14:12,304 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:12,304 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:14:12,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:14:12,304 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2022299676, now seen corresponding path program 1 times [2020-10-11 18:14:12,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:12,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565941004] [2020-10-11 18:14:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:12,434 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:14:12,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565941004] [2020-10-11 18:14:12,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:12,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:14:12,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104228874] [2020-10-11 18:14:12,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:14:12,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:12,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:14:12,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:14:12,676 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:14:12,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 157 transitions, 971 flow. Second operand 8 states. [2020-10-11 18:14:12,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:12,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:14:12,677 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:13,629 INFO L129 PetriNetUnfolder]: 2149/4723 cut-off events. [2020-10-11 18:14:13,629 INFO L130 PetriNetUnfolder]: For 36165/61295 co-relation queries the response was YES. [2020-10-11 18:14:13,668 INFO L80 FinitePrefix]: Finished finitePrefix Result has 21998 conditions, 4723 events. 2149/4723 cut-off events. For 36165/61295 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 44483 event pairs, 24 based on Foata normal form. 946/5105 useless extension candidates. Maximal degree in co-relation 21902. Up to 1796 conditions per place. [2020-10-11 18:14:13,694 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 19 selfloop transitions, 57 changer transitions 16/191 dead transitions. [2020-10-11 18:14:13,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 191 transitions, 1507 flow [2020-10-11 18:14:13,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:14:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:14:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1531 transitions. [2020-10-11 18:14:13,698 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9195195195195195 [2020-10-11 18:14:13,698 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1531 transitions. [2020-10-11 18:14:13,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1531 transitions. [2020-10-11 18:14:13,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:13,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1531 transitions. [2020-10-11 18:14:13,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:14:13,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:14:13,704 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:14:13,704 INFO L185 Difference]: Start difference. First operand has 173 places, 157 transitions, 971 flow. Second operand 15 states and 1531 transitions. [2020-10-11 18:14:13,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 191 transitions, 1507 flow [2020-10-11 18:14:13,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 191 transitions, 1457 flow, removed 21 selfloop flow, removed 2 redundant places. [2020-10-11 18:14:13,846 INFO L241 Difference]: Finished difference. Result has 188 places, 171 transitions, 1255 flow [2020-10-11 18:14:13,847 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1255, PETRI_PLACES=188, PETRI_TRANSITIONS=171} [2020-10-11 18:14:13,847 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 70 predicate places. [2020-10-11 18:14:13,847 INFO L481 AbstractCegarLoop]: Abstraction has has 188 places, 171 transitions, 1255 flow [2020-10-11 18:14:13,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:14:13,848 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:13,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:14:13,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:14:13,848 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash 934616395, now seen corresponding path program 1 times [2020-10-11 18:14:13,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:13,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918475497] [2020-10-11 18:14:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:13,980 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:14:13,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918475497] [2020-10-11 18:14:13,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:13,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:14:13,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139214226] [2020-10-11 18:14:13,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:14:13,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:13,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:14:13,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:14:14,262 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 111 [2020-10-11 18:14:14,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 171 transitions, 1255 flow. Second operand 7 states. [2020-10-11 18:14:14,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:14,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 111 [2020-10-11 18:14:14,263 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:15,341 INFO L129 PetriNetUnfolder]: 2788/7267 cut-off events. [2020-10-11 18:14:15,341 INFO L130 PetriNetUnfolder]: For 63916/73724 co-relation queries the response was YES. [2020-10-11 18:14:15,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 32350 conditions, 7267 events. 2788/7267 cut-off events. For 63916/73724 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 81827 event pairs, 26 based on Foata normal form. 21/6499 useless extension candidates. Maximal degree in co-relation 32249. Up to 2450 conditions per place. [2020-10-11 18:14:15,476 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 13 selfloop transitions, 2 changer transitions 4/180 dead transitions. [2020-10-11 18:14:15,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 180 transitions, 1387 flow [2020-10-11 18:14:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:14:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:14:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2020-10-11 18:14:15,478 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2020-10-11 18:14:15,478 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2020-10-11 18:14:15,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2020-10-11 18:14:15,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:15,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2020-10-11 18:14:15,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:14:15,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:14:15,481 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:14:15,482 INFO L185 Difference]: Start difference. First operand has 188 places, 171 transitions, 1255 flow. Second operand 7 states and 713 transitions. [2020-10-11 18:14:15,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 180 transitions, 1387 flow [2020-10-11 18:14:18,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 180 transitions, 1038 flow, removed 132 selfloop flow, removed 17 redundant places. [2020-10-11 18:14:18,069 INFO L241 Difference]: Finished difference. Result has 176 places, 172 transitions, 945 flow [2020-10-11 18:14:18,069 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=945, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2020-10-11 18:14:18,070 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2020-10-11 18:14:18,070 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 945 flow [2020-10-11 18:14:18,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:14:18,070 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:18,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:14:18,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:14:18,071 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -633904135, now seen corresponding path program 2 times [2020-10-11 18:14:18,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:18,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650449740] [2020-10-11 18:14:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:18,219 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:14:18,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650449740] [2020-10-11 18:14:18,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:18,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:14:18,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853158394] [2020-10-11 18:14:18,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:14:18,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:14:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:14:18,308 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:14:18,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 945 flow. Second operand 9 states. [2020-10-11 18:14:18,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:18,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:14:18,309 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:19,677 INFO L129 PetriNetUnfolder]: 3608/7967 cut-off events. [2020-10-11 18:14:19,678 INFO L130 PetriNetUnfolder]: For 16344/46760 co-relation queries the response was YES. [2020-10-11 18:14:19,752 INFO L80 FinitePrefix]: Finished finitePrefix Result has 27024 conditions, 7967 events. 3608/7967 cut-off events. For 16344/46760 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 85582 event pairs, 0 based on Foata normal form. 1856/8780 useless extension candidates. Maximal degree in co-relation 26975. Up to 1344 conditions per place. [2020-10-11 18:14:19,774 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 12 selfloop transitions, 63 changer transitions 21/196 dead transitions. [2020-10-11 18:14:19,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 196 transitions, 1294 flow [2020-10-11 18:14:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:14:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:14:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1822 transitions. [2020-10-11 18:14:19,777 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9119119119119119 [2020-10-11 18:14:19,777 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1822 transitions. [2020-10-11 18:14:19,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1822 transitions. [2020-10-11 18:14:19,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:19,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1822 transitions. [2020-10-11 18:14:19,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:14:19,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:14:19,784 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:14:19,784 INFO L185 Difference]: Start difference. First operand has 176 places, 172 transitions, 945 flow. Second operand 18 states and 1822 transitions. [2020-10-11 18:14:19,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 196 transitions, 1294 flow [2020-10-11 18:14:20,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 196 transitions, 1224 flow, removed 31 selfloop flow, removed 12 redundant places. [2020-10-11 18:14:20,176 INFO L241 Difference]: Finished difference. Result has 184 places, 171 transitions, 1039 flow [2020-10-11 18:14:20,176 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1039, PETRI_PLACES=184, PETRI_TRANSITIONS=171} [2020-10-11 18:14:20,177 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 66 predicate places. [2020-10-11 18:14:20,177 INFO L481 AbstractCegarLoop]: Abstraction has has 184 places, 171 transitions, 1039 flow [2020-10-11 18:14:20,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:14:20,177 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:20,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:14:20,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:14:20,177 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:20,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:20,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1812453377, now seen corresponding path program 1 times [2020-10-11 18:14:20,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:20,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359730029] [2020-10-11 18:14:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:14:20,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:14:20,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359730029] [2020-10-11 18:14:20,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:14:20,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:14:20,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017408357] [2020-10-11 18:14:20,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:14:20,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:14:20,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:14:20,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:14:20,929 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:14:20,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 171 transitions, 1039 flow. Second operand 9 states. [2020-10-11 18:14:20,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:14:20,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:14:20,930 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:14:23,107 INFO L129 PetriNetUnfolder]: 6216/17026 cut-off events. [2020-10-11 18:14:23,108 INFO L130 PetriNetUnfolder]: For 42132/47160 co-relation queries the response was YES. [2020-10-11 18:14:23,319 INFO L80 FinitePrefix]: Finished finitePrefix Result has 56075 conditions, 17026 events. 6216/17026 cut-off events. For 42132/47160 co-relation queries the response was YES. Maximal size of possible extension queue 2677. Compared 228796 event pairs, 15 based on Foata normal form. 34/15613 useless extension candidates. Maximal degree in co-relation 55981. Up to 2319 conditions per place. [2020-10-11 18:14:23,343 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 39 selfloop transitions, 21 changer transitions 24/225 dead transitions. [2020-10-11 18:14:23,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 225 transitions, 1629 flow [2020-10-11 18:14:23,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:14:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:14:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2020-10-11 18:14:23,344 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8678678678678678 [2020-10-11 18:14:23,345 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2020-10-11 18:14:23,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2020-10-11 18:14:23,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:14:23,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2020-10-11 18:14:23,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:14:23,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:14:23,347 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:14:23,348 INFO L185 Difference]: Start difference. First operand has 184 places, 171 transitions, 1039 flow. Second operand 9 states and 867 transitions. [2020-10-11 18:14:23,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 225 transitions, 1629 flow [2020-10-11 18:14:26,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 225 transitions, 1411 flow, removed 61 selfloop flow, removed 20 redundant places. [2020-10-11 18:14:26,272 INFO L241 Difference]: Finished difference. Result has 176 places, 186 transitions, 1113 flow [2020-10-11 18:14:26,272 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1113, PETRI_PLACES=176, PETRI_TRANSITIONS=186} [2020-10-11 18:14:26,273 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2020-10-11 18:14:26,273 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 186 transitions, 1113 flow [2020-10-11 18:14:26,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:14:26,273 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:14:26,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:14:26,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:14:26,273 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:14:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:14:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1292594137, now seen corresponding path program 2 times [2020-10-11 18:14:26,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:14:26,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510921500] [2020-10-11 18:14:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:14:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:14:26,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:14:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:14:26,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:14:26,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:14:26,414 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:14:26,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:14:26,468 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:14:26,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,471 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:14:26,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,471 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:14:26,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,472 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:14:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,472 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:14:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,472 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:14:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,473 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:14:26,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,473 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:14:26,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,473 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:14:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,474 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:14:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,474 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:14:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,475 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:14:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,475 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:14:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,475 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:14:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,476 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:14:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,476 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:14:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,476 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:14:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,477 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:14:26,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,478 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:14:26,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,478 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:14:26,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,478 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:14:26,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,479 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:14:26,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,479 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:14:26,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,480 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:14:26,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,480 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:14:26,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,480 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:14:26,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,481 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:14:26,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,481 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:14:26,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,481 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:14:26,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,481 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:14:26,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,482 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:14:26,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,482 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:14:26,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,483 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:14:26,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,483 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:14:26,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:14:26,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:14:26 BasicIcfg [2020-10-11 18:14:26,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:14:26,614 INFO L168 Benchmark]: Toolchain (without parser) took 33339.86 ms. Allocated memory was 253.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 207.8 MB in the beginning and 929.2 MB in the end (delta: -721.5 MB). Peak memory consumption was 387.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:14:26,615 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.5 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-11 18:14:26,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.02 ms. Allocated memory was 253.2 MB in the beginning and 323.5 MB in the end (delta: 70.3 MB). Free memory was 206.9 MB in the beginning and 270.2 MB in the end (delta: -63.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:14:26,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.67 ms. Allocated memory is still 323.5 MB. Free memory was 270.2 MB in the beginning and 266.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:14:26,622 INFO L168 Benchmark]: Boogie Preprocessor took 41.93 ms. Allocated memory is still 323.5 MB. Free memory was 266.8 MB in the beginning and 264.2 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:14:26,623 INFO L168 Benchmark]: RCFGBuilder took 2150.47 ms. Allocated memory was 323.5 MB in the beginning and 359.7 MB in the end (delta: 36.2 MB). Free memory was 264.2 MB in the beginning and 181.0 MB in the end (delta: 83.2 MB). Peak memory consumption was 119.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:14:26,624 INFO L168 Benchmark]: TraceAbstraction took 30271.48 ms. Allocated memory was 359.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 181.0 MB in the beginning and 929.2 MB in the end (delta: -748.2 MB). Peak memory consumption was 254.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:14:26,631 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.22 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.5 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 792.02 ms. Allocated memory was 253.2 MB in the beginning and 323.5 MB in the end (delta: 70.3 MB). Free memory was 206.9 MB in the beginning and 270.2 MB in the end (delta: -63.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 78.67 ms. Allocated memory is still 323.5 MB. Free memory was 270.2 MB in the beginning and 266.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.93 ms. Allocated memory is still 323.5 MB. Free memory was 266.8 MB in the beginning and 264.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2150.47 ms. Allocated memory was 323.5 MB in the beginning and 359.7 MB in the end (delta: 36.2 MB). Free memory was 264.2 MB in the beginning and 181.0 MB in the end (delta: 83.2 MB). Peak memory consumption was 119.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 30271.48 ms. Allocated memory was 359.7 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 181.0 MB in the beginning and 929.2 MB in the end (delta: -748.2 MB). Peak memory consumption was 254.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L703] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L705] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L707] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L708] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L709] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L711] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L714] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L715] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L716] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L717] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L718] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L719] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L720] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L721] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L722] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L723] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L724] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L725] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t577; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t578; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t579; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L840] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L784] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t580; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L814] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L815] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L816] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L817] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L817] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L848] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L848] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L849] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L849] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L850] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L850] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L851] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L851] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L852] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L852] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 y$flush_delayed = weak$$choice2 [L858] 0 y$mem_tmp = y [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L860] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L860] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L861] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L862] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L862] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L864] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 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: 29.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 444 SDtfs, 657 SDslu, 1813 SDs, 0 SdLazy, 1819 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=12, 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.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1047 ConstructedInterpolants, 0 QuantifiedInterpolants, 345928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...