/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:52:03,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:52:03,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:52:03,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:52:03,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:52:03,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:52:03,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:52:03,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:52:03,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:52:03,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:52:03,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:52:03,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:52:03,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:52:03,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:52:03,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:52:03,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:52:03,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:52:03,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:52:03,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:52:03,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:52:03,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:52:03,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:52:03,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:52:03,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:52:04,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:52:04,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:52:04,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:52:04,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:52:04,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:52:04,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:52:04,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:52:04,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:52:04,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:52:04,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:52:04,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:52:04,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:52:04,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:52:04,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:52:04,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:52:04,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:52:04,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:52:04,022 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-SemanticLooper.epf [2020-10-16 04:52:04,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:52:04,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:52:04,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:52:04,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:52:04,062 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:52:04,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:52:04,063 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:52:04,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:52:04,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:52:04,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:52:04,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:52:04,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:52:04,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:52:04,065 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:52:04,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:52:04,065 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:52:04,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:52:04,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:52:04,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:52:04,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:52:04,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:52:04,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:52:04,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:52:04,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:52:04,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:52:04,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:52:04,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:52:04,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:52:04,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:52:04,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:52:04,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:52:04,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:52:04,383 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:52:04,383 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:52:04,384 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-16 04:52:04,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877736e57/41fbc75640ef476daf13d2ab66c00ad7/FLAG080fc6e46 [2020-10-16 04:52:05,013 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:52:05,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-16 04:52:05,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877736e57/41fbc75640ef476daf13d2ab66c00ad7/FLAG080fc6e46 [2020-10-16 04:52:05,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877736e57/41fbc75640ef476daf13d2ab66c00ad7 [2020-10-16 04:52:05,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:52:05,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:52:05,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:52:05,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:52:05,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:52:05,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:52:05" (1/1) ... [2020-10-16 04:52:05,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129921e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:05, skipping insertion in model container [2020-10-16 04:52:05,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:52:05" (1/1) ... [2020-10-16 04:52:05,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:52:05,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:52:06,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:52:06,030 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:52:06,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:52:06,234 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:52:06,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06 WrapperNode [2020-10-16 04:52:06,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:52:06,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:52:06,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:52:06,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:52:06,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:52:06,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:52:06,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:52:06,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:52:06,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (1/1) ... [2020-10-16 04:52:06,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:52:06,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:52:06,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:52:06,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:52:06,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (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 04:52:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:52:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:52:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:52:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:52:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:52:06,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:52:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:52:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:52:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:52:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:52:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:52:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:52:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:52:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:52:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:52:06,475 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 04:52:08,331 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:52:08,331 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:52:08,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:52:08 BoogieIcfgContainer [2020-10-16 04:52:08,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:52:08,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:52:08,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:52:08,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:52:08,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:52:05" (1/3) ... [2020-10-16 04:52:08,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9f1335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:52:08, skipping insertion in model container [2020-10-16 04:52:08,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:06" (2/3) ... [2020-10-16 04:52:08,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9f1335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:52:08, skipping insertion in model container [2020-10-16 04:52:08,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:52:08" (3/3) ... [2020-10-16 04:52:08,342 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2020-10-16 04:52:08,353 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:52:08,360 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:52:08,361 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:52:08,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,395 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,395 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,396 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,396 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,402 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,402 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,410 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,410 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,412 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,412 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,414 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,416 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,416 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:08,433 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:52:08,454 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:52:08,454 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:52:08,454 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:52:08,454 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:52:08,454 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:52:08,454 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:52:08,455 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:52:08,455 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:52:08,470 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:52:08,520 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:52:08,520 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:08,526 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:52:08,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:52:08,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2020-10-16 04:52:08,536 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:52:08,541 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:52:08,544 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:52:08,545 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2020-10-16 04:52:08,573 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:52:08,573 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:08,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:52:08,579 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 04:52:08,868 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 04:52:09,297 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:52:09,421 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:52:09,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:09,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:09,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:09,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:09,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:09,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:09,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 04:52:09,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:09,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:09,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:09,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:09,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:09,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:09,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:52:09,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:09,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:09,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:09,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:09,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:09,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,802 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 04:52:09,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:09,805 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 04:52:09,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:09,808 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 04:52:09,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:09,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:09,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,814 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 04:52:09,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,817 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 04:52:09,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:09,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:09,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:09,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:09,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:09,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:10,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:10,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:10,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:10,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:10,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:10,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:10,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:10,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,130 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 04:52:10,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:10,132 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 04:52:10,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:10,135 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 04:52:10,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:10,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:10,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,141 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 04:52:10,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,143 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 04:52:10,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:10,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:10,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:10,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:10,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:52:10,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:10,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:11,404 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-16 04:52:11,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-16 04:52:11,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:11,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:11,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,627 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-16 04:52:12,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:12,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:12,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:12,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:12,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 04:52:12,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:12,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:12,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:12,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:12,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:12,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,743 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 04:52:12,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:12,746 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 04:52:12,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:12,749 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 04:52:12,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:12,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:12,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,754 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 04:52:12,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,756 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 04:52:12,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:12,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:12,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:12,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:52:12,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:52:12,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:12,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:12,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:12,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:12,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:12,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:12,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:12,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:52:13,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:52:13,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:13,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:13,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:13,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:13,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:13,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:52:13,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,558 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:52:13,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:13,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:52:13,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:13,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:13,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:13,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:13,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:13,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:13,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:13,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:14,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:52:14,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:14,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:14,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:52:14,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:14,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:14,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:14,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:14,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:52:14,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:14,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:14,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:14,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:14,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:14,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:14,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:14,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:14,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:14,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:52:14,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:14,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:14,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:14,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:52:14,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:15,777 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-16 04:52:16,121 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 04:52:16,783 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-16 04:52:17,082 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-16 04:52:17,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:17,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:17,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:17,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:17,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:17,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:17,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:17,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:17,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:17,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:17,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:17,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:17,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:17,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:17,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:17,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:18,229 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-16 04:52:18,598 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 04:52:18,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:18,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:18,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:18,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:18,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:18,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:18,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:18,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:52:18,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:18,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:18,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:18,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:52:18,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:52:18,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:18,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:52:18,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:52:19,108 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-16 04:52:19,238 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 04:52:19,246 INFO L132 LiptonReduction]: Checked pairs total: 6449 [2020-10-16 04:52:19,246 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 04:52:19,249 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10715 [2020-10-16 04:52:19,256 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2020-10-16 04:52:19,257 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:19,257 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:19,258 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:19,258 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 04:52:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash 445514123, now seen corresponding path program 1 times [2020-10-16 04:52:19,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:19,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278662670] [2020-10-16 04:52:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:19,542 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 04:52:19,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278662670] [2020-10-16 04:52:19,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:19,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:52:19,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123351469] [2020-10-16 04:52:19,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:52:19,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:52:19,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:52:19,581 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 201 [2020-10-16 04:52:19,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states. [2020-10-16 04:52:19,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:19,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 201 [2020-10-16 04:52:19,590 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:19,697 INFO L129 PetriNetUnfolder]: 23/89 cut-off events. [2020-10-16 04:52:19,697 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:19,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 89 events. 23/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 326 event pairs, 3 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2020-10-16 04:52:19,700 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 7 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 04:52:19,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 96 flow [2020-10-16 04:52:19,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:52:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:52:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2020-10-16 04:52:19,718 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8706467661691543 [2020-10-16 04:52:19,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2020-10-16 04:52:19,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2020-10-16 04:52:19,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:19,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2020-10-16 04:52:19,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:52:19,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:52:19,738 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:52:19,740 INFO L185 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 525 transitions. [2020-10-16 04:52:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 96 flow [2020-10-16 04:52:19,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:19,749 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2020-10-16 04:52:19,752 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 04:52:19,753 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 04:52:19,753 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2020-10-16 04:52:19,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:52:19,753 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:19,753 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:19,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:52:19,754 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 04:52:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1357577055, now seen corresponding path program 1 times [2020-10-16 04:52:19,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:19,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539822880] [2020-10-16 04:52:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:19,876 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 04:52:19,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539822880] [2020-10-16 04:52:19,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:19,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:52:19,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954994148] [2020-10-16 04:52:19,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:52:19,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:52:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:52:19,887 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 201 [2020-10-16 04:52:19,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states. [2020-10-16 04:52:19,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:19,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 201 [2020-10-16 04:52:19,888 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:19,903 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2020-10-16 04:52:19,903 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:19,904 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 04:52:19,904 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 04:52:19,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 70 flow [2020-10-16 04:52:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:52:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:52:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2020-10-16 04:52:19,907 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8922056384742952 [2020-10-16 04:52:19,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2020-10-16 04:52:19,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2020-10-16 04:52:19,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:19,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2020-10-16 04:52:19,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:52:19,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:52:19,912 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:52:19,912 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 538 transitions. [2020-10-16 04:52:19,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 70 flow [2020-10-16 04:52:19,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:19,913 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 68 flow [2020-10-16 04:52:19,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 04:52:19,914 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 04:52:19,914 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 68 flow [2020-10-16 04:52:19,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:52:19,915 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:19,915 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:19,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:52:19,915 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 04:52:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:19,916 INFO L82 PathProgramCache]: Analyzing trace with hash 990818122, now seen corresponding path program 1 times [2020-10-16 04:52:19,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:19,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864036470] [2020-10-16 04:52:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:20,024 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 04:52:20,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864036470] [2020-10-16 04:52:20,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:20,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:52:20,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418831891] [2020-10-16 04:52:20,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:52:20,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:52:20,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:52:20,029 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 201 [2020-10-16 04:52:20,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 68 flow. Second operand 3 states. [2020-10-16 04:52:20,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:20,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 201 [2020-10-16 04:52:20,030 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:20,053 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2020-10-16 04:52:20,054 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 04:52:20,054 INFO L80 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 38 events. 3/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2020-10-16 04:52:20,055 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2020-10-16 04:52:20,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 84 flow [2020-10-16 04:52:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:52:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:52:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2020-10-16 04:52:20,058 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8971807628524047 [2020-10-16 04:52:20,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2020-10-16 04:52:20,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2020-10-16 04:52:20,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:20,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2020-10-16 04:52:20,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:52:20,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:52:20,062 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:52:20,062 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 68 flow. Second operand 3 states and 541 transitions. [2020-10-16 04:52:20,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 84 flow [2020-10-16 04:52:20,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:20,063 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 83 flow [2020-10-16 04:52:20,064 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 04:52:20,064 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2020-10-16 04:52:20,064 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 83 flow [2020-10-16 04:52:20,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:52:20,064 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:20,064 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:20,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:52:20,065 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 04:52:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash 650589956, now seen corresponding path program 1 times [2020-10-16 04:52:20,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:20,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346335048] [2020-10-16 04:52:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:20,177 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 04:52:20,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346335048] [2020-10-16 04:52:20,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:20,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:20,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997317283] [2020-10-16 04:52:20,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:20,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:20,181 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201 [2020-10-16 04:52:20,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 83 flow. Second operand 5 states. [2020-10-16 04:52:20,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:20,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201 [2020-10-16 04:52:20,182 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:20,298 INFO L129 PetriNetUnfolder]: 47/138 cut-off events. [2020-10-16 04:52:20,298 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2020-10-16 04:52:20,300 INFO L80 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 138 events. 47/138 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 589 event pairs, 17 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 266. Up to 77 conditions per place. [2020-10-16 04:52:20,301 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 8 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2020-10-16 04:52:20,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 121 flow [2020-10-16 04:52:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:52:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:52:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2020-10-16 04:52:20,306 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8034825870646766 [2020-10-16 04:52:20,306 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2020-10-16 04:52:20,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2020-10-16 04:52:20,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:20,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2020-10-16 04:52:20,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:52:20,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:52:20,310 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:52:20,310 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 83 flow. Second operand 4 states and 646 transitions. [2020-10-16 04:52:20,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 121 flow [2020-10-16 04:52:20,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:20,313 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 112 flow [2020-10-16 04:52:20,313 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2020-10-16 04:52:20,313 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2020-10-16 04:52:20,313 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 112 flow [2020-10-16 04:52:20,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:20,314 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:20,314 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:20,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:52:20,314 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 04:52:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:20,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1549297656, now seen corresponding path program 1 times [2020-10-16 04:52:20,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:20,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224201577] [2020-10-16 04:52:20,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:20,397 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 04:52:20,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224201577] [2020-10-16 04:52:20,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:20,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:20,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884424293] [2020-10-16 04:52:20,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:20,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:20,401 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 201 [2020-10-16 04:52:20,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 112 flow. Second operand 5 states. [2020-10-16 04:52:20,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:20,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 201 [2020-10-16 04:52:20,402 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:20,511 INFO L129 PetriNetUnfolder]: 63/172 cut-off events. [2020-10-16 04:52:20,512 INFO L130 PetriNetUnfolder]: For 109/115 co-relation queries the response was YES. [2020-10-16 04:52:20,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 172 events. 63/172 cut-off events. For 109/115 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 796 event pairs, 13 based on Foata normal form. 8/171 useless extension candidates. Maximal degree in co-relation 411. Up to 91 conditions per place. [2020-10-16 04:52:20,515 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 8 selfloop transitions, 11 changer transitions 0/40 dead transitions. [2020-10-16 04:52:20,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 178 flow [2020-10-16 04:52:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2020-10-16 04:52:20,519 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8169154228855722 [2020-10-16 04:52:20,519 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2020-10-16 04:52:20,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2020-10-16 04:52:20,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:20,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2020-10-16 04:52:20,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:20,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:20,525 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:20,525 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 112 flow. Second operand 5 states and 821 transitions. [2020-10-16 04:52:20,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 178 flow [2020-10-16 04:52:20,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:52:20,528 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 183 flow [2020-10-16 04:52:20,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2020-10-16 04:52:20,529 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2020-10-16 04:52:20,529 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 183 flow [2020-10-16 04:52:20,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:20,529 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:20,529 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:20,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:52:20,530 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 04:52:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:20,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1531352376, now seen corresponding path program 2 times [2020-10-16 04:52:20,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:20,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520932822] [2020-10-16 04:52:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:20,619 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 04:52:20,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520932822] [2020-10-16 04:52:20,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:20,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:20,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195573267] [2020-10-16 04:52:20,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:20,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:20,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:20,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:20,624 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 201 [2020-10-16 04:52:20,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 183 flow. Second operand 5 states. [2020-10-16 04:52:20,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:20,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 201 [2020-10-16 04:52:20,626 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:20,769 INFO L129 PetriNetUnfolder]: 54/163 cut-off events. [2020-10-16 04:52:20,769 INFO L130 PetriNetUnfolder]: For 280/300 co-relation queries the response was YES. [2020-10-16 04:52:20,771 INFO L80 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 163 events. 54/163 cut-off events. For 280/300 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 780 event pairs, 13 based on Foata normal form. 22/176 useless extension candidates. Maximal degree in co-relation 516. Up to 75 conditions per place. [2020-10-16 04:52:20,773 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 11 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2020-10-16 04:52:20,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 234 flow [2020-10-16 04:52:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:52:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:52:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2020-10-16 04:52:20,776 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8159203980099502 [2020-10-16 04:52:20,776 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2020-10-16 04:52:20,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2020-10-16 04:52:20,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:20,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2020-10-16 04:52:20,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:52:20,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:52:20,781 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:52:20,781 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 183 flow. Second operand 4 states and 656 transitions. [2020-10-16 04:52:20,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 234 flow [2020-10-16 04:52:20,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 227 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:20,785 INFO L241 Difference]: Finished difference. Result has 52 places, 40 transitions, 210 flow [2020-10-16 04:52:20,785 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2020-10-16 04:52:20,786 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2020-10-16 04:52:20,786 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 210 flow [2020-10-16 04:52:20,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:20,786 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:20,786 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:20,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:52:20,787 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 04:52:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1347349865, now seen corresponding path program 1 times [2020-10-16 04:52:20,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:20,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251797414] [2020-10-16 04:52:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:20,894 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 04:52:20,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251797414] [2020-10-16 04:52:20,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:20,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:20,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322102025] [2020-10-16 04:52:20,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:20,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:20,899 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 04:52:20,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 210 flow. Second operand 6 states. [2020-10-16 04:52:20,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:20,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 04:52:20,900 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:21,050 INFO L129 PetriNetUnfolder]: 56/193 cut-off events. [2020-10-16 04:52:21,050 INFO L130 PetriNetUnfolder]: For 484/508 co-relation queries the response was YES. [2020-10-16 04:52:21,052 INFO L80 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 193 events. 56/193 cut-off events. For 484/508 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1029 event pairs, 7 based on Foata normal form. 19/204 useless extension candidates. Maximal degree in co-relation 705. Up to 75 conditions per place. [2020-10-16 04:52:21,055 INFO L132 encePairwiseOnDemand]: 195/201 looper letters, 12 selfloop transitions, 13 changer transitions 0/46 dead transitions. [2020-10-16 04:52:21,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 304 flow [2020-10-16 04:52:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 786 transitions. [2020-10-16 04:52:21,060 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7820895522388059 [2020-10-16 04:52:21,060 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 786 transitions. [2020-10-16 04:52:21,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 786 transitions. [2020-10-16 04:52:21,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:21,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 786 transitions. [2020-10-16 04:52:21,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:21,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:21,066 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:21,067 INFO L185 Difference]: Start difference. First operand has 52 places, 40 transitions, 210 flow. Second operand 5 states and 786 transitions. [2020-10-16 04:52:21,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 304 flow [2020-10-16 04:52:21,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 284 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:21,075 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 280 flow [2020-10-16 04:52:21,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2020-10-16 04:52:21,076 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2020-10-16 04:52:21,076 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 280 flow [2020-10-16 04:52:21,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:21,076 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:21,077 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:21,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:52:21,077 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 04:52:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash 805884471, now seen corresponding path program 2 times [2020-10-16 04:52:21,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:21,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25638388] [2020-10-16 04:52:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:21,293 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 04:52:21,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25638388] [2020-10-16 04:52:21,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:21,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:21,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175915001] [2020-10-16 04:52:21,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:21,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:21,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:21,298 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 201 [2020-10-16 04:52:21,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 280 flow. Second operand 6 states. [2020-10-16 04:52:21,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:21,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 201 [2020-10-16 04:52:21,299 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:21,430 INFO L129 PetriNetUnfolder]: 47/184 cut-off events. [2020-10-16 04:52:21,430 INFO L130 PetriNetUnfolder]: For 660/696 co-relation queries the response was YES. [2020-10-16 04:52:21,432 INFO L80 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 184 events. 47/184 cut-off events. For 660/696 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1022 event pairs, 7 based on Foata normal form. 33/209 useless extension candidates. Maximal degree in co-relation 711. Up to 66 conditions per place. [2020-10-16 04:52:21,434 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 14 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2020-10-16 04:52:21,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 319 flow [2020-10-16 04:52:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:52:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:52:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2020-10-16 04:52:21,438 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7910447761194029 [2020-10-16 04:52:21,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2020-10-16 04:52:21,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2020-10-16 04:52:21,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:21,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2020-10-16 04:52:21,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:52:21,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:52:21,443 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:52:21,443 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 280 flow. Second operand 4 states and 636 transitions. [2020-10-16 04:52:21,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 319 flow [2020-10-16 04:52:21,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 304 flow, removed 7 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:21,451 INFO L241 Difference]: Finished difference. Result has 58 places, 44 transitions, 283 flow [2020-10-16 04:52:21,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2020-10-16 04:52:21,452 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2020-10-16 04:52:21,452 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 283 flow [2020-10-16 04:52:21,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:21,453 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:21,453 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:52:21,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:52:21,453 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 04:52:21,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:21,453 INFO L82 PathProgramCache]: Analyzing trace with hash 226220741, now seen corresponding path program 1 times [2020-10-16 04:52:21,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:21,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171380930] [2020-10-16 04:52:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:21,597 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 04:52:21,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171380930] [2020-10-16 04:52:21,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:21,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:21,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566740407] [2020-10-16 04:52:21,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:21,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:21,601 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201 [2020-10-16 04:52:21,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 283 flow. Second operand 4 states. [2020-10-16 04:52:21,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:21,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201 [2020-10-16 04:52:21,602 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:21,812 INFO L129 PetriNetUnfolder]: 436/911 cut-off events. [2020-10-16 04:52:21,812 INFO L130 PetriNetUnfolder]: For 2196/2607 co-relation queries the response was YES. [2020-10-16 04:52:21,821 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 911 events. 436/911 cut-off events. For 2196/2607 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 6495 event pairs, 179 based on Foata normal form. 124/925 useless extension candidates. Maximal degree in co-relation 2783. Up to 512 conditions per place. [2020-10-16 04:52:21,828 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 12 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2020-10-16 04:52:21,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 353 flow [2020-10-16 04:52:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2020-10-16 04:52:21,834 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8626865671641791 [2020-10-16 04:52:21,834 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2020-10-16 04:52:21,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2020-10-16 04:52:21,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:21,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2020-10-16 04:52:21,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:21,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:21,840 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:21,840 INFO L185 Difference]: Start difference. First operand has 58 places, 44 transitions, 283 flow. Second operand 5 states and 867 transitions. [2020-10-16 04:52:21,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 353 flow [2020-10-16 04:52:21,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 334 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:21,851 INFO L241 Difference]: Finished difference. Result has 62 places, 53 transitions, 347 flow [2020-10-16 04:52:21,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2020-10-16 04:52:21,852 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2020-10-16 04:52:21,852 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 347 flow [2020-10-16 04:52:21,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:21,853 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:21,853 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 04:52:21,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:52:21,853 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 04:52:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1501559550, now seen corresponding path program 1 times [2020-10-16 04:52:21,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:21,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609557811] [2020-10-16 04:52:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:22,001 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 04:52:22,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609557811] [2020-10-16 04:52:22,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:22,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:22,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787214704] [2020-10-16 04:52:22,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:22,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:22,005 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201 [2020-10-16 04:52:22,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 347 flow. Second operand 5 states. [2020-10-16 04:52:22,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:22,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201 [2020-10-16 04:52:22,007 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:22,199 INFO L129 PetriNetUnfolder]: 307/677 cut-off events. [2020-10-16 04:52:22,200 INFO L130 PetriNetUnfolder]: For 2267/4908 co-relation queries the response was YES. [2020-10-16 04:52:22,206 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 677 events. 307/677 cut-off events. For 2267/4908 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 4517 event pairs, 48 based on Foata normal form. 240/839 useless extension candidates. Maximal degree in co-relation 2801. Up to 450 conditions per place. [2020-10-16 04:52:22,211 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 12 selfloop transitions, 19 changer transitions 0/66 dead transitions. [2020-10-16 04:52:22,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 485 flow [2020-10-16 04:52:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1214 transitions. [2020-10-16 04:52:22,216 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8628287135749823 [2020-10-16 04:52:22,216 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1214 transitions. [2020-10-16 04:52:22,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1214 transitions. [2020-10-16 04:52:22,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:22,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1214 transitions. [2020-10-16 04:52:22,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:22,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:22,223 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:22,223 INFO L185 Difference]: Start difference. First operand has 62 places, 53 transitions, 347 flow. Second operand 7 states and 1214 transitions. [2020-10-16 04:52:22,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 485 flow [2020-10-16 04:52:22,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:22,230 INFO L241 Difference]: Finished difference. Result has 70 places, 62 transitions, 484 flow [2020-10-16 04:52:22,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2020-10-16 04:52:22,232 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2020-10-16 04:52:22,232 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 484 flow [2020-10-16 04:52:22,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:22,232 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:22,232 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 04:52:22,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:52:22,233 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 04:52:22,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2025440414, now seen corresponding path program 1 times [2020-10-16 04:52:22,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:22,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405795062] [2020-10-16 04:52:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:22,281 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 04:52:22,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405795062] [2020-10-16 04:52:22,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:22,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:52:22,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575849952] [2020-10-16 04:52:22,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:52:22,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:22,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:52:22,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:52:22,285 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 201 [2020-10-16 04:52:22,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 484 flow. Second operand 3 states. [2020-10-16 04:52:22,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:22,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 201 [2020-10-16 04:52:22,286 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:22,509 INFO L129 PetriNetUnfolder]: 478/991 cut-off events. [2020-10-16 04:52:22,509 INFO L130 PetriNetUnfolder]: For 4559/6774 co-relation queries the response was YES. [2020-10-16 04:52:22,523 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4851 conditions, 991 events. 478/991 cut-off events. For 4559/6774 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 7033 event pairs, 81 based on Foata normal form. 49/917 useless extension candidates. Maximal degree in co-relation 4822. Up to 711 conditions per place. [2020-10-16 04:52:22,531 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2020-10-16 04:52:22,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 496 flow [2020-10-16 04:52:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:52:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:52:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2020-10-16 04:52:22,537 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8955223880597015 [2020-10-16 04:52:22,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2020-10-16 04:52:22,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2020-10-16 04:52:22,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:22,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2020-10-16 04:52:22,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:52:22,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:52:22,541 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:52:22,542 INFO L185 Difference]: Start difference. First operand has 70 places, 62 transitions, 484 flow. Second operand 3 states and 540 transitions. [2020-10-16 04:52:22,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 496 flow [2020-10-16 04:52:22,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 446 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 04:52:22,561 INFO L241 Difference]: Finished difference. Result has 70 places, 62 transitions, 445 flow [2020-10-16 04:52:22,563 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2020-10-16 04:52:22,563 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2020-10-16 04:52:22,563 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 445 flow [2020-10-16 04:52:22,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:52:22,563 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:22,564 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] [2020-10-16 04:52:22,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:52:22,564 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 04:52:22,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2073359112, now seen corresponding path program 1 times [2020-10-16 04:52:22,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:22,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714886527] [2020-10-16 04:52:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:22,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714886527] [2020-10-16 04:52:22,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:22,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:22,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882432807] [2020-10-16 04:52:22,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:22,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:22,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:22,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:22,663 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201 [2020-10-16 04:52:22,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 445 flow. Second operand 4 states. [2020-10-16 04:52:22,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:22,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201 [2020-10-16 04:52:22,665 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:22,990 INFO L129 PetriNetUnfolder]: 937/1856 cut-off events. [2020-10-16 04:52:22,991 INFO L130 PetriNetUnfolder]: For 8972/10424 co-relation queries the response was YES. [2020-10-16 04:52:23,010 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8325 conditions, 1856 events. 937/1856 cut-off events. For 8972/10424 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 14634 event pairs, 155 based on Foata normal form. 67/1679 useless extension candidates. Maximal degree in co-relation 8296. Up to 1250 conditions per place. [2020-10-16 04:52:23,019 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2020-10-16 04:52:23,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 475 flow [2020-10-16 04:52:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:52:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:52:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2020-10-16 04:52:23,023 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8694029850746269 [2020-10-16 04:52:23,024 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 699 transitions. [2020-10-16 04:52:23,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions. [2020-10-16 04:52:23,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:23,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions. [2020-10-16 04:52:23,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:52:23,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:52:23,028 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:52:23,028 INFO L185 Difference]: Start difference. First operand has 70 places, 62 transitions, 445 flow. Second operand 4 states and 699 transitions. [2020-10-16 04:52:23,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 475 flow [2020-10-16 04:52:23,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 470 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:52:23,054 INFO L241 Difference]: Finished difference. Result has 74 places, 63 transitions, 453 flow [2020-10-16 04:52:23,055 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2020-10-16 04:52:23,055 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2020-10-16 04:52:23,055 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 453 flow [2020-10-16 04:52:23,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:23,055 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:23,055 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] [2020-10-16 04:52:23,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:52:23,056 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 04:52:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1365996120, now seen corresponding path program 2 times [2020-10-16 04:52:23,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:23,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185886705] [2020-10-16 04:52:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:23,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185886705] [2020-10-16 04:52:23,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:23,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:23,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914239890] [2020-10-16 04:52:23,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:23,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:23,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:23,210 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201 [2020-10-16 04:52:23,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 453 flow. Second operand 6 states. [2020-10-16 04:52:23,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:23,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201 [2020-10-16 04:52:23,211 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:23,574 INFO L129 PetriNetUnfolder]: 680/1393 cut-off events. [2020-10-16 04:52:23,574 INFO L130 PetriNetUnfolder]: For 8375/15578 co-relation queries the response was YES. [2020-10-16 04:52:23,588 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7117 conditions, 1393 events. 680/1393 cut-off events. For 8375/15578 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 10704 event pairs, 16 based on Foata normal form. 689/1879 useless extension candidates. Maximal degree in co-relation 7086. Up to 973 conditions per place. [2020-10-16 04:52:23,596 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 7 selfloop transitions, 28 changer transitions 7/75 dead transitions. [2020-10-16 04:52:23,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 651 flow [2020-10-16 04:52:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:52:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:52:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1561 transitions. [2020-10-16 04:52:23,601 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8629076838032061 [2020-10-16 04:52:23,601 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1561 transitions. [2020-10-16 04:52:23,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1561 transitions. [2020-10-16 04:52:23,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:23,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1561 transitions. [2020-10-16 04:52:23,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:52:23,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:52:23,611 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:52:23,611 INFO L185 Difference]: Start difference. First operand has 74 places, 63 transitions, 453 flow. Second operand 9 states and 1561 transitions. [2020-10-16 04:52:23,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 651 flow [2020-10-16 04:52:23,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 645 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:23,633 INFO L241 Difference]: Finished difference. Result has 83 places, 68 transitions, 593 flow [2020-10-16 04:52:23,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=593, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2020-10-16 04:52:23,633 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2020-10-16 04:52:23,634 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 593 flow [2020-10-16 04:52:23,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:23,634 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:23,634 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] [2020-10-16 04:52:23,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:52:23,634 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 04:52:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1025451544, now seen corresponding path program 1 times [2020-10-16 04:52:23,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:23,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727882388] [2020-10-16 04:52:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:23,789 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 04:52:23,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727882388] [2020-10-16 04:52:23,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:23,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:52:23,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956737658] [2020-10-16 04:52:23,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:52:23,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:23,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:52:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:52:23,793 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 201 [2020-10-16 04:52:23,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 593 flow. Second operand 7 states. [2020-10-16 04:52:23,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:23,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 201 [2020-10-16 04:52:23,795 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:24,091 INFO L129 PetriNetUnfolder]: 556/1171 cut-off events. [2020-10-16 04:52:24,091 INFO L130 PetriNetUnfolder]: For 11306/20540 co-relation queries the response was YES. [2020-10-16 04:52:24,100 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7336 conditions, 1171 events. 556/1171 cut-off events. For 11306/20540 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 8961 event pairs, 0 based on Foata normal form. 593/1561 useless extension candidates. Maximal degree in co-relation 7302. Up to 793 conditions per place. [2020-10-16 04:52:24,105 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 2 selfloop transitions, 33 changer transitions 7/72 dead transitions. [2020-10-16 04:52:24,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 72 transitions, 719 flow [2020-10-16 04:52:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:52:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:52:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1900 transitions. [2020-10-16 04:52:24,112 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8593396653098145 [2020-10-16 04:52:24,112 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1900 transitions. [2020-10-16 04:52:24,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1900 transitions. [2020-10-16 04:52:24,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:24,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1900 transitions. [2020-10-16 04:52:24,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:52:24,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:52:24,122 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:52:24,122 INFO L185 Difference]: Start difference. First operand has 83 places, 68 transitions, 593 flow. Second operand 11 states and 1900 transitions. [2020-10-16 04:52:24,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 72 transitions, 719 flow [2020-10-16 04:52:24,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 72 transitions, 586 flow, removed 38 selfloop flow, removed 9 redundant places. [2020-10-16 04:52:24,213 INFO L241 Difference]: Finished difference. Result has 87 places, 65 transitions, 516 flow [2020-10-16 04:52:24,213 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=516, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2020-10-16 04:52:24,213 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2020-10-16 04:52:24,214 INFO L481 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 516 flow [2020-10-16 04:52:24,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:52:24,214 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:24,214 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] [2020-10-16 04:52:24,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:52:24,215 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 04:52:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1903351076, now seen corresponding path program 1 times [2020-10-16 04:52:24,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:24,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100854433] [2020-10-16 04:52:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:24,302 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 04:52:24,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100854433] [2020-10-16 04:52:24,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:24,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:52:24,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400089685] [2020-10-16 04:52:24,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:52:24,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:52:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:52:24,308 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 201 [2020-10-16 04:52:24,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 65 transitions, 516 flow. Second operand 4 states. [2020-10-16 04:52:24,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:24,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 201 [2020-10-16 04:52:24,310 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:24,477 INFO L129 PetriNetUnfolder]: 547/1171 cut-off events. [2020-10-16 04:52:24,477 INFO L130 PetriNetUnfolder]: For 5902/7114 co-relation queries the response was YES. [2020-10-16 04:52:24,487 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5170 conditions, 1171 events. 547/1171 cut-off events. For 5902/7114 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 8804 event pairs, 0 based on Foata normal form. 12/968 useless extension candidates. Maximal degree in co-relation 5135. Up to 410 conditions per place. [2020-10-16 04:52:24,490 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 1 changer transitions 11/66 dead transitions. [2020-10-16 04:52:24,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 66 transitions, 528 flow [2020-10-16 04:52:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:52:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:52:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2020-10-16 04:52:24,494 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8631840796019901 [2020-10-16 04:52:24,494 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 694 transitions. [2020-10-16 04:52:24,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 694 transitions. [2020-10-16 04:52:24,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:24,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 694 transitions. [2020-10-16 04:52:24,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:52:24,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:52:24,499 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:52:24,499 INFO L185 Difference]: Start difference. First operand has 87 places, 65 transitions, 516 flow. Second operand 4 states and 694 transitions. [2020-10-16 04:52:24,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 66 transitions, 528 flow [2020-10-16 04:52:24,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 387 flow, removed 30 selfloop flow, removed 15 redundant places. [2020-10-16 04:52:24,570 INFO L241 Difference]: Finished difference. Result has 76 places, 55 transitions, 315 flow [2020-10-16 04:52:24,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2020-10-16 04:52:24,571 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2020-10-16 04:52:24,571 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 315 flow [2020-10-16 04:52:24,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:52:24,571 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:24,572 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] [2020-10-16 04:52:24,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:52:24,572 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 04:52:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1141126474, now seen corresponding path program 2 times [2020-10-16 04:52:24,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:24,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181204217] [2020-10-16 04:52:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:24,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:24,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:24,686 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:52:24,686 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:52:24,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:52:24,687 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:52:24,701 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In-2015260395 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-2015260395 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-2015260395 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-2015260395 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out-2015260395 0) .cse1) (and (= ~z$w_buff1_used~0_Out-2015260395 ~z$w_buff1_used~0_In-2015260395) .cse2)) (or (and (= ~z$w_buff0~0_In-2015260395 ~z~0_Out-2015260395) .cse3 .cse4) (and (or (and .cse0 .cse1 (= ~z$w_buff1~0_In-2015260395 ~z~0_Out-2015260395)) (and (= ~z~0_In-2015260395 ~z~0_Out-2015260395) .cse2)) .cse5)) (or (and .cse3 .cse4 (= 0 ~z$w_buff0_used~0_Out-2015260395)) (and .cse5 (= ~z$w_buff0_used~0_In-2015260395 ~z$w_buff0_used~0_Out-2015260395))) (= ~z$r_buff0_thd0~0_Out-2015260395 ~z$r_buff0_thd0~0_In-2015260395) (= ~z$r_buff1_thd0~0_In-2015260395 ~z$r_buff1_thd0~0_Out-2015260395) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2015260395| ULTIMATE.start_assume_abort_if_not_~cond_Out-2015260395) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2015260395 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2015260395|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2015260395, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015260395, ~z$w_buff0~0=~z$w_buff0~0_In-2015260395, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2015260395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2015260395, ~z$w_buff1~0=~z$w_buff1~0_In-2015260395, ~z~0=~z~0_In-2015260395} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2015260395, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2015260395|, ~z$w_buff0~0=~z$w_buff0~0_In-2015260395, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2015260395|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2015260395, ~z$w_buff1~0=~z$w_buff1~0_In-2015260395, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2015260395|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2015260395|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2015260395|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-2015260395|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2015260395|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2015260395, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2015260395, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2015260395, ~z~0=~z~0_Out-2015260395} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 04:52:24,708 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 04:52:24,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,710 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 04:52:24,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,710 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 04:52:24,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,711 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 04:52:24,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,711 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 04:52:24,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,711 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 04:52:24,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,711 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 04:52:24,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,712 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 04:52:24,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,713 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 04:52:24,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,713 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 04:52:24,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,713 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 04:52:24,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,714 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 04:52:24,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,714 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 04:52:24,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,715 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 04:52:24,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,715 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 04:52:24,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,716 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 04:52:24,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,716 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 04:52:24,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,716 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 04:52:24,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,717 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 04:52:24,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,717 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 04:52:24,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,717 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 04:52:24,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,718 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 04:52:24,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,718 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 04:52:24,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:24,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:52:24 BasicIcfg [2020-10-16 04:52:24,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:52:24,793 INFO L168 Benchmark]: Toolchain (without parser) took 19514.49 ms. Allocated memory was 248.5 MB in the beginning and 566.8 MB in the end (delta: 318.2 MB). Free memory was 201.9 MB in the beginning and 271.0 MB in the end (delta: -69.2 MB). Peak memory consumption was 249.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:24,794 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 248.5 MB. Free memory is still 222.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:52:24,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 957.48 ms. Allocated memory was 248.5 MB in the beginning and 310.9 MB in the end (delta: 62.4 MB). Free memory was 201.9 MB in the beginning and 256.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:24,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.79 ms. Allocated memory is still 310.9 MB. Free memory was 256.7 MB in the beginning and 254.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:24,796 INFO L168 Benchmark]: Boogie Preprocessor took 36.78 ms. Allocated memory is still 310.9 MB. Free memory was 254.2 MB in the beginning and 251.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:24,796 INFO L168 Benchmark]: RCFGBuilder took 1947.57 ms. Allocated memory was 310.9 MB in the beginning and 351.8 MB in the end (delta: 40.9 MB). Free memory was 251.7 MB in the beginning and 197.6 MB in the end (delta: 54.1 MB). Peak memory consumption was 95.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:24,797 INFO L168 Benchmark]: TraceAbstraction took 16456.39 ms. Allocated memory was 351.8 MB in the beginning and 566.8 MB in the end (delta: 215.0 MB). Free memory was 197.6 MB in the beginning and 271.0 MB in the end (delta: -73.4 MB). Peak memory consumption was 141.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:24,801 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 248.5 MB. Free memory is still 222.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 957.48 ms. Allocated memory was 248.5 MB in the beginning and 310.9 MB in the end (delta: 62.4 MB). Free memory was 201.9 MB in the beginning and 256.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 110.79 ms. Allocated memory is still 310.9 MB. Free memory was 256.7 MB in the beginning and 254.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.78 ms. Allocated memory is still 310.9 MB. Free memory was 254.2 MB in the beginning and 251.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1947.57 ms. Allocated memory was 310.9 MB in the beginning and 351.8 MB in the end (delta: 40.9 MB). Free memory was 251.7 MB in the beginning and 197.6 MB in the end (delta: 54.1 MB). Peak memory consumption was 95.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 16456.39 ms. Allocated memory was 351.8 MB in the beginning and 566.8 MB in the end (delta: 215.0 MB). Free memory was 197.6 MB in the beginning and 271.0 MB in the end (delta: -73.4 MB). Peak memory consumption was 141.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1709 VarBasedMoverChecksPositive, 80 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 219 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.7s, 119 PlacesBefore, 41 PlacesAfterwards, 108 TransitionsBefore, 28 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 6449 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_p0_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1221; [L836] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L837] 0 pthread_t t1222; [L838] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L839] 0 pthread_t t1223; [L840] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L841] 0 pthread_t t1224; [L842] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L791] 4 z$w_buff1 = z$w_buff0 [L792] 4 z$w_buff0 = 2 [L793] 4 z$w_buff1_used = z$w_buff0_used [L794] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L796] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L801] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L804] 4 a = 1 [L807] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L810] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L744] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L756] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L771] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L774] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L777] 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) [L777] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L777] 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) [L777] 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) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 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 [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L780] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L781] 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 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 3 return 0; [L813] 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) [L813] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L813] 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) [L813] 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) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 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 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 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 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 z$flush_delayed = weak$$choice2 [L858] 0 z$mem_tmp = z [L859] 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) [L859] 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) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] EXPR 0 !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) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L867] 0 z = z$flush_delayed ? z$mem_tmp : z [L868] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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, 111 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: 16.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 49 SDtfs, 40 SDslu, 19 SDs, 0 SdLazy, 288 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred in iteration=13, 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.1s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 16379 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...