/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/rfi001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:32:27,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:32:27,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:32:27,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:32:27,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:32:27,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:32:27,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:32:27,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:32:27,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:32:27,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:32:27,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:32:27,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:32:27,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:32:27,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:32:27,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:32:27,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:32:27,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:32:27,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:32:27,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:32:27,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:32:27,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:32:27,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:32:27,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:32:27,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:32:27,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:32:27,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:32:27,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:32:27,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:32:27,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:32:27,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:32:27,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:32:27,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:32:27,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:32:27,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:32:27,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:32:27,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:32:27,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:32:27,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:32:27,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:32:27,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:32:27,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:32:27,322 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:32:27,363 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:32:27,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:32:27,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:32:27,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:32:27,365 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:32:27,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:32:27,365 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:32:27,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:32:27,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:32:27,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:32:27,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:32:27,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:32:27,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:32:27,368 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:32:27,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:32:27,368 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:32:27,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:32:27,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:32:27,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:32:27,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:32:27,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:32:27,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:32:27,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:32:27,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:32:27,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:32:27,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:32:27,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:32:27,371 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:32:27,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:32:27,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:32:27,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:32:27,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:32:27,669 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:32:27,669 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:32:27,670 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2020-10-16 01:32:27,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cae1091/4482041600894a5b9dd8ff86d54f3409/FLAG765923407 [2020-10-16 01:32:28,294 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:32:28,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2020-10-16 01:32:28,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cae1091/4482041600894a5b9dd8ff86d54f3409/FLAG765923407 [2020-10-16 01:32:28,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cae1091/4482041600894a5b9dd8ff86d54f3409 [2020-10-16 01:32:28,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:32:28,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:32:28,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:28,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:32:28,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:32:28,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3b9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28, skipping insertion in model container [2020-10-16 01:32:28,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:32:28,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:32:29,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:29,372 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:32:29,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:29,495 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:32:29,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29 WrapperNode [2020-10-16 01:32:29,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:29,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:29,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:32:29,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:32:29,506 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:32:29" (1/1) ... [2020-10-16 01:32:29,526 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:32:29" (1/1) ... [2020-10-16 01:32:29,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:29,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:32:29,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:32:29,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:32:29,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (1/1) ... [2020-10-16 01:32:29,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (1/1) ... [2020-10-16 01:32:29,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (1/1) ... [2020-10-16 01:32:29,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (1/1) ... [2020-10-16 01:32:29,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (1/1) ... [2020-10-16 01:32:29,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (1/1) ... [2020-10-16 01:32:29,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (1/1) ... [2020-10-16 01:32:29,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:32:29,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:32:29,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:32:29,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:32:29,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (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:32:29,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:32:29,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:32:29,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:32:29,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:32:29,680 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:32:29,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:32:29,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:32:29,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:32:29,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:32:29,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:32:29,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:32:29,683 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:32:31,574 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:32:31,574 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:32:31,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:31 BoogieIcfgContainer [2020-10-16 01:32:31,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:32:31,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:32:31,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:32:31,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:32:31,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:32:28" (1/3) ... [2020-10-16 01:32:31,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cde5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:31, skipping insertion in model container [2020-10-16 01:32:31,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:29" (2/3) ... [2020-10-16 01:32:31,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cde5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:31, skipping insertion in model container [2020-10-16 01:32:31,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:31" (3/3) ... [2020-10-16 01:32:31,585 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt.i [2020-10-16 01:32:31,597 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:32:31,604 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:32:31,605 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:32:31,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,632 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,632 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,644 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,644 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:31,670 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:32:31,691 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:32:31,692 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:32:31,692 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:32:31,692 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:32:31,692 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:32:31,692 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:32:31,692 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:32:31,693 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:32:31,706 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2020-10-16 01:32:31,746 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-16 01:32:31,747 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:31,751 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 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/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:32:31,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2020-10-16 01:32:31,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:31,761 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:32:31,763 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:31,766 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:31,767 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:31,787 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-16 01:32:31,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:31,788 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 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/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:32:31,791 INFO L117 LiptonReduction]: Number of co-enabled transitions 1012 [2020-10-16 01:32:31,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:31,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:31,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:31,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:31,908 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:31,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:31,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:31,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:31,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:31,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:31,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:31,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:31,952 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:31,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:31,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:31,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:32,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:32,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:32,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:32,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:32,134 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:32,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:32,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:32,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:32,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:32,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:32,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:32,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:32,160 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:32,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:32,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:32,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:32,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:32,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:32,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:32:32,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:32,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:32,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:32,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:32:32,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,561 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 01:32:33,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:32:33,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:32:33,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,799 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 01:32:34,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:34,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,917 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:34,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:34,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:34,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:34,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:34,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,944 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:34,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:34,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:34,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-16 01:32:35,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:35,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:35,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-16 01:32:35,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:35,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:35,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:36,310 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-16 01:32:36,425 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 01:32:36,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:36,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:36,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,512 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:36,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:36,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:36,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:36,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:36,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:36,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,532 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:36,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:36,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:36,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:36,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:36,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:36,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,621 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:36,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:36,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:36,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:36,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:36,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:36,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:36,644 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:36,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:36,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:36,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,153 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:32:37,281 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 01:32:37,286 INFO L132 LiptonReduction]: Checked pairs total: 2464 [2020-10-16 01:32:37,286 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 01:32:37,289 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5530 [2020-10-16 01:32:37,296 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 01:32:37,296 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:37,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:37,297 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:32:37,298 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:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash 874871657, now seen corresponding path program 1 times [2020-10-16 01:32:37,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:37,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291138220] [2020-10-16 01:32:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:37,523 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:37,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291138220] [2020-10-16 01:32:37,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:37,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:37,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063007490] [2020-10-16 01:32:37,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:37,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:37,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:37,556 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 148 [2020-10-16 01:32:37,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 01:32:37,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:37,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 148 [2020-10-16 01:32:37,560 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:37,620 INFO L129 PetriNetUnfolder]: 16/60 cut-off events. [2020-10-16 01:32:37,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:37,621 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 60 events. 16/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 207 event pairs, 6 based on Foata normal form. 6/58 useless extension candidates. Maximal degree in co-relation 93. Up to 27 conditions per place. [2020-10-16 01:32:37,623 INFO L132 encePairwiseOnDemand]: 144/148 looper letters, 7 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2020-10-16 01:32:37,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 66 flow [2020-10-16 01:32:37,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2020-10-16 01:32:37,642 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8513513513513513 [2020-10-16 01:32:37,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2020-10-16 01:32:37,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2020-10-16 01:32:37,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:37,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2020-10-16 01:32:37,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:37,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:37,662 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:37,664 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 378 transitions. [2020-10-16 01:32:37,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 66 flow [2020-10-16 01:32:37,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:37,670 INFO L241 Difference]: Finished difference. Result has 25 places, 18 transitions, 44 flow [2020-10-16 01:32:37,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, 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=44, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2020-10-16 01:32:37,674 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2020-10-16 01:32:37,674 INFO L481 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2020-10-16 01:32:37,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:37,674 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:37,675 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:37,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:32:37,675 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:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1440942465, now seen corresponding path program 1 times [2020-10-16 01:32:37,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:37,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498218710] [2020-10-16 01:32:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:37,830 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:37,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498218710] [2020-10-16 01:32:37,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:37,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:37,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552026482] [2020-10-16 01:32:37,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:37,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:37,835 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 148 [2020-10-16 01:32:37,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand 4 states. [2020-10-16 01:32:37,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:37,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 148 [2020-10-16 01:32:37,837 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:37,876 INFO L129 PetriNetUnfolder]: 2/26 cut-off events. [2020-10-16 01:32:37,876 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:37,876 INFO L80 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 26 events. 2/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2020-10-16 01:32:37,877 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 2 selfloop transitions, 2 changer transitions 5/22 dead transitions. [2020-10-16 01:32:37,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 70 flow [2020-10-16 01:32:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2020-10-16 01:32:37,881 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8121621621621622 [2020-10-16 01:32:37,881 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2020-10-16 01:32:37,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2020-10-16 01:32:37,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:37,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2020-10-16 01:32:37,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:37,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:37,887 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:37,887 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 601 transitions. [2020-10-16 01:32:37,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 70 flow [2020-10-16 01:32:37,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:37,888 INFO L241 Difference]: Finished difference. Result has 30 places, 17 transitions, 50 flow [2020-10-16 01:32:37,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, 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=5, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2020-10-16 01:32:37,889 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2020-10-16 01:32:37,890 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 50 flow [2020-10-16 01:32:37,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:37,890 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:37,890 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:37,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:32:37,890 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:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1678036957, now seen corresponding path program 1 times [2020-10-16 01:32:37,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:37,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946553966] [2020-10-16 01:32:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:38,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946553966] [2020-10-16 01:32:38,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:38,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:38,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886627189] [2020-10-16 01:32:38,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:38,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:38,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:38,100 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 148 [2020-10-16 01:32:38,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 50 flow. Second operand 6 states. [2020-10-16 01:32:38,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:38,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 148 [2020-10-16 01:32:38,101 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:38,248 INFO L129 PetriNetUnfolder]: 28/86 cut-off events. [2020-10-16 01:32:38,248 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2020-10-16 01:32:38,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 86 events. 28/86 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 325 event pairs, 17 based on Foata normal form. 6/88 useless extension candidates. Maximal degree in co-relation 169. Up to 50 conditions per place. [2020-10-16 01:32:38,250 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 9 selfloop transitions, 5 changer transitions 6/29 dead transitions. [2020-10-16 01:32:38,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 116 flow [2020-10-16 01:32:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2020-10-16 01:32:38,254 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6936936936936937 [2020-10-16 01:32:38,254 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2020-10-16 01:32:38,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2020-10-16 01:32:38,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:38,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2020-10-16 01:32:38,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:38,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:38,258 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:38,258 INFO L185 Difference]: Start difference. First operand has 30 places, 17 transitions, 50 flow. Second operand 6 states and 616 transitions. [2020-10-16 01:32:38,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 116 flow [2020-10-16 01:32:38,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 108 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:38,260 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 80 flow [2020-10-16 01:32:38,261 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2020-10-16 01:32:38,261 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2020-10-16 01:32:38,262 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 80 flow [2020-10-16 01:32:38,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:38,263 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:38,263 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:38,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:32:38,263 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:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:38,264 INFO L82 PathProgramCache]: Analyzing trace with hash -252178703, now seen corresponding path program 1 times [2020-10-16 01:32:38,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:38,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33882548] [2020-10-16 01:32:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:38,478 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:38,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33882548] [2020-10-16 01:32:38,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:38,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:38,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199465979] [2020-10-16 01:32:38,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:38,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:38,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:38,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:38,486 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 148 [2020-10-16 01:32:38,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 80 flow. Second operand 7 states. [2020-10-16 01:32:38,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:38,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 148 [2020-10-16 01:32:38,487 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:38,721 INFO L129 PetriNetUnfolder]: 24/83 cut-off events. [2020-10-16 01:32:38,722 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2020-10-16 01:32:38,723 INFO L80 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 83 events. 24/83 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 297 event pairs, 2 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 202. Up to 33 conditions per place. [2020-10-16 01:32:38,724 INFO L132 encePairwiseOnDemand]: 140/148 looper letters, 10 selfloop transitions, 12 changer transitions 5/36 dead transitions. [2020-10-16 01:32:38,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 184 flow [2020-10-16 01:32:38,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 819 transitions. [2020-10-16 01:32:38,728 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.691722972972973 [2020-10-16 01:32:38,728 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 819 transitions. [2020-10-16 01:32:38,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 819 transitions. [2020-10-16 01:32:38,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:38,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 819 transitions. [2020-10-16 01:32:38,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:38,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:38,734 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:38,735 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 80 flow. Second operand 8 states and 819 transitions. [2020-10-16 01:32:38,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 184 flow [2020-10-16 01:32:38,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 182 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:38,738 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 148 flow [2020-10-16 01:32:38,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2020-10-16 01:32:38,739 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2020-10-16 01:32:38,739 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 148 flow [2020-10-16 01:32:38,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:38,739 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:38,739 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:38,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:32:38,739 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:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:38,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1192359262, now seen corresponding path program 1 times [2020-10-16 01:32:38,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:38,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730413395] [2020-10-16 01:32:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:38,853 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:38,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730413395] [2020-10-16 01:32:38,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:38,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:38,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107252886] [2020-10-16 01:32:38,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:38,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:38,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:38,857 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 148 [2020-10-16 01:32:38,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 148 flow. Second operand 4 states. [2020-10-16 01:32:38,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:38,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 148 [2020-10-16 01:32:38,857 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:38,956 INFO L129 PetriNetUnfolder]: 61/158 cut-off events. [2020-10-16 01:32:38,956 INFO L130 PetriNetUnfolder]: For 274/276 co-relation queries the response was YES. [2020-10-16 01:32:38,957 INFO L80 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 158 events. 61/158 cut-off events. For 274/276 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 652 event pairs, 11 based on Foata normal form. 18/176 useless extension candidates. Maximal degree in co-relation 496. Up to 80 conditions per place. [2020-10-16 01:32:38,959 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 19 selfloop transitions, 6 changer transitions 1/36 dead transitions. [2020-10-16 01:32:38,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 240 flow [2020-10-16 01:32:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:32:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:32:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2020-10-16 01:32:38,962 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.722972972972973 [2020-10-16 01:32:38,962 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2020-10-16 01:32:38,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2020-10-16 01:32:38,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:38,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2020-10-16 01:32:38,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:32:38,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:32:38,965 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:32:38,965 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 148 flow. Second operand 4 states and 428 transitions. [2020-10-16 01:32:38,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 240 flow [2020-10-16 01:32:38,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 208 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:38,970 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 146 flow [2020-10-16 01:32:38,970 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2020-10-16 01:32:38,970 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2020-10-16 01:32:38,970 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 146 flow [2020-10-16 01:32:38,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:38,970 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:38,971 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:38,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:32:38,971 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:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1518460280, now seen corresponding path program 2 times [2020-10-16 01:32:38,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:38,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209656092] [2020-10-16 01:32:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:39,037 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:39,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209656092] [2020-10-16 01:32:39,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:39,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:39,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084449840] [2020-10-16 01:32:39,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:39,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:39,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:39,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:39,040 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2020-10-16 01:32:39,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 146 flow. Second operand 4 states. [2020-10-16 01:32:39,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:39,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2020-10-16 01:32:39,041 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:39,078 INFO L129 PetriNetUnfolder]: 15/69 cut-off events. [2020-10-16 01:32:39,078 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2020-10-16 01:32:39,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 69 events. 15/69 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 236 event pairs, 2 based on Foata normal form. 7/70 useless extension candidates. Maximal degree in co-relation 201. Up to 19 conditions per place. [2020-10-16 01:32:39,079 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 6 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2020-10-16 01:32:39,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 185 flow [2020-10-16 01:32:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:32:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:32:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2020-10-16 01:32:39,082 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8040540540540541 [2020-10-16 01:32:39,082 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2020-10-16 01:32:39,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2020-10-16 01:32:39,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:39,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2020-10-16 01:32:39,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:32:39,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:32:39,086 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:32:39,086 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 146 flow. Second operand 4 states and 476 transitions. [2020-10-16 01:32:39,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 185 flow [2020-10-16 01:32:39,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 169 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:39,089 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 169 flow [2020-10-16 01:32:39,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2020-10-16 01:32:39,089 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2020-10-16 01:32:39,089 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 169 flow [2020-10-16 01:32:39,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:39,090 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:39,090 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:39,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:32:39,090 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:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -850783059, now seen corresponding path program 1 times [2020-10-16 01:32:39,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:39,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073608321] [2020-10-16 01:32:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:39,158 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:39,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073608321] [2020-10-16 01:32:39,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:39,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:39,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287484204] [2020-10-16 01:32:39,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:39,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:39,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:39,162 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2020-10-16 01:32:39,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 169 flow. Second operand 5 states. [2020-10-16 01:32:39,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:39,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2020-10-16 01:32:39,163 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:39,214 INFO L129 PetriNetUnfolder]: 8/48 cut-off events. [2020-10-16 01:32:39,215 INFO L130 PetriNetUnfolder]: For 82/108 co-relation queries the response was YES. [2020-10-16 01:32:39,216 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 48 events. 8/48 cut-off events. For 82/108 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 132 event pairs, 0 based on Foata normal form. 8/50 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2020-10-16 01:32:39,216 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 3 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2020-10-16 01:32:39,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 195 flow [2020-10-16 01:32:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2020-10-16 01:32:39,220 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7986486486486486 [2020-10-16 01:32:39,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2020-10-16 01:32:39,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2020-10-16 01:32:39,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:39,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2020-10-16 01:32:39,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:39,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:39,226 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:39,226 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 169 flow. Second operand 5 states and 591 transitions. [2020-10-16 01:32:39,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 195 flow [2020-10-16 01:32:39,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 182 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:39,229 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 190 flow [2020-10-16 01:32:39,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2020-10-16 01:32:39,230 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2020-10-16 01:32:39,230 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 190 flow [2020-10-16 01:32:39,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:39,230 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:39,231 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:39,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:32:39,231 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:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash 448838538, now seen corresponding path program 1 times [2020-10-16 01:32:39,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:39,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656831047] [2020-10-16 01:32:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:39,334 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:39,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656831047] [2020-10-16 01:32:39,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:39,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:39,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391468011] [2020-10-16 01:32:39,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:39,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:39,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:39,339 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 148 [2020-10-16 01:32:39,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 190 flow. Second operand 7 states. [2020-10-16 01:32:39,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:39,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 148 [2020-10-16 01:32:39,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:39,477 INFO L129 PetriNetUnfolder]: 17/96 cut-off events. [2020-10-16 01:32:39,477 INFO L130 PetriNetUnfolder]: For 300/323 co-relation queries the response was YES. [2020-10-16 01:32:39,478 INFO L80 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 96 events. 17/96 cut-off events. For 300/323 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 435 event pairs, 3 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 341. Up to 36 conditions per place. [2020-10-16 01:32:39,479 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 10 selfloop transitions, 2 changer transitions 17/42 dead transitions. [2020-10-16 01:32:39,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 305 flow [2020-10-16 01:32:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 712 transitions. [2020-10-16 01:32:39,482 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6872586872586872 [2020-10-16 01:32:39,482 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 712 transitions. [2020-10-16 01:32:39,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 712 transitions. [2020-10-16 01:32:39,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:39,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 712 transitions. [2020-10-16 01:32:39,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:39,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:39,488 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:39,488 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 190 flow. Second operand 7 states and 712 transitions. [2020-10-16 01:32:39,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 305 flow [2020-10-16 01:32:39,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 295 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:39,492 INFO L241 Difference]: Finished difference. Result has 52 places, 25 transitions, 153 flow [2020-10-16 01:32:39,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2020-10-16 01:32:39,493 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2020-10-16 01:32:39,493 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 25 transitions, 153 flow [2020-10-16 01:32:39,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:39,493 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:39,494 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:39,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:32:39,494 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:39,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash -228506970, now seen corresponding path program 2 times [2020-10-16 01:32:39,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:39,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266725127] [2020-10-16 01:32:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:39,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:39,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:39,643 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:32:39,643 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:32:39,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:32:39,666 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:39,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,671 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:39,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,672 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:39,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,672 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:39,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,673 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:39,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,674 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:39,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,675 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:39,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,675 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:39,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,676 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:39,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,676 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:39,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,676 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:39,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,679 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:39,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,679 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:39,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,680 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:39,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,680 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:39,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,680 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:39,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,681 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:39,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,682 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:39,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,683 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:39,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,683 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:39,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,683 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:39,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,684 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:39,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,684 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:39,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,685 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:39,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,685 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:39,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,685 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:39,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,686 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:39,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,686 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:39,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,687 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:39,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:39,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:32:39 BasicIcfg [2020-10-16 01:32:39,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:32:39,744 INFO L168 Benchmark]: Toolchain (without parser) took 11103.49 ms. Allocated memory was 252.7 MB in the beginning and 499.6 MB in the end (delta: 246.9 MB). Free memory was 207.8 MB in the beginning and 166.0 MB in the end (delta: 41.8 MB). Peak memory consumption was 288.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:39,745 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:32:39,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.62 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 207.8 MB in the beginning and 267.1 MB in the end (delta: -59.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:39,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.21 ms. Allocated memory is still 318.8 MB. Free memory was 267.1 MB in the beginning and 264.6 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:39,747 INFO L168 Benchmark]: Boogie Preprocessor took 38.47 ms. Allocated memory is still 318.8 MB. Free memory was 264.6 MB in the beginning and 262.1 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:39,748 INFO L168 Benchmark]: RCFGBuilder took 1967.35 ms. Allocated memory was 318.8 MB in the beginning and 360.2 MB in the end (delta: 41.4 MB). Free memory was 262.1 MB in the beginning and 215.6 MB in the end (delta: 46.5 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:39,749 INFO L168 Benchmark]: TraceAbstraction took 8164.25 ms. Allocated memory was 360.2 MB in the beginning and 499.6 MB in the end (delta: 139.5 MB). Free memory was 212.4 MB in the beginning and 166.0 MB in the end (delta: 46.4 MB). Peak memory consumption was 185.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:39,754 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.25 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 853.62 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 207.8 MB in the beginning and 267.1 MB in the end (delta: -59.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 74.21 ms. Allocated memory is still 318.8 MB. Free memory was 267.1 MB in the beginning and 264.6 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.47 ms. Allocated memory is still 318.8 MB. Free memory was 264.6 MB in the beginning and 262.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1967.35 ms. Allocated memory was 318.8 MB in the beginning and 360.2 MB in the end (delta: 41.4 MB). Free memory was 262.1 MB in the beginning and 215.6 MB in the end (delta: 46.5 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8164.25 ms. Allocated memory was 360.2 MB in the beginning and 499.6 MB in the end (delta: 139.5 MB). Free memory was 212.4 MB in the beginning and 166.0 MB in the end (delta: 46.4 MB). Peak memory consumption was 185.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 625 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 51 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 82 PlacesBefore, 26 PlacesAfterwards, 77 TransitionsBefore, 20 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 2464 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; [L707] 0 int y = 0; [L708] 0 _Bool y$flush_delayed; [L709] 0 int y$mem_tmp; [L710] 0 _Bool y$r_buff0_thd0; [L711] 0 _Bool y$r_buff0_thd1; [L712] 0 _Bool y$r_buff0_thd2; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$read_delayed; [L717] 0 int *y$read_delayed_var; [L718] 0 int y$w_buff0; [L719] 0 _Bool y$w_buff0_used; [L720] 0 int y$w_buff1; [L721] 0 _Bool y$w_buff1_used; [L723] 0 int z = 0; [L724] 0 _Bool weak$$choice0; [L725] 0 _Bool weak$$choice2; [L791] 0 pthread_t t1615; [L792] FCALL, FORK 0 pthread_create(&t1615, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 0 pthread_t t1616; [L794] FCALL, FORK 0 pthread_create(&t1616, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 2 y$w_buff1 = y$w_buff0 [L750] 2 y$w_buff0 = 2 [L751] 2 y$w_buff1_used = y$w_buff0_used [L752] 2 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L754] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L755] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L756] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L757] 2 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 z = 1 [L763] 2 __unbuffered_p1_EAX = z 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 __unbuffered_p1_EBX = x 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L737] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L739] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L744] 1 return 0; [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 0 y$flush_delayed = weak$$choice2 [L810] 0 y$mem_tmp = y [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L819] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L819] 0 y = y$flush_delayed ? y$mem_tmp : y [L820] 0 y$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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 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: 7.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 34 SDtfs, 27 SDslu, 39 SDs, 0 SdLazy, 186 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=7, 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.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 5041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...