/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:31:54,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:31:54,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:31:54,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:31:54,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:31:54,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:31:54,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:31:54,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:31:54,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:31:54,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:31:54,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:31:54,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:31:54,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:31:54,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:31:54,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:31:54,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:31:54,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:31:54,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:31:54,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:31:54,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:31:54,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:31:54,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:31:54,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:31:54,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:31:54,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:31:54,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:31:54,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:31:54,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:31:54,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:31:54,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:31:54,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:31:54,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:31:54,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:31:54,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:31:54,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:31:54,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:31:54,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:31:54,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:31:54,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:31:54,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:31:54,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:31:54,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:31:54,335 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:31:54,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:31:54,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:31:54,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:31:54,337 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:31:54,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:31:54,338 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:31:54,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:31:54,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:31:54,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:31:54,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:31:54,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:31:54,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:31:54,340 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:31:54,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:31:54,340 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:31:54,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:31:54,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:31:54,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:31:54,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:31:54,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:31:54,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:31:54,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:31:54,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:31:54,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:31:54,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:31:54,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:31:54,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:31:54,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:31:54,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:31:54,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:31:54,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:31:54,652 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:31:54,652 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:31:54,653 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2020-10-16 01:31:54,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe64d271/f7c739c1686a454e9a1c5f6fa0135b53/FLAG04b8847f9 [2020-10-16 01:31:55,243 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:31:55,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2020-10-16 01:31:55,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe64d271/f7c739c1686a454e9a1c5f6fa0135b53/FLAG04b8847f9 [2020-10-16 01:31:55,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe64d271/f7c739c1686a454e9a1c5f6fa0135b53 [2020-10-16 01:31:55,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:31:55,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:31:55,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:55,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:31:55,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:31:55,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bdbcafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55, skipping insertion in model container [2020-10-16 01:31:55,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:31:55,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:31:56,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:56,169 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:31:56,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:56,326 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:31:56,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56 WrapperNode [2020-10-16 01:31:56,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:56,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:56,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:31:56,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:31:56,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:56,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:31:56,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:31:56,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:31:56,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... [2020-10-16 01:31:56,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:31:56,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:31:56,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:31:56,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:31:56,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:31:56,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:31:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:31:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:31:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:31:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:31:56,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:31:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:31:56,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:31:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:31:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:31:56,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:31:56,523 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:31:58,515 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:31:58,515 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:31:58,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:58 BoogieIcfgContainer [2020-10-16 01:31:58,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:31:58,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:31:58,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:31:58,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:31:58,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:31:55" (1/3) ... [2020-10-16 01:31:58,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bdaab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:58, skipping insertion in model container [2020-10-16 01:31:58,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:56" (2/3) ... [2020-10-16 01:31:58,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bdaab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:58, skipping insertion in model container [2020-10-16 01:31:58,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:58" (3/3) ... [2020-10-16 01:31:58,527 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2020-10-16 01:31:58,540 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:31:58,547 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:31:58,548 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:31:58,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,576 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,576 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,580 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:58,613 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:31:58,635 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:31:58,635 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:31:58,635 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:31:58,635 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:31:58,635 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:31:58,635 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:31:58,636 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:31:58,636 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:31:58,649 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 01:31:58,690 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 01:31:58,691 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:58,695 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:31:58,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 01:31:58,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:58,704 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:31:58,707 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:58,710 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:58,711 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:58,732 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 01:31:58,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:58,733 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:31:58,735 INFO L117 LiptonReduction]: Number of co-enabled transitions 1012 [2020-10-16 01:31:59,027 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-16 01:31:59,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:59,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:31:59,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:31:59,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:59,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:59,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:59,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:59,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:31:59,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:59,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:31:59,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:59,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:59,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:59,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:59,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:59,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:59,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:31:59,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:59,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:59,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:59,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:59,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:31:59,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:31:59,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,177 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:32:00,318 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:32:00,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:00,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:00,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:00,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:00,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:00,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,501 WARN L193 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-16 01:32:02,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 01:32:02,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:02,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,013 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-16 01:32:04,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:04,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:04,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:04,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:32:04,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:04,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:04,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:04,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:04,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:04,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:04,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:04,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:04,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:04,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:04,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:04,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:04,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:04,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:04,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:04,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:04,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:04,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:04,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:32:04,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:04,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:04,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:32:04,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:04,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:04,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:04,941 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:32:05,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:05,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:05,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:05,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:05,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:05,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:05,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:05,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:05,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:05,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:05,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:05,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:05,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:05,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:05,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:05,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:06,128 WARN L193 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-10-16 01:32:06,460 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 01:32:07,192 WARN L193 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-16 01:32:07,471 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 01:32:08,085 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-16 01:32:08,390 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 01:32:08,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:32:08,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:09,118 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 01:32:09,476 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 01:32:09,817 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-10-16 01:32:09,913 INFO L132 LiptonReduction]: Checked pairs total: 2995 [2020-10-16 01:32:09,913 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 01:32:09,916 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11214 [2020-10-16 01:32:09,922 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2020-10-16 01:32:09,923 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:09,923 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:09,924 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:32:09,924 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash 872957254, now seen corresponding path program 1 times [2020-10-16 01:32:09,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:09,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822874572] [2020-10-16 01:32:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:10,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822874572] [2020-10-16 01:32:10,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:10,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:10,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154752941] [2020-10-16 01:32:10,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:10,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:10,185 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 147 [2020-10-16 01:32:10,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states. [2020-10-16 01:32:10,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:10,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 147 [2020-10-16 01:32:10,189 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:10,264 INFO L129 PetriNetUnfolder]: 23/63 cut-off events. [2020-10-16 01:32:10,264 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:10,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 63 events. 23/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 212 event pairs, 9 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 109. Up to 37 conditions per place. [2020-10-16 01:32:10,266 INFO L132 encePairwiseOnDemand]: 144/147 looper letters, 7 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2020-10-16 01:32:10,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 72 flow [2020-10-16 01:32:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2020-10-16 01:32:10,284 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2020-10-16 01:32:10,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2020-10-16 01:32:10,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2020-10-16 01:32:10,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:10,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2020-10-16 01:32:10,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:10,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:10,301 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:10,303 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 354 transitions. [2020-10-16 01:32:10,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 72 flow [2020-10-16 01:32:10,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:10,309 INFO L241 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2020-10-16 01:32:10,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2020-10-16 01:32:10,313 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2020-10-16 01:32:10,313 INFO L481 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2020-10-16 01:32:10,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:10,314 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:10,314 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:10,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:32:10,314 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:10,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1393376099, now seen corresponding path program 1 times [2020-10-16 01:32:10,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:10,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525195455] [2020-10-16 01:32:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:10,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525195455] [2020-10-16 01:32:10,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:10,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:10,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384479658] [2020-10-16 01:32:10,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:10,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:10,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:10,466 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 147 [2020-10-16 01:32:10,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand 3 states. [2020-10-16 01:32:10,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:10,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 147 [2020-10-16 01:32:10,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:10,525 INFO L129 PetriNetUnfolder]: 62/133 cut-off events. [2020-10-16 01:32:10,526 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 01:32:10,526 INFO L80 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 133 events. 62/133 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 489 event pairs, 45 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 255. Up to 114 conditions per place. [2020-10-16 01:32:10,528 INFO L132 encePairwiseOnDemand]: 143/147 looper letters, 10 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2020-10-16 01:32:10,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 76 flow [2020-10-16 01:32:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2020-10-16 01:32:10,532 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2020-10-16 01:32:10,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2020-10-16 01:32:10,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2020-10-16 01:32:10,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:10,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2020-10-16 01:32:10,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:10,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:10,536 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:10,536 INFO L185 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 3 states and 338 transitions. [2020-10-16 01:32:10,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 76 flow [2020-10-16 01:32:10,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:10,537 INFO L241 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2020-10-16 01:32:10,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2020-10-16 01:32:10,538 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2020-10-16 01:32:10,538 INFO L481 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2020-10-16 01:32:10,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:10,539 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:10,539 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:10,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:32:10,539 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:10,540 INFO L82 PathProgramCache]: Analyzing trace with hash 244965564, now seen corresponding path program 1 times [2020-10-16 01:32:10,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:10,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579531314] [2020-10-16 01:32:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:10,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579531314] [2020-10-16 01:32:10,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:10,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:10,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347148217] [2020-10-16 01:32:10,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:10,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:10,660 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 147 [2020-10-16 01:32:10,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand 4 states. [2020-10-16 01:32:10,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:10,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 147 [2020-10-16 01:32:10,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:10,756 INFO L129 PetriNetUnfolder]: 85/181 cut-off events. [2020-10-16 01:32:10,757 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-16 01:32:10,758 INFO L80 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 181 events. 85/181 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 693 event pairs, 27 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 371. Up to 141 conditions per place. [2020-10-16 01:32:10,759 INFO L132 encePairwiseOnDemand]: 143/147 looper letters, 13 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2020-10-16 01:32:10,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 109 flow [2020-10-16 01:32:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:32:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:32:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2020-10-16 01:32:10,762 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2020-10-16 01:32:10,762 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 399 transitions. [2020-10-16 01:32:10,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 399 transitions. [2020-10-16 01:32:10,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:10,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 399 transitions. [2020-10-16 01:32:10,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:32:10,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:32:10,766 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:32:10,766 INFO L185 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 4 states and 399 transitions. [2020-10-16 01:32:10,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 109 flow [2020-10-16 01:32:10,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:10,769 INFO L241 Difference]: Finished difference. Result has 29 places, 21 transitions, 82 flow [2020-10-16 01:32:10,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2020-10-16 01:32:10,769 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2020-10-16 01:32:10,770 INFO L481 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 82 flow [2020-10-16 01:32:10,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:10,770 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:10,770 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:10,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:32:10,770 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 244985249, now seen corresponding path program 1 times [2020-10-16 01:32:10,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:10,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447812579] [2020-10-16 01:32:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:10,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447812579] [2020-10-16 01:32:10,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:10,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:10,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863065046] [2020-10-16 01:32:10,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:10,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:10,817 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 147 [2020-10-16 01:32:10,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 82 flow. Second operand 3 states. [2020-10-16 01:32:10,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:10,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 147 [2020-10-16 01:32:10,818 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:10,839 INFO L129 PetriNetUnfolder]: 16/56 cut-off events. [2020-10-16 01:32:10,839 INFO L130 PetriNetUnfolder]: For 86/100 co-relation queries the response was YES. [2020-10-16 01:32:10,840 INFO L80 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 56 events. 16/56 cut-off events. For 86/100 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 167 event pairs, 8 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 142. Up to 33 conditions per place. [2020-10-16 01:32:10,841 INFO L132 encePairwiseOnDemand]: 143/147 looper letters, 5 selfloop transitions, 4 changer transitions 0/23 dead transitions. [2020-10-16 01:32:10,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 106 flow [2020-10-16 01:32:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2020-10-16 01:32:10,843 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8435374149659864 [2020-10-16 01:32:10,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2020-10-16 01:32:10,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2020-10-16 01:32:10,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:10,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2020-10-16 01:32:10,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:10,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:10,846 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:10,846 INFO L185 Difference]: Start difference. First operand has 29 places, 21 transitions, 82 flow. Second operand 3 states and 372 transitions. [2020-10-16 01:32:10,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 106 flow [2020-10-16 01:32:10,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 100 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:10,848 INFO L241 Difference]: Finished difference. Result has 31 places, 23 transitions, 100 flow [2020-10-16 01:32:10,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2020-10-16 01:32:10,849 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2020-10-16 01:32:10,849 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 100 flow [2020-10-16 01:32:10,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:10,849 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:10,849 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:10,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:32:10,849 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -995368708, now seen corresponding path program 1 times [2020-10-16 01:32:10,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:10,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964084855] [2020-10-16 01:32:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:10,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964084855] [2020-10-16 01:32:10,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:10,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:10,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863748716] [2020-10-16 01:32:10,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:10,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:10,892 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 147 [2020-10-16 01:32:10,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 100 flow. Second operand 3 states. [2020-10-16 01:32:10,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:10,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 147 [2020-10-16 01:32:10,893 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:10,905 INFO L129 PetriNetUnfolder]: 5/31 cut-off events. [2020-10-16 01:32:10,905 INFO L130 PetriNetUnfolder]: For 103/114 co-relation queries the response was YES. [2020-10-16 01:32:10,906 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 31 events. 5/31 cut-off events. For 103/114 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 1 based on Foata normal form. 3/34 useless extension candidates. Maximal degree in co-relation 70. Up to 10 conditions per place. [2020-10-16 01:32:10,906 INFO L132 encePairwiseOnDemand]: 144/147 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2020-10-16 01:32:10,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 106 flow [2020-10-16 01:32:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2020-10-16 01:32:10,909 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8526077097505669 [2020-10-16 01:32:10,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2020-10-16 01:32:10,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2020-10-16 01:32:10,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:10,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2020-10-16 01:32:10,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:10,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:10,912 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:10,912 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 100 flow. Second operand 3 states and 376 transitions. [2020-10-16 01:32:10,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 106 flow [2020-10-16 01:32:10,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:10,914 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 104 flow [2020-10-16 01:32:10,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2020-10-16 01:32:10,915 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2020-10-16 01:32:10,915 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 104 flow [2020-10-16 01:32:10,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:10,915 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:10,915 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:10,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:32:10,916 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1987711112, now seen corresponding path program 1 times [2020-10-16 01:32:10,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:10,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933745120] [2020-10-16 01:32:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:10,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933745120] [2020-10-16 01:32:10,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:10,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:10,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857775790] [2020-10-16 01:32:10,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:10,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:10,999 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 147 [2020-10-16 01:32:11,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 104 flow. Second operand 5 states. [2020-10-16 01:32:11,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:11,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 147 [2020-10-16 01:32:11,000 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:11,063 INFO L129 PetriNetUnfolder]: 32/94 cut-off events. [2020-10-16 01:32:11,063 INFO L130 PetriNetUnfolder]: For 208/209 co-relation queries the response was YES. [2020-10-16 01:32:11,064 INFO L80 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 94 events. 32/94 cut-off events. For 208/209 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 353 event pairs, 7 based on Foata normal form. 5/96 useless extension candidates. Maximal degree in co-relation 245. Up to 38 conditions per place. [2020-10-16 01:32:11,065 INFO L132 encePairwiseOnDemand]: 142/147 looper letters, 7 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2020-10-16 01:32:11,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 142 flow [2020-10-16 01:32:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:32:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:32:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2020-10-16 01:32:11,068 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7312925170068028 [2020-10-16 01:32:11,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 430 transitions. [2020-10-16 01:32:11,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 430 transitions. [2020-10-16 01:32:11,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:11,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 430 transitions. [2020-10-16 01:32:11,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:32:11,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:32:11,071 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:32:11,071 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 104 flow. Second operand 4 states and 430 transitions. [2020-10-16 01:32:11,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 142 flow [2020-10-16 01:32:11,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 134 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:11,074 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 131 flow [2020-10-16 01:32:11,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2020-10-16 01:32:11,075 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2020-10-16 01:32:11,075 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 131 flow [2020-10-16 01:32:11,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:11,075 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:11,075 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:11,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:32:11,075 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:11,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1204894702, now seen corresponding path program 1 times [2020-10-16 01:32:11,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:11,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187056630] [2020-10-16 01:32:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:11,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187056630] [2020-10-16 01:32:11,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:11,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:11,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506390178] [2020-10-16 01:32:11,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:11,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:11,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:11,115 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 147 [2020-10-16 01:32:11,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 131 flow. Second operand 3 states. [2020-10-16 01:32:11,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:11,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 147 [2020-10-16 01:32:11,116 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:11,144 INFO L129 PetriNetUnfolder]: 9/55 cut-off events. [2020-10-16 01:32:11,145 INFO L130 PetriNetUnfolder]: For 151/152 co-relation queries the response was YES. [2020-10-16 01:32:11,145 INFO L80 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 55 events. 9/55 cut-off events. For 151/152 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 3 based on Foata normal form. 4/59 useless extension candidates. Maximal degree in co-relation 155. Up to 15 conditions per place. [2020-10-16 01:32:11,146 INFO L132 encePairwiseOnDemand]: 144/147 looper letters, 7 selfloop transitions, 2 changer transitions 7/28 dead transitions. [2020-10-16 01:32:11,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 170 flow [2020-10-16 01:32:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2020-10-16 01:32:11,149 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8458049886621315 [2020-10-16 01:32:11,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2020-10-16 01:32:11,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2020-10-16 01:32:11,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:11,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2020-10-16 01:32:11,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:11,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:11,152 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:11,152 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 131 flow. Second operand 3 states and 373 transitions. [2020-10-16 01:32:11,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 170 flow [2020-10-16 01:32:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:11,155 INFO L241 Difference]: Finished difference. Result has 37 places, 19 transitions, 98 flow [2020-10-16 01:32:11,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2020-10-16 01:32:11,155 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2020-10-16 01:32:11,155 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 98 flow [2020-10-16 01:32:11,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:11,156 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:11,156 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:11,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:32:11,156 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1127035323, now seen corresponding path program 1 times [2020-10-16 01:32:11,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:11,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159455719] [2020-10-16 01:32:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:11,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159455719] [2020-10-16 01:32:11,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:11,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:11,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772476050] [2020-10-16 01:32:11,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:11,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:11,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:11,245 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 147 [2020-10-16 01:32:11,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 19 transitions, 98 flow. Second operand 5 states. [2020-10-16 01:32:11,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:11,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 147 [2020-10-16 01:32:11,245 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:11,301 INFO L129 PetriNetUnfolder]: 21/66 cut-off events. [2020-10-16 01:32:11,301 INFO L130 PetriNetUnfolder]: For 251/255 co-relation queries the response was YES. [2020-10-16 01:32:11,302 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 66 events. 21/66 cut-off events. For 251/255 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 10 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 198. Up to 36 conditions per place. [2020-10-16 01:32:11,302 INFO L132 encePairwiseOnDemand]: 143/147 looper letters, 8 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2020-10-16 01:32:11,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 22 transitions, 126 flow [2020-10-16 01:32:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2020-10-16 01:32:11,305 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7256235827664399 [2020-10-16 01:32:11,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2020-10-16 01:32:11,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2020-10-16 01:32:11,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:11,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2020-10-16 01:32:11,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:11,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:11,308 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:11,308 INFO L185 Difference]: Start difference. First operand has 37 places, 19 transitions, 98 flow. Second operand 3 states and 320 transitions. [2020-10-16 01:32:11,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 22 transitions, 126 flow [2020-10-16 01:32:11,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 108 flow, removed 3 selfloop flow, removed 6 redundant places. [2020-10-16 01:32:11,310 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 99 flow [2020-10-16 01:32:11,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2020-10-16 01:32:11,311 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2020-10-16 01:32:11,311 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 99 flow [2020-10-16 01:32:11,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:11,311 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:11,312 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:11,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:32:11,312 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:11,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1736356363, now seen corresponding path program 1 times [2020-10-16 01:32:11,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:11,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099081859] [2020-10-16 01:32:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:11,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099081859] [2020-10-16 01:32:11,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:11,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:11,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760865324] [2020-10-16 01:32:11,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:11,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:11,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:11,392 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 147 [2020-10-16 01:32:11,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 99 flow. Second operand 7 states. [2020-10-16 01:32:11,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:11,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 147 [2020-10-16 01:32:11,393 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:11,557 INFO L129 PetriNetUnfolder]: 55/139 cut-off events. [2020-10-16 01:32:11,557 INFO L130 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2020-10-16 01:32:11,558 INFO L80 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 139 events. 55/139 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 559 event pairs, 15 based on Foata normal form. 8/146 useless extension candidates. Maximal degree in co-relation 411. Up to 61 conditions per place. [2020-10-16 01:32:11,559 INFO L132 encePairwiseOnDemand]: 138/147 looper letters, 13 selfloop transitions, 3 changer transitions 13/35 dead transitions. [2020-10-16 01:32:11,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 207 flow [2020-10-16 01:32:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 711 transitions. [2020-10-16 01:32:11,564 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6909620991253644 [2020-10-16 01:32:11,564 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 711 transitions. [2020-10-16 01:32:11,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 711 transitions. [2020-10-16 01:32:11,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:11,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 711 transitions. [2020-10-16 01:32:11,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:11,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:11,570 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:11,621 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 99 flow. Second operand 7 states and 711 transitions. [2020-10-16 01:32:11,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 207 flow [2020-10-16 01:32:11,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 197 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:11,623 INFO L241 Difference]: Finished difference. Result has 40 places, 19 transitions, 105 flow [2020-10-16 01:32:11,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2020-10-16 01:32:11,624 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2020-10-16 01:32:11,624 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 105 flow [2020-10-16 01:32:11,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:11,624 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:11,624 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:11,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:32:11,625 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:11,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1878905091, now seen corresponding path program 2 times [2020-10-16 01:32:11,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:11,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061088519] [2020-10-16 01:32:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:11,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061088519] [2020-10-16 01:32:11,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:11,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:11,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798574408] [2020-10-16 01:32:11,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:11,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:11,686 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 147 [2020-10-16 01:32:11,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 19 transitions, 105 flow. Second operand 5 states. [2020-10-16 01:32:11,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:11,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 147 [2020-10-16 01:32:11,687 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:11,756 INFO L129 PetriNetUnfolder]: 18/69 cut-off events. [2020-10-16 01:32:11,756 INFO L130 PetriNetUnfolder]: For 279/283 co-relation queries the response was YES. [2020-10-16 01:32:11,756 INFO L80 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 69 events. 18/69 cut-off events. For 279/283 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 195 event pairs, 2 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 255. Up to 36 conditions per place. [2020-10-16 01:32:11,757 INFO L132 encePairwiseOnDemand]: 140/147 looper letters, 6 selfloop transitions, 7 changer transitions 0/23 dead transitions. [2020-10-16 01:32:11,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 23 transitions, 151 flow [2020-10-16 01:32:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2020-10-16 01:32:11,761 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7170068027210884 [2020-10-16 01:32:11,761 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2020-10-16 01:32:11,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2020-10-16 01:32:11,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:11,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2020-10-16 01:32:11,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:11,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:11,765 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:11,765 INFO L185 Difference]: Start difference. First operand has 40 places, 19 transitions, 105 flow. Second operand 5 states and 527 transitions. [2020-10-16 01:32:11,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 23 transitions, 151 flow [2020-10-16 01:32:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 23 transitions, 132 flow, removed 4 selfloop flow, removed 7 redundant places. [2020-10-16 01:32:11,767 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 129 flow [2020-10-16 01:32:11,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2020-10-16 01:32:11,768 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2020-10-16 01:32:11,768 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 129 flow [2020-10-16 01:32:11,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:11,768 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:11,768 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:11,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:32:11,768 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1737396692, now seen corresponding path program 1 times [2020-10-16 01:32:11,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:11,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707711513] [2020-10-16 01:32:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:11,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707711513] [2020-10-16 01:32:11,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:11,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:11,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233047243] [2020-10-16 01:32:11,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:11,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:11,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:11,850 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 147 [2020-10-16 01:32:11,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 129 flow. Second operand 4 states. [2020-10-16 01:32:11,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:11,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 147 [2020-10-16 01:32:11,851 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:11,919 INFO L129 PetriNetUnfolder]: 63/146 cut-off events. [2020-10-16 01:32:11,919 INFO L130 PetriNetUnfolder]: For 413/417 co-relation queries the response was YES. [2020-10-16 01:32:11,919 INFO L80 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 146 events. 63/146 cut-off events. For 413/417 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 532 event pairs, 37 based on Foata normal form. 15/150 useless extension candidates. Maximal degree in co-relation 583. Up to 104 conditions per place. [2020-10-16 01:32:11,921 INFO L132 encePairwiseOnDemand]: 143/147 looper letters, 11 selfloop transitions, 2 changer transitions 9/31 dead transitions. [2020-10-16 01:32:11,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 225 flow [2020-10-16 01:32:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2020-10-16 01:32:11,923 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6829931972789116 [2020-10-16 01:32:11,924 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2020-10-16 01:32:11,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2020-10-16 01:32:11,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:11,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2020-10-16 01:32:11,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:11,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:11,927 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:11,927 INFO L185 Difference]: Start difference. First operand has 36 places, 22 transitions, 129 flow. Second operand 5 states and 502 transitions. [2020-10-16 01:32:11,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 225 flow [2020-10-16 01:32:11,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 186 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:11,930 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 118 flow [2020-10-16 01:32:11,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2020-10-16 01:32:11,930 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2020-10-16 01:32:11,931 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 118 flow [2020-10-16 01:32:11,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:11,931 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:11,931 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:11,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:32:11,931 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:11,932 INFO L82 PathProgramCache]: Analyzing trace with hash -609756444, now seen corresponding path program 2 times [2020-10-16 01:32:11,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:11,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881479135] [2020-10-16 01:32:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:12,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881479135] [2020-10-16 01:32:12,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:12,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:12,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823820379] [2020-10-16 01:32:12,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:12,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:12,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:12,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:12,014 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 147 [2020-10-16 01:32:12,014 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 118 flow. Second operand 5 states. [2020-10-16 01:32:12,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:12,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 147 [2020-10-16 01:32:12,015 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:12,088 INFO L129 PetriNetUnfolder]: 32/86 cut-off events. [2020-10-16 01:32:12,088 INFO L130 PetriNetUnfolder]: For 216/221 co-relation queries the response was YES. [2020-10-16 01:32:12,088 INFO L80 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 86 events. 32/86 cut-off events. For 216/221 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 266 event pairs, 3 based on Foata normal form. 20/106 useless extension candidates. Maximal degree in co-relation 305. Up to 45 conditions per place. [2020-10-16 01:32:12,089 INFO L132 encePairwiseOnDemand]: 141/147 looper letters, 14 selfloop transitions, 4 changer transitions 13/40 dead transitions. [2020-10-16 01:32:12,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 264 flow [2020-10-16 01:32:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2020-10-16 01:32:12,093 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6870748299319728 [2020-10-16 01:32:12,093 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2020-10-16 01:32:12,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2020-10-16 01:32:12,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:12,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2020-10-16 01:32:12,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:12,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:12,097 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:12,097 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 118 flow. Second operand 6 states and 606 transitions. [2020-10-16 01:32:12,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 264 flow [2020-10-16 01:32:12,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 250 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 01:32:12,100 INFO L241 Difference]: Finished difference. Result has 40 places, 24 transitions, 139 flow [2020-10-16 01:32:12,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2020-10-16 01:32:12,100 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2020-10-16 01:32:12,100 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 139 flow [2020-10-16 01:32:12,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:12,101 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:12,101 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:12,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:32:12,101 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash -804634705, now seen corresponding path program 1 times [2020-10-16 01:32:12,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:12,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335885884] [2020-10-16 01:32:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:12,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335885884] [2020-10-16 01:32:12,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:12,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:12,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79299793] [2020-10-16 01:32:12,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:12,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:12,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:12,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:12,179 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 147 [2020-10-16 01:32:12,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 139 flow. Second operand 5 states. [2020-10-16 01:32:12,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:12,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 147 [2020-10-16 01:32:12,180 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:12,225 INFO L129 PetriNetUnfolder]: 4/34 cut-off events. [2020-10-16 01:32:12,225 INFO L130 PetriNetUnfolder]: For 65/67 co-relation queries the response was YES. [2020-10-16 01:32:12,225 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 34 events. 4/34 cut-off events. For 65/67 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 8/42 useless extension candidates. Maximal degree in co-relation 112. Up to 14 conditions per place. [2020-10-16 01:32:12,226 INFO L132 encePairwiseOnDemand]: 142/147 looper letters, 2 selfloop transitions, 6 changer transitions 2/26 dead transitions. [2020-10-16 01:32:12,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 26 transitions, 171 flow [2020-10-16 01:32:12,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2020-10-16 01:32:12,229 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8163265306122449 [2020-10-16 01:32:12,229 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2020-10-16 01:32:12,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2020-10-16 01:32:12,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:12,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2020-10-16 01:32:12,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:12,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:12,234 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:12,234 INFO L185 Difference]: Start difference. First operand has 40 places, 24 transitions, 139 flow. Second operand 6 states and 720 transitions. [2020-10-16 01:32:12,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 26 transitions, 171 flow [2020-10-16 01:32:12,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 136 flow, removed 13 selfloop flow, removed 5 redundant places. [2020-10-16 01:32:12,236 INFO L241 Difference]: Finished difference. Result has 41 places, 24 transitions, 132 flow [2020-10-16 01:32:12,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2020-10-16 01:32:12,237 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2020-10-16 01:32:12,237 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 132 flow [2020-10-16 01:32:12,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:12,237 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:12,237 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:12,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:32:12,237 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:12,238 INFO L82 PathProgramCache]: Analyzing trace with hash 731186180, now seen corresponding path program 1 times [2020-10-16 01:32:12,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:12,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488712221] [2020-10-16 01:32:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:12,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:12,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:12,361 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:32:12,362 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:32:12,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:32:12,363 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:32:12,371 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L2-->L803: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In-319793274 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In-319793274 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In-319793274 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In-319793274 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-319793274 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-319793274|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-319793274 0)) (or (and (= ~x$w_buff0_used~0_Out-319793274 ~x$w_buff0_used~0_In-319793274) .cse0) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out-319793274 0))) (or (and (or (and .cse3 (= ~x$w_buff1~0_In-319793274 ~x~0_Out-319793274) .cse4) (and (= ~x~0_In-319793274 ~x~0_Out-319793274) .cse5)) .cse0) (and .cse1 (= ~x$w_buff0~0_In-319793274 ~x~0_Out-319793274) .cse2)) (= ~x$r_buff0_thd0~0_In-319793274 ~x$r_buff0_thd0~0_Out-319793274) (or (and .cse5 (= ~x$w_buff1_used~0_In-319793274 ~x$w_buff1_used~0_Out-319793274)) (and (= ~x$w_buff1_used~0_Out-319793274 0) .cse3 .cse4)) (= ~x$r_buff1_thd0~0_Out-319793274 ~x$r_buff1_thd0~0_In-319793274)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-319793274, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-319793274, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-319793274|, ~x$w_buff1~0=~x$w_buff1~0_In-319793274, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-319793274, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-319793274, ~x~0=~x~0_In-319793274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-319793274} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-319793274, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-319793274, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-319793274|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-319793274|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-319793274|, ~x$w_buff1~0=~x$w_buff1~0_In-319793274, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-319793274, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-319793274|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-319793274, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-319793274|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-319793274|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-319793274, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-319793274|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-319793274, ~x~0=~x~0_Out-319793274} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 01:32:12,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:12,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:12,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:32:12 BasicIcfg [2020-10-16 01:32:12,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:32:12,437 INFO L168 Benchmark]: Toolchain (without parser) took 16864.87 ms. Allocated memory was 253.8 MB in the beginning and 551.6 MB in the end (delta: 297.8 MB). Free memory was 208.9 MB in the beginning and 356.3 MB in the end (delta: -147.4 MB). Peak memory consumption was 150.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:12,437 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:32:12,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.67 ms. Allocated memory was 253.8 MB in the beginning and 323.5 MB in the end (delta: 69.7 MB). Free memory was 208.9 MB in the beginning and 274.0 MB in the end (delta: -65.2 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:12,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.23 ms. Allocated memory is still 323.5 MB. Free memory was 274.0 MB in the beginning and 271.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:12,439 INFO L168 Benchmark]: Boogie Preprocessor took 38.76 ms. Allocated memory is still 323.5 MB. Free memory was 271.5 MB in the beginning and 269.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:12,440 INFO L168 Benchmark]: RCFGBuilder took 2079.13 ms. Allocated memory was 323.5 MB in the beginning and 362.8 MB in the end (delta: 39.3 MB). Free memory was 269.0 MB in the beginning and 216.7 MB in the end (delta: 52.3 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:12,441 INFO L168 Benchmark]: TraceAbstraction took 13915.59 ms. Allocated memory was 362.8 MB in the beginning and 551.6 MB in the end (delta: 188.7 MB). Free memory was 216.7 MB in the beginning and 356.3 MB in the end (delta: -139.6 MB). Peak memory consumption was 49.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:12,445 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.20 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 753.67 ms. Allocated memory was 253.8 MB in the beginning and 323.5 MB in the end (delta: 69.7 MB). Free memory was 208.9 MB in the beginning and 274.0 MB in the end (delta: -65.2 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 72.23 ms. Allocated memory is still 323.5 MB. Free memory was 274.0 MB in the beginning and 271.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.76 ms. Allocated memory is still 323.5 MB. Free memory was 271.5 MB in the beginning and 269.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2079.13 ms. Allocated memory was 323.5 MB in the beginning and 362.8 MB in the end (delta: 39.3 MB). Free memory was 269.0 MB in the beginning and 216.7 MB in the end (delta: 52.3 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13915.59 ms. Allocated memory was 362.8 MB in the beginning and 551.6 MB in the end (delta: 188.7 MB). Free memory was 216.7 MB in the beginning and 356.3 MB in the end (delta: -139.6 MB). Peak memory consumption was 49.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 624 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.2s, 81 PlacesBefore, 26 PlacesAfterwards, 76 TransitionsBefore, 19 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 2995 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L706] 0 _Bool x$flush_delayed; [L707] 0 int x$mem_tmp; [L708] 0 _Bool x$r_buff0_thd0; [L709] 0 _Bool x$r_buff0_thd1; [L710] 0 _Bool x$r_buff0_thd2; [L711] 0 _Bool x$r_buff1_thd0; [L712] 0 _Bool x$r_buff1_thd1; [L713] 0 _Bool x$r_buff1_thd2; [L714] 0 _Bool x$read_delayed; [L715] 0 int *x$read_delayed_var; [L716] 0 int x$w_buff0; [L717] 0 _Bool x$w_buff0_used; [L718] 0 int x$w_buff1; [L719] 0 _Bool x$w_buff1_used; [L721] 0 int y = 0; [L722] 0 _Bool weak$$choice0; [L723] 0 _Bool weak$$choice2; [L789] 0 pthread_t t1591; [L790] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t1592; [L792] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$w_buff1 = x$w_buff0 [L748] 2 x$w_buff0 = 2 [L749] 2 x$w_buff1_used = x$w_buff0_used [L750] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L737] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L805] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 0 x$flush_delayed = weak$$choice2 [L808] 0 x$mem_tmp = x [L809] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L809] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L810] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L814] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L815] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L817] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L817] 0 x = x$flush_delayed ? x$mem_tmp : x [L818] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 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: 13.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.2s, HoareTripleCheckerStatistics: 71 SDtfs, 39 SDslu, 35 SDs, 0 SdLazy, 240 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 7001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...