/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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:28:10,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:28:10,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:28:10,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:28:10,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:28:10,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:28:10,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:28:10,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:28:10,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:28:10,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:28:10,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:28:10,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:28:10,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:28:10,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:28:10,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:28:10,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:28:10,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:28:10,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:28:10,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:28:10,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:28:10,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:28:10,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:28:10,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:28:10,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:28:10,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:28:10,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:28:10,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:28:10,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:28:10,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:28:10,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:28:10,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:28:10,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:28:10,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:28:10,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:28:10,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:28:10,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:28:10,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:28:10,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:28:10,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:28:10,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:28:10,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:28:10,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:28:10,287 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:28:10,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:28:10,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:28:10,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:28:10,289 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:28:10,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:28:10,289 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:28:10,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:28:10,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:28:10,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:28:10,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:28:10,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:28:10,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:28:10,290 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:28:10,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:28:10,291 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:28:10,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:28:10,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:28:10,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:28:10,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:28:10,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:28:10,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:28:10,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:28:10,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:28:10,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:28:10,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:28:10,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:28:10,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:28:10,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:28:10,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:28:10,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:28:10,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:28:10,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:28:10,604 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:28:10,605 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2020-10-16 01:28:10,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac44393c/8abc55b5fe024a24997fd33bd90d8ade/FLAG3a8223370 [2020-10-16 01:28:11,217 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:28:11,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2020-10-16 01:28:11,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac44393c/8abc55b5fe024a24997fd33bd90d8ade/FLAG3a8223370 [2020-10-16 01:28:11,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac44393c/8abc55b5fe024a24997fd33bd90d8ade [2020-10-16 01:28:11,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:28:11,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:28:11,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:28:11,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:28:11,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:28:11,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:28:11" (1/1) ... [2020-10-16 01:28:11,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a114ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:11, skipping insertion in model container [2020-10-16 01:28:11,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:28:11" (1/1) ... [2020-10-16 01:28:11,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:28:11,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:28:11,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:28:12,005 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:28:12,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:28:12,175 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:28:12,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12 WrapperNode [2020-10-16 01:28:12,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:28:12,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:28:12,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:28:12,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:28:12,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:28:12,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:28:12,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:28:12,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:28:12,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... [2020-10-16 01:28:12,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:28:12,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:28:12,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:28:12,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:28:12,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:28:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:28:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:28:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:28:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:28:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:28:12,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:28:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:28:12,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:28:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:28:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:28:12,378 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:28:12,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:28:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:28:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:28:12,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:28:12,382 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:28:14,439 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:28:14,440 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:28:14,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:28:14 BoogieIcfgContainer [2020-10-16 01:28:14,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:28:14,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:28:14,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:28:14,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:28:14,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:28:11" (1/3) ... [2020-10-16 01:28:14,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734e7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:28:14, skipping insertion in model container [2020-10-16 01:28:14,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:28:12" (2/3) ... [2020-10-16 01:28:14,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734e7f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:28:14, skipping insertion in model container [2020-10-16 01:28:14,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:28:14" (3/3) ... [2020-10-16 01:28:14,451 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_tso.oepc.i [2020-10-16 01:28:14,463 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:28:14,471 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:28:14,472 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:28:14,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,505 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,505 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,507 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,507 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,510 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,511 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,511 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,511 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,523 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,523 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,525 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,526 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,527 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:28:14,554 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:28:14,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:28:14,576 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:28:14,577 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:28:14,577 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:28:14,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:28:14,577 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:28:14,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:28:14,577 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:28:14,593 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 01:28:14,643 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 01:28:14,644 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:14,649 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 80 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-16 01:28:14,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 01:28:14,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow [2020-10-16 01:28:14,659 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:28:14,662 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 01:28:14,665 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 01:28:14,666 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 226 flow [2020-10-16 01:28:14,694 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 01:28:14,695 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:14,696 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 77 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-16 01:28:14,700 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 01:28:14,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:14,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:14,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:14,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:14,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:14,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:14,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 01:28:14,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:14,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:14,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:15,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:15,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:15,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:15,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:28:15,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:28:15,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:15,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:28:15,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:28:15,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:28:15,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:15,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:28:15,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:15,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:15,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:15,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:15,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:15,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 01:28:15,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:15,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:15,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:15,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:15,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:16,165 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 01:28:16,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:16,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:16,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:16,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:16,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:16,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:16,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:16,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:16,720 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:28:16,860 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:28:17,072 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:28:17,212 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:28:17,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:28:17,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:17,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-16 01:28:17,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:28:17,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:28:17,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:28:17,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:17,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:17,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:17,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:17,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:17,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:28:17,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:28:17,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:17,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:28:17,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:17,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:17,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:28:17,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:28:17,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:17,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:17,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:17,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:17,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:28:17,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:28:17,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:28:17,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:17,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:28:17,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:18,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:18,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:18,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:18,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:18,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:18,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:18,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:18,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:18,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:18,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:28:18,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:28:18,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:28:18,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:28:18,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:28:19,601 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 01:28:19,738 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 01:28:19,749 INFO L132 LiptonReduction]: Checked pairs total: 6794 [2020-10-16 01:28:19,750 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-16 01:28:19,765 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5108 [2020-10-16 01:28:19,775 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 01:28:19,775 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:19,776 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:19,777 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:19,777 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1430044184, now seen corresponding path program 1 times [2020-10-16 01:28:19,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:19,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069153774] [2020-10-16 01:28:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:20,113 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-16 01:28:20,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069153774] [2020-10-16 01:28:20,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:20,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:28:20,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205084818] [2020-10-16 01:28:20,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:28:20,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:20,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:28:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:28:20,150 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 199 [2020-10-16 01:28:20,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:28:20,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:20,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 199 [2020-10-16 01:28:20,157 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:20,272 INFO L129 PetriNetUnfolder]: 16/70 cut-off events. [2020-10-16 01:28:20,272 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:20,274 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 70 events. 16/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 213 event pairs, 6 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 107. Up to 27 conditions per place. [2020-10-16 01:28:20,276 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 01:28:20,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow [2020-10-16 01:28:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:28:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:28:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2020-10-16 01:28:20,304 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8793969849246231 [2020-10-16 01:28:20,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2020-10-16 01:28:20,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2020-10-16 01:28:20,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:20,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2020-10-16 01:28:20,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:28:20,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:28:20,325 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:28:20,328 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 525 transitions. [2020-10-16 01:28:20,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow [2020-10-16 01:28:20,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:28:20,334 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 01:28:20,339 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 01:28:20,340 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 01:28:20,340 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 01:28:20,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:28:20,342 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:20,342 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:20,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:28:20,343 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:20,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:20,343 INFO L82 PathProgramCache]: Analyzing trace with hash 667622400, now seen corresponding path program 1 times [2020-10-16 01:28:20,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:20,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799830702] [2020-10-16 01:28:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:20,513 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-16 01:28:20,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799830702] [2020-10-16 01:28:20,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:20,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:28:20,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990677427] [2020-10-16 01:28:20,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:28:20,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:28:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:28:20,520 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:20,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 01:28:20,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:20,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:20,522 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:20,628 INFO L129 PetriNetUnfolder]: 12/71 cut-off events. [2020-10-16 01:28:20,628 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:28:20,629 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 71 events. 12/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 226 event pairs, 3 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 108. Up to 20 conditions per place. [2020-10-16 01:28:20,629 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 4 selfloop transitions, 3 changer transitions 8/37 dead transitions. [2020-10-16 01:28:20,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 116 flow [2020-10-16 01:28:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 857 transitions. [2020-10-16 01:28:20,634 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8613065326633166 [2020-10-16 01:28:20,634 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 857 transitions. [2020-10-16 01:28:20,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 857 transitions. [2020-10-16 01:28:20,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:20,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 857 transitions. [2020-10-16 01:28:20,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:20,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:20,641 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:20,641 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 857 transitions. [2020-10-16 01:28:20,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 116 flow [2020-10-16 01:28:20,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:20,643 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 89 flow [2020-10-16 01:28:20,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2020-10-16 01:28:20,644 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 01:28:20,645 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 89 flow [2020-10-16 01:28:20,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:28:20,645 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:20,645 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:20,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:28:20,645 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1745373452, now seen corresponding path program 1 times [2020-10-16 01:28:20,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:20,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514530075] [2020-10-16 01:28:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:20,793 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-16 01:28:20,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514530075] [2020-10-16 01:28:20,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:20,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:28:20,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801305657] [2020-10-16 01:28:20,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:28:20,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:28:20,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:28:20,797 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 01:28:20,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 89 flow. Second operand 4 states. [2020-10-16 01:28:20,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:20,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 01:28:20,799 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:20,851 INFO L129 PetriNetUnfolder]: 7/59 cut-off events. [2020-10-16 01:28:20,852 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-16 01:28:20,852 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 59 events. 7/59 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 169 event pairs, 3 based on Foata normal form. 5/60 useless extension candidates. Maximal degree in co-relation 107. Up to 17 conditions per place. [2020-10-16 01:28:20,853 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 2 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 01:28:20,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 107 flow [2020-10-16 01:28:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2020-10-16 01:28:20,857 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.842211055276382 [2020-10-16 01:28:20,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2020-10-16 01:28:20,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2020-10-16 01:28:20,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:20,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2020-10-16 01:28:20,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:20,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:20,862 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:20,862 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 89 flow. Second operand 5 states and 838 transitions. [2020-10-16 01:28:20,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 107 flow [2020-10-16 01:28:20,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 102 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:20,864 INFO L241 Difference]: Finished difference. Result has 46 places, 29 transitions, 96 flow [2020-10-16 01:28:20,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2020-10-16 01:28:20,865 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2020-10-16 01:28:20,865 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 96 flow [2020-10-16 01:28:20,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:28:20,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:20,865 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:20,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:28:20,866 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash -739666052, now seen corresponding path program 1 times [2020-10-16 01:28:20,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:20,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738284243] [2020-10-16 01:28:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:20,999 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-16 01:28:21,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738284243] [2020-10-16 01:28:21,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:21,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:28:21,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972974195] [2020-10-16 01:28:21,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:28:21,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:28:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:28:21,005 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:21,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 96 flow. Second operand 4 states. [2020-10-16 01:28:21,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:21,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:21,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:21,073 INFO L129 PetriNetUnfolder]: 19/83 cut-off events. [2020-10-16 01:28:21,073 INFO L130 PetriNetUnfolder]: For 100/109 co-relation queries the response was YES. [2020-10-16 01:28:21,075 INFO L80 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 83 events. 19/83 cut-off events. For 100/109 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 295 event pairs, 6 based on Foata normal form. 5/82 useless extension candidates. Maximal degree in co-relation 185. Up to 26 conditions per place. [2020-10-16 01:28:21,076 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 4 selfloop transitions, 3 changer transitions 5/36 dead transitions. [2020-10-16 01:28:21,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 138 flow [2020-10-16 01:28:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2020-10-16 01:28:21,080 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8582914572864322 [2020-10-16 01:28:21,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 854 transitions. [2020-10-16 01:28:21,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 854 transitions. [2020-10-16 01:28:21,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:21,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 854 transitions. [2020-10-16 01:28:21,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:21,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:21,086 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:21,087 INFO L185 Difference]: Start difference. First operand has 46 places, 29 transitions, 96 flow. Second operand 5 states and 854 transitions. [2020-10-16 01:28:21,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 138 flow [2020-10-16 01:28:21,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 130 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:28:21,091 INFO L241 Difference]: Finished difference. Result has 47 places, 31 transitions, 115 flow [2020-10-16 01:28:21,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2020-10-16 01:28:21,091 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2020-10-16 01:28:21,091 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 115 flow [2020-10-16 01:28:21,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:28:21,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:21,092 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:21,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:28:21,092 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1875187583, now seen corresponding path program 1 times [2020-10-16 01:28:21,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:21,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46503656] [2020-10-16 01:28:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:21,224 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-16 01:28:21,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46503656] [2020-10-16 01:28:21,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:21,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:28:21,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288568798] [2020-10-16 01:28:21,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:28:21,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:28:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:28:21,229 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:21,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 115 flow. Second operand 4 states. [2020-10-16 01:28:21,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:21,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:21,230 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:21,305 INFO L129 PetriNetUnfolder]: 11/81 cut-off events. [2020-10-16 01:28:21,305 INFO L130 PetriNetUnfolder]: For 118/169 co-relation queries the response was YES. [2020-10-16 01:28:21,306 INFO L80 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 81 events. 11/81 cut-off events. For 118/169 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 324 event pairs, 2 based on Foata normal form. 6/81 useless extension candidates. Maximal degree in co-relation 210. Up to 23 conditions per place. [2020-10-16 01:28:21,307 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 5 selfloop transitions, 3 changer transitions 2/34 dead transitions. [2020-10-16 01:28:21,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 157 flow [2020-10-16 01:28:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 01:28:21,312 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8552763819095477 [2020-10-16 01:28:21,312 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 01:28:21,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 01:28:21,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:21,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 01:28:21,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:21,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:21,320 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:21,320 INFO L185 Difference]: Start difference. First operand has 47 places, 31 transitions, 115 flow. Second operand 5 states and 851 transitions. [2020-10-16 01:28:21,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 157 flow [2020-10-16 01:28:21,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 146 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:21,323 INFO L241 Difference]: Finished difference. Result has 50 places, 31 transitions, 123 flow [2020-10-16 01:28:21,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2020-10-16 01:28:21,324 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2020-10-16 01:28:21,324 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 123 flow [2020-10-16 01:28:21,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:28:21,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:21,324 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:21,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:28:21,325 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1914313475, now seen corresponding path program 1 times [2020-10-16 01:28:21,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:21,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883834227] [2020-10-16 01:28:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:21,472 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-16 01:28:21,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883834227] [2020-10-16 01:28:21,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:21,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:28:21,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318732940] [2020-10-16 01:28:21,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:28:21,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:21,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:28:21,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:28:21,476 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 199 [2020-10-16 01:28:21,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 123 flow. Second operand 6 states. [2020-10-16 01:28:21,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:21,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 199 [2020-10-16 01:28:21,477 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:21,769 INFO L129 PetriNetUnfolder]: 206/473 cut-off events. [2020-10-16 01:28:21,769 INFO L130 PetriNetUnfolder]: For 1531/1669 co-relation queries the response was YES. [2020-10-16 01:28:21,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 473 events. 206/473 cut-off events. For 1531/1669 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2815 event pairs, 108 based on Foata normal form. 34/472 useless extension candidates. Maximal degree in co-relation 1313. Up to 243 conditions per place. [2020-10-16 01:28:21,776 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 9 selfloop transitions, 8 changer transitions 9/49 dead transitions. [2020-10-16 01:28:21,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 227 flow [2020-10-16 01:28:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:28:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:28:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1221 transitions. [2020-10-16 01:28:21,781 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7669597989949749 [2020-10-16 01:28:21,781 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1221 transitions. [2020-10-16 01:28:21,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1221 transitions. [2020-10-16 01:28:21,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:21,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1221 transitions. [2020-10-16 01:28:21,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:28:21,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:28:21,788 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:28:21,788 INFO L185 Difference]: Start difference. First operand has 50 places, 31 transitions, 123 flow. Second operand 8 states and 1221 transitions. [2020-10-16 01:28:21,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 227 flow [2020-10-16 01:28:21,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 218 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:28:21,794 INFO L241 Difference]: Finished difference. Result has 58 places, 38 transitions, 176 flow [2020-10-16 01:28:21,794 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2020-10-16 01:28:21,794 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2020-10-16 01:28:21,795 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 176 flow [2020-10-16 01:28:21,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:28:21,795 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:21,795 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:21,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:28:21,795 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1502969219, now seen corresponding path program 2 times [2020-10-16 01:28:21,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:21,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314486366] [2020-10-16 01:28:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:21,893 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-16 01:28:21,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314486366] [2020-10-16 01:28:21,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:21,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:28:21,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120019525] [2020-10-16 01:28:21,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:28:21,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:21,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:28:21,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:28:21,897 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 199 [2020-10-16 01:28:21,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 176 flow. Second operand 6 states. [2020-10-16 01:28:21,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:21,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 199 [2020-10-16 01:28:21,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:22,091 INFO L129 PetriNetUnfolder]: 168/409 cut-off events. [2020-10-16 01:28:22,091 INFO L130 PetriNetUnfolder]: For 2081/2179 co-relation queries the response was YES. [2020-10-16 01:28:22,094 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 409 events. 168/409 cut-off events. For 2081/2179 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2414 event pairs, 92 based on Foata normal form. 40/420 useless extension candidates. Maximal degree in co-relation 1455. Up to 216 conditions per place. [2020-10-16 01:28:22,098 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 11 selfloop transitions, 9 changer transitions 6/49 dead transitions. [2020-10-16 01:28:22,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 284 flow [2020-10-16 01:28:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:28:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:28:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 916 transitions. [2020-10-16 01:28:22,102 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7671691792294807 [2020-10-16 01:28:22,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 916 transitions. [2020-10-16 01:28:22,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 916 transitions. [2020-10-16 01:28:22,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:22,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 916 transitions. [2020-10-16 01:28:22,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:28:22,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:28:22,108 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:28:22,108 INFO L185 Difference]: Start difference. First operand has 58 places, 38 transitions, 176 flow. Second operand 6 states and 916 transitions. [2020-10-16 01:28:22,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 284 flow [2020-10-16 01:28:22,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 280 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:22,113 INFO L241 Difference]: Finished difference. Result has 62 places, 42 transitions, 231 flow [2020-10-16 01:28:22,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2020-10-16 01:28:22,113 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2020-10-16 01:28:22,113 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 231 flow [2020-10-16 01:28:22,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:28:22,114 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:22,114 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:22,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:28:22,114 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:22,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1756456555, now seen corresponding path program 1 times [2020-10-16 01:28:22,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:22,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338688159] [2020-10-16 01:28:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:22,237 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-16 01:28:22,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338688159] [2020-10-16 01:28:22,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:22,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:28:22,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401192973] [2020-10-16 01:28:22,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:28:22,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:22,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:28:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:28:22,241 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 199 [2020-10-16 01:28:22,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 231 flow. Second operand 7 states. [2020-10-16 01:28:22,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:22,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 199 [2020-10-16 01:28:22,242 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:22,496 INFO L129 PetriNetUnfolder]: 143/379 cut-off events. [2020-10-16 01:28:22,496 INFO L130 PetriNetUnfolder]: For 2121/2206 co-relation queries the response was YES. [2020-10-16 01:28:22,500 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 379 events. 143/379 cut-off events. For 2121/2206 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2272 event pairs, 21 based on Foata normal form. 40/393 useless extension candidates. Maximal degree in co-relation 1497. Up to 143 conditions per place. [2020-10-16 01:28:22,503 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 12 selfloop transitions, 14 changer transitions 5/54 dead transitions. [2020-10-16 01:28:22,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 375 flow [2020-10-16 01:28:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:28:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:28:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1067 transitions. [2020-10-16 01:28:22,507 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7659727207465901 [2020-10-16 01:28:22,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1067 transitions. [2020-10-16 01:28:22,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1067 transitions. [2020-10-16 01:28:22,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:22,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1067 transitions. [2020-10-16 01:28:22,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:28:22,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:28:22,513 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:28:22,514 INFO L185 Difference]: Start difference. First operand has 62 places, 42 transitions, 231 flow. Second operand 7 states and 1067 transitions. [2020-10-16 01:28:22,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 375 flow [2020-10-16 01:28:22,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 366 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:22,519 INFO L241 Difference]: Finished difference. Result has 67 places, 46 transitions, 300 flow [2020-10-16 01:28:22,519 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2020-10-16 01:28:22,519 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2020-10-16 01:28:22,520 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 300 flow [2020-10-16 01:28:22,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:28:22,520 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:22,520 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:22,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:28:22,520 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:22,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -235873704, now seen corresponding path program 1 times [2020-10-16 01:28:22,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:22,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391435701] [2020-10-16 01:28:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:22,669 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-16 01:28:22,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391435701] [2020-10-16 01:28:22,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:22,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:28:22,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137395742] [2020-10-16 01:28:22,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:28:22,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:28:22,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:28:22,672 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2020-10-16 01:28:22,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 300 flow. Second operand 8 states. [2020-10-16 01:28:22,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:22,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2020-10-16 01:28:22,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:22,931 INFO L129 PetriNetUnfolder]: 112/310 cut-off events. [2020-10-16 01:28:22,931 INFO L130 PetriNetUnfolder]: For 1634/1718 co-relation queries the response was YES. [2020-10-16 01:28:22,935 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 310 events. 112/310 cut-off events. For 1634/1718 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1714 event pairs, 19 based on Foata normal form. 27/314 useless extension candidates. Maximal degree in co-relation 1310. Up to 105 conditions per place. [2020-10-16 01:28:22,939 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 13 selfloop transitions, 12 changer transitions 2/50 dead transitions. [2020-10-16 01:28:22,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 50 transitions, 390 flow [2020-10-16 01:28:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:28:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:28:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1021 transitions. [2020-10-16 01:28:22,944 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7329504666188084 [2020-10-16 01:28:22,944 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1021 transitions. [2020-10-16 01:28:22,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1021 transitions. [2020-10-16 01:28:22,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:22,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1021 transitions. [2020-10-16 01:28:22,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:28:22,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:28:22,951 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:28:22,951 INFO L185 Difference]: Start difference. First operand has 67 places, 46 transitions, 300 flow. Second operand 7 states and 1021 transitions. [2020-10-16 01:28:22,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 50 transitions, 390 flow [2020-10-16 01:28:22,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 50 transitions, 360 flow, removed 15 selfloop flow, removed 2 redundant places. [2020-10-16 01:28:22,958 INFO L241 Difference]: Finished difference. Result has 72 places, 46 transitions, 317 flow [2020-10-16 01:28:22,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2020-10-16 01:28:22,959 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2020-10-16 01:28:22,959 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 317 flow [2020-10-16 01:28:22,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:28:22,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:22,960 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:22,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:28:22,960 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash -252764582, now seen corresponding path program 1 times [2020-10-16 01:28:22,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:22,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192522768] [2020-10-16 01:28:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:23,093 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-16 01:28:23,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192522768] [2020-10-16 01:28:23,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:23,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:28:23,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848412296] [2020-10-16 01:28:23,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:28:23,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:28:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:28:23,098 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:23,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 46 transitions, 317 flow. Second operand 4 states. [2020-10-16 01:28:23,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:23,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:23,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:23,400 INFO L129 PetriNetUnfolder]: 643/1334 cut-off events. [2020-10-16 01:28:23,400 INFO L130 PetriNetUnfolder]: For 4555/4748 co-relation queries the response was YES. [2020-10-16 01:28:23,412 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 1334 events. 643/1334 cut-off events. For 4555/4748 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 9794 event pairs, 273 based on Foata normal form. 104/1241 useless extension candidates. Maximal degree in co-relation 4416. Up to 632 conditions per place. [2020-10-16 01:28:23,422 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 11 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2020-10-16 01:28:23,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 59 transitions, 385 flow [2020-10-16 01:28:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2020-10-16 01:28:23,426 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8663316582914573 [2020-10-16 01:28:23,426 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2020-10-16 01:28:23,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2020-10-16 01:28:23,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:23,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2020-10-16 01:28:23,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:23,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:23,430 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:23,431 INFO L185 Difference]: Start difference. First operand has 72 places, 46 transitions, 317 flow. Second operand 5 states and 862 transitions. [2020-10-16 01:28:23,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 59 transitions, 385 flow [2020-10-16 01:28:23,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 59 transitions, 350 flow, removed 5 selfloop flow, removed 7 redundant places. [2020-10-16 01:28:23,439 INFO L241 Difference]: Finished difference. Result has 70 places, 55 transitions, 361 flow [2020-10-16 01:28:23,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2020-10-16 01:28:23,439 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2020-10-16 01:28:23,439 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 361 flow [2020-10-16 01:28:23,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:28:23,440 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:23,440 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:28:23,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:28:23,440 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1613558153, now seen corresponding path program 1 times [2020-10-16 01:28:23,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:23,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105641936] [2020-10-16 01:28:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:23,526 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-16 01:28:23,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105641936] [2020-10-16 01:28:23,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:23,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:28:23,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440993189] [2020-10-16 01:28:23,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:28:23,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:23,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:28:23,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:28:23,530 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:23,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 361 flow. Second operand 5 states. [2020-10-16 01:28:23,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:23,531 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:23,531 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:23,768 INFO L129 PetriNetUnfolder]: 417/936 cut-off events. [2020-10-16 01:28:23,769 INFO L130 PetriNetUnfolder]: For 2532/5183 co-relation queries the response was YES. [2020-10-16 01:28:23,777 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3753 conditions, 936 events. 417/936 cut-off events. For 2532/5183 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 6611 event pairs, 76 based on Foata normal form. 246/1035 useless extension candidates. Maximal degree in co-relation 3721. Up to 588 conditions per place. [2020-10-16 01:28:23,784 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 11 selfloop transitions, 19 changer transitions 0/68 dead transitions. [2020-10-16 01:28:23,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 68 transitions, 497 flow [2020-10-16 01:28:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:28:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:28:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions. [2020-10-16 01:28:23,788 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8664752333094041 [2020-10-16 01:28:23,788 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1207 transitions. [2020-10-16 01:28:23,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1207 transitions. [2020-10-16 01:28:23,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:23,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1207 transitions. [2020-10-16 01:28:23,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:28:23,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:28:23,795 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:28:23,795 INFO L185 Difference]: Start difference. First operand has 70 places, 55 transitions, 361 flow. Second operand 7 states and 1207 transitions. [2020-10-16 01:28:23,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 68 transitions, 497 flow [2020-10-16 01:28:23,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:28:23,803 INFO L241 Difference]: Finished difference. Result has 78 places, 64 transitions, 494 flow [2020-10-16 01:28:23,803 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2020-10-16 01:28:23,803 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2020-10-16 01:28:23,803 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 494 flow [2020-10-16 01:28:23,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:28:23,804 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:23,804 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] [2020-10-16 01:28:23,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:28:23,804 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1020135146, now seen corresponding path program 1 times [2020-10-16 01:28:23,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:23,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349174953] [2020-10-16 01:28:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:23,881 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-16 01:28:23,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349174953] [2020-10-16 01:28:23,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:23,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:28:23,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730233033] [2020-10-16 01:28:23,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:28:23,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:23,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:28:23,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:28:23,884 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2020-10-16 01:28:23,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 494 flow. Second operand 5 states. [2020-10-16 01:28:23,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:23,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2020-10-16 01:28:23,885 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:24,305 INFO L129 PetriNetUnfolder]: 871/1806 cut-off events. [2020-10-16 01:28:24,305 INFO L130 PetriNetUnfolder]: For 7615/12452 co-relation queries the response was YES. [2020-10-16 01:28:24,320 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8638 conditions, 1806 events. 871/1806 cut-off events. For 7615/12452 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 14055 event pairs, 132 based on Foata normal form. 66/1615 useless extension candidates. Maximal degree in co-relation 8602. Up to 1230 conditions per place. [2020-10-16 01:28:24,332 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 6 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2020-10-16 01:28:24,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 68 transitions, 550 flow [2020-10-16 01:28:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2020-10-16 01:28:24,335 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8291457286432161 [2020-10-16 01:28:24,335 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2020-10-16 01:28:24,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2020-10-16 01:28:24,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:24,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2020-10-16 01:28:24,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:24,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:24,340 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:24,340 INFO L185 Difference]: Start difference. First operand has 78 places, 64 transitions, 494 flow. Second operand 5 states and 825 transitions. [2020-10-16 01:28:24,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 68 transitions, 550 flow [2020-10-16 01:28:24,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 500 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 01:28:24,375 INFO L241 Difference]: Finished difference. Result has 82 places, 64 transitions, 461 flow [2020-10-16 01:28:24,375 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2020-10-16 01:28:24,376 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2020-10-16 01:28:24,376 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 461 flow [2020-10-16 01:28:24,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:28:24,376 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:24,379 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] [2020-10-16 01:28:24,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:28:24,379 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash -582631258, now seen corresponding path program 2 times [2020-10-16 01:28:24,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:24,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057240229] [2020-10-16 01:28:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:24,442 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-16 01:28:24,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057240229] [2020-10-16 01:28:24,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:24,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:28:24,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367148564] [2020-10-16 01:28:24,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:28:24,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:28:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:28:24,445 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:24,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 461 flow. Second operand 4 states. [2020-10-16 01:28:24,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:24,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:24,446 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:24,887 INFO L129 PetriNetUnfolder]: 1208/2580 cut-off events. [2020-10-16 01:28:24,887 INFO L130 PetriNetUnfolder]: For 13055/15225 co-relation queries the response was YES. [2020-10-16 01:28:24,910 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11513 conditions, 2580 events. 1208/2580 cut-off events. For 13055/15225 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 22369 event pairs, 207 based on Foata normal form. 79/2264 useless extension candidates. Maximal degree in co-relation 11475. Up to 1628 conditions per place. [2020-10-16 01:28:24,923 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 6 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2020-10-16 01:28:24,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 68 transitions, 535 flow [2020-10-16 01:28:24,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:28:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:28:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 01:28:24,926 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8552763819095477 [2020-10-16 01:28:24,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 01:28:24,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 01:28:24,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:24,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 01:28:24,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:28:24,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:28:24,932 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:28:24,932 INFO L185 Difference]: Start difference. First operand has 82 places, 64 transitions, 461 flow. Second operand 5 states and 851 transitions. [2020-10-16 01:28:24,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 68 transitions, 535 flow [2020-10-16 01:28:24,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 68 transitions, 526 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 01:28:24,976 INFO L241 Difference]: Finished difference. Result has 88 places, 67 transitions, 521 flow [2020-10-16 01:28:24,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2020-10-16 01:28:24,976 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2020-10-16 01:28:24,976 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 521 flow [2020-10-16 01:28:24,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:28:24,976 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:24,976 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] [2020-10-16 01:28:24,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:28:24,977 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:24,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1883966050, now seen corresponding path program 1 times [2020-10-16 01:28:24,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:24,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361783445] [2020-10-16 01:28:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:25,095 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-16 01:28:25,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361783445] [2020-10-16 01:28:25,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:25,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:28:25,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726633221] [2020-10-16 01:28:25,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:28:25,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:25,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:28:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:28:25,098 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:25,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 521 flow. Second operand 6 states. [2020-10-16 01:28:25,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:25,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:25,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:25,545 INFO L129 PetriNetUnfolder]: 906/1936 cut-off events. [2020-10-16 01:28:25,546 INFO L130 PetriNetUnfolder]: For 10434/19008 co-relation queries the response was YES. [2020-10-16 01:28:25,568 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9728 conditions, 1936 events. 906/1936 cut-off events. For 10434/19008 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 16074 event pairs, 22 based on Foata normal form. 861/2467 useless extension candidates. Maximal degree in co-relation 9687. Up to 1288 conditions per place. [2020-10-16 01:28:25,580 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 28 changer transitions 6/77 dead transitions. [2020-10-16 01:28:25,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 77 transitions, 688 flow [2020-10-16 01:28:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:28:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:28:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1552 transitions. [2020-10-16 01:28:25,585 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8665549972082636 [2020-10-16 01:28:25,586 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1552 transitions. [2020-10-16 01:28:25,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1552 transitions. [2020-10-16 01:28:25,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:25,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1552 transitions. [2020-10-16 01:28:25,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:28:25,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:28:25,594 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:28:25,595 INFO L185 Difference]: Start difference. First operand has 88 places, 67 transitions, 521 flow. Second operand 9 states and 1552 transitions. [2020-10-16 01:28:25,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 77 transitions, 688 flow [2020-10-16 01:28:25,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 77 transitions, 658 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-16 01:28:25,624 INFO L241 Difference]: Finished difference. Result has 94 places, 71 transitions, 610 flow [2020-10-16 01:28:25,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=610, PETRI_PLACES=94, PETRI_TRANSITIONS=71} [2020-10-16 01:28:25,625 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2020-10-16 01:28:25,625 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 71 transitions, 610 flow [2020-10-16 01:28:25,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:28:25,625 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:25,625 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] [2020-10-16 01:28:25,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:28:25,625 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash 644571964, now seen corresponding path program 1 times [2020-10-16 01:28:25,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:25,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108084602] [2020-10-16 01:28:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:28:25,726 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-16 01:28:25,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108084602] [2020-10-16 01:28:25,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:28:25,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:28:25,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226645864] [2020-10-16 01:28:25,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:28:25,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:28:25,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:28:25,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:28:25,730 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:28:25,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 71 transitions, 610 flow. Second operand 7 states. [2020-10-16 01:28:25,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:28:25,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:28:25,731 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:28:26,144 INFO L129 PetriNetUnfolder]: 783/1667 cut-off events. [2020-10-16 01:28:26,144 INFO L130 PetriNetUnfolder]: For 12161/20387 co-relation queries the response was YES. [2020-10-16 01:28:26,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10268 conditions, 1667 events. 783/1667 cut-off events. For 12161/20387 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 13703 event pairs, 0 based on Foata normal form. 804/2145 useless extension candidates. Maximal degree in co-relation 10230. Up to 1097 conditions per place. [2020-10-16 01:28:26,172 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 30 changer transitions 18/76 dead transitions. [2020-10-16 01:28:26,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 76 transitions, 744 flow [2020-10-16 01:28:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:28:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:28:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1889 transitions. [2020-10-16 01:28:26,178 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8629511192325263 [2020-10-16 01:28:26,178 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1889 transitions. [2020-10-16 01:28:26,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1889 transitions. [2020-10-16 01:28:26,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:28:26,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1889 transitions. [2020-10-16 01:28:26,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:28:26,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:28:26,188 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:28:26,188 INFO L185 Difference]: Start difference. First operand has 94 places, 71 transitions, 610 flow. Second operand 11 states and 1889 transitions. [2020-10-16 01:28:26,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 76 transitions, 744 flow [2020-10-16 01:28:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 76 transitions, 595 flow, removed 55 selfloop flow, removed 11 redundant places. [2020-10-16 01:28:26,323 INFO L241 Difference]: Finished difference. Result has 95 places, 58 transitions, 451 flow [2020-10-16 01:28:26,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=451, PETRI_PLACES=95, PETRI_TRANSITIONS=58} [2020-10-16 01:28:26,324 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2020-10-16 01:28:26,324 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 58 transitions, 451 flow [2020-10-16 01:28:26,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:28:26,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:28:26,324 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] [2020-10-16 01:28:26,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:28:26,325 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:28:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:28:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1261354147, now seen corresponding path program 1 times [2020-10-16 01:28:26,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:28:26,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138490645] [2020-10-16 01:28:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:28:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:28:26,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:28:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:28:26,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:28:26,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:28:26,441 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:28:26,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:28:26,467 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-16 01:28:26,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:26,469 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-16 01:28:26,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:26,470 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-16 01:28:26,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:26,470 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-16 01:28:26,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:26,470 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-16 01:28:26,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28: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-16 01:28:26,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:28:26,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:28:26 BasicIcfg [2020-10-16 01:28:26,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:28:26,558 INFO L168 Benchmark]: Toolchain (without parser) took 15132.12 ms. Allocated memory was 250.6 MB in the beginning and 686.8 MB in the end (delta: 436.2 MB). Free memory was 206.1 MB in the beginning and 315.2 MB in the end (delta: -109.1 MB). Peak memory consumption was 327.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:26,558 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:28:26,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.57 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 206.1 MB in the beginning and 264.0 MB in the end (delta: -57.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:26,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.50 ms. Allocated memory is still 312.0 MB. Free memory was 264.0 MB in the beginning and 261.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:26,560 INFO L168 Benchmark]: Boogie Preprocessor took 40.96 ms. Allocated memory is still 312.0 MB. Free memory was 261.5 MB in the beginning and 259.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:26,561 INFO L168 Benchmark]: RCFGBuilder took 2153.73 ms. Allocated memory was 312.0 MB in the beginning and 356.5 MB in the end (delta: 44.6 MB). Free memory was 259.0 MB in the beginning and 204.5 MB in the end (delta: 54.5 MB). Peak memory consumption was 101.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:26,562 INFO L168 Benchmark]: TraceAbstraction took 12112.63 ms. Allocated memory was 356.5 MB in the beginning and 686.8 MB in the end (delta: 330.3 MB). Free memory was 204.5 MB in the beginning and 315.2 MB in the end (delta: -110.7 MB). Peak memory consumption was 219.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:28:26,565 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.50 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 748.57 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 206.1 MB in the beginning and 264.0 MB in the end (delta: -57.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.50 ms. Allocated memory is still 312.0 MB. Free memory was 264.0 MB in the beginning and 261.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.96 ms. Allocated memory is still 312.0 MB. Free memory was 261.5 MB in the beginning and 259.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2153.73 ms. Allocated memory was 312.0 MB in the beginning and 356.5 MB in the end (delta: 44.6 MB). Free memory was 259.0 MB in the beginning and 204.5 MB in the end (delta: 54.5 MB). Peak memory consumption was 101.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12112.63 ms. Allocated memory was 356.5 MB in the beginning and 686.8 MB in the end (delta: 330.3 MB). Free memory was 204.5 MB in the beginning and 315.2 MB in the end (delta: -110.7 MB). Peak memory consumption was 219.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1640 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 209 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.0s, 118 PlacesBefore, 42 PlacesAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 6794 MoverChecksTotal - 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; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L707] 0 int b = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L715] 0 int z = 0; [L716] 0 _Bool z$flush_delayed; [L717] 0 int z$mem_tmp; [L718] 0 _Bool z$r_buff0_thd0; [L719] 0 _Bool z$r_buff0_thd1; [L720] 0 _Bool z$r_buff0_thd2; [L721] 0 _Bool z$r_buff0_thd3; [L722] 0 _Bool z$r_buff0_thd4; [L723] 0 _Bool z$r_buff1_thd0; [L724] 0 _Bool z$r_buff1_thd1; [L725] 0 _Bool z$r_buff1_thd2; [L726] 0 _Bool z$r_buff1_thd3; [L727] 0 _Bool z$r_buff1_thd4; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1273; [L834] FCALL, FORK 0 pthread_create(&t1273, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1274; [L836] FCALL, FORK 0 pthread_create(&t1274, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1275; [L838] FCALL, FORK 0 pthread_create(&t1275, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1276; [L840] FCALL, FORK 0 pthread_create(&t1276, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$w_buff1 = z$w_buff0 [L790] 4 z$w_buff0 = 2 [L791] 4 z$w_buff1_used = z$w_buff0_used [L792] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L794] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L795] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L796] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L797] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L798] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L799] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 a = 1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 y = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 3 y = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L775] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L778] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L779] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L782] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 3 return 0; [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 z$flush_delayed = weak$$choice2 [L856] 0 z$mem_tmp = z [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L862] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L865] 0 z = z$flush_delayed ? z$mem_tmp : z [L866] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 11.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 72 SDtfs, 60 SDslu, 62 SDs, 0 SdLazy, 379 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=14, 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.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 21789 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...