/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/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:29:38,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:29:38,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:29:38,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:29:38,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:29:38,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:29:38,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:29:38,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:29:38,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:29:38,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:29:38,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:29:38,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:29:38,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:29:38,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:29:38,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:29:38,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:29:38,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:29:38,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:29:38,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:29:38,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:29:38,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:29:38,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:29:38,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:29:38,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:29:38,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:29:38,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:29:38,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:29:38,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:29:38,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:29:38,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:29:38,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:29:38,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:29:38,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:29:38,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:29:38,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:29:38,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:29:38,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:29:38,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:29:38,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:29:38,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:29:38,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:29:38,111 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:29:38,155 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:29:38,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:29:38,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:29:38,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:29:38,158 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:29:38,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:29:38,158 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:29:38,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:29:38,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:29:38,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:29:38,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:29:38,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:29:38,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:29:38,161 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:29:38,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:29:38,162 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:29:38,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:29:38,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:29:38,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:29:38,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:29:38,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:29:38,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:29:38,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:29:38,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:29:38,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:29:38,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:29:38,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:29:38,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:29:38,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:29:38,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:29:38,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:29:38,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:29:38,520 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:29:38,521 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:29:38,522 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2020-10-16 01:29:38,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974b92ef5/44067b04946644c2acc615ae0c599688/FLAG889f9d235 [2020-10-16 01:29:39,085 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:29:39,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2020-10-16 01:29:39,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974b92ef5/44067b04946644c2acc615ae0c599688/FLAG889f9d235 [2020-10-16 01:29:39,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974b92ef5/44067b04946644c2acc615ae0c599688 [2020-10-16 01:29:39,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:29:39,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:29:39,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:29:39,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:29:39,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:29:39,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:29:39" (1/1) ... [2020-10-16 01:29:39,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230a6e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:39, skipping insertion in model container [2020-10-16 01:29:39,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:29:39" (1/1) ... [2020-10-16 01:29:39,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:29:39,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:29:40,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:29:40,041 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:29:40,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:29:40,223 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:29:40,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40 WrapperNode [2020-10-16 01:29:40,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:29:40,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:29:40,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:29:40,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:29:40,234 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:29:40" (1/1) ... [2020-10-16 01:29:40,259 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:29:40" (1/1) ... [2020-10-16 01:29:40,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:29:40,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:29:40,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:29:40,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:29:40,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (1/1) ... [2020-10-16 01:29:40,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (1/1) ... [2020-10-16 01:29:40,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (1/1) ... [2020-10-16 01:29:40,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (1/1) ... [2020-10-16 01:29:40,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (1/1) ... [2020-10-16 01:29:40,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (1/1) ... [2020-10-16 01:29:40,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (1/1) ... [2020-10-16 01:29:40,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:29:40,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:29:40,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:29:40,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:29:40,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (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:29:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:29:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:29:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:29:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:29:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:29:40,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:29:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:29:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:29:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:29:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:29:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:29:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:29:40,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:29:40,408 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:29:42,420 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:29:42,421 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:29:42,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:29:42 BoogieIcfgContainer [2020-10-16 01:29:42,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:29:42,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:29:42,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:29:42,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:29:42,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:29:39" (1/3) ... [2020-10-16 01:29:42,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8de118d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:29:42, skipping insertion in model container [2020-10-16 01:29:42,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:29:40" (2/3) ... [2020-10-16 01:29:42,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8de118d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:29:42, skipping insertion in model container [2020-10-16 01:29:42,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:29:42" (3/3) ... [2020-10-16 01:29:42,432 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2020-10-16 01:29:42,445 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:29:42,453 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:29:42,454 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:29:42,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,486 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,486 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,491 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,491 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,510 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,510 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:29:42,532 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:29:42,555 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:29:42,555 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:29:42,555 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:29:42,555 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:29:42,555 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:29:42,556 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:29:42,556 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:29:42,556 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:29:42,570 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 01:29:42,625 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 01:29:42,626 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:29:42,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:29:42,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 01:29:42,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow [2020-10-16 01:29:42,642 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:29:42,646 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 01:29:42,650 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 01:29:42,651 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 189 flow [2020-10-16 01:29:42,678 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 01:29:42,679 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:29:42,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:29:42,682 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 01:29:43,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:43,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:43,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:43,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:43,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:29:43,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:43,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:29:43,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:43,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:29:43,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:43,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:29:43,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:43,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:29:43,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:43,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 01:29:43,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:43,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:29:43,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:45,341 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 01:29:45,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:29:45,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:45,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:29:45,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:29:46,177 WARN L193 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 01:29:46,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:46,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:46,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:46,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:46,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:46,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:46,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:46,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:46,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:46,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:46,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:46,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:46,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:46,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:46,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:46,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:46,692 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 01:29:46,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:29:46,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:47,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:47,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:47,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:47,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:47,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:47,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:29:47,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:47,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:47,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:47,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:47,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:47,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:29:47,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:29:47,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:47,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:29:47,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:29:48,301 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 01:29:48,451 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 01:29:48,459 INFO L132 LiptonReduction]: Checked pairs total: 4761 [2020-10-16 01:29:48,459 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 01:29:48,462 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5823 [2020-10-16 01:29:48,468 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 01:29:48,468 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:29:48,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:48,469 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:29:48,470 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1003458471, now seen corresponding path program 1 times [2020-10-16 01:29:48,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:48,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464455125] [2020-10-16 01:29:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:48,696 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:29:48,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464455125] [2020-10-16 01:29:48,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:48,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:29:48,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20905823] [2020-10-16 01:29:48,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:29:48,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:48,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:29:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:29:48,730 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 170 [2020-10-16 01:29:48,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 01:29:48,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:48,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 170 [2020-10-16 01:29:48,734 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:48,833 INFO L129 PetriNetUnfolder]: 49/132 cut-off events. [2020-10-16 01:29:48,833 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:29:48,834 INFO L80 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 132 events. 49/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 573 event pairs, 27 based on Foata normal form. 11/126 useless extension candidates. Maximal degree in co-relation 218. Up to 65 conditions per place. [2020-10-16 01:29:48,837 INFO L132 encePairwiseOnDemand]: 166/170 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 01:29:48,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 01:29:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:29:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:29:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2020-10-16 01:29:48,864 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8686274509803922 [2020-10-16 01:29:48,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2020-10-16 01:29:48,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2020-10-16 01:29:48,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:48,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2020-10-16 01:29:48,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:29:48,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:29:48,891 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:29:48,894 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 443 transitions. [2020-10-16 01:29:48,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 01:29:48,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:29:48,901 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 01:29:48,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 01:29:48,905 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 01:29:48,906 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 01:29:48,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:29:48,906 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:48,906 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:48,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:29:48,907 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1198586249, now seen corresponding path program 1 times [2020-10-16 01:29:48,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:48,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568231130] [2020-10-16 01:29:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:49,103 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:29:49,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568231130] [2020-10-16 01:29:49,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:49,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:29:49,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173409660] [2020-10-16 01:29:49,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:29:49,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:29:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:29:49,114 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 170 [2020-10-16 01:29:49,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states. [2020-10-16 01:29:49,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:49,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 170 [2020-10-16 01:29:49,117 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:49,375 INFO L129 PetriNetUnfolder]: 171/316 cut-off events. [2020-10-16 01:29:49,376 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-16 01:29:49,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 316 events. 171/316 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1580 event pairs, 87 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 624. Up to 169 conditions per place. [2020-10-16 01:29:49,379 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 10 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2020-10-16 01:29:49,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 142 flow [2020-10-16 01:29:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:29:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:29:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2020-10-16 01:29:49,383 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7788235294117647 [2020-10-16 01:29:49,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2020-10-16 01:29:49,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2020-10-16 01:29:49,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:49,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2020-10-16 01:29:49,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:29:49,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:29:49,388 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:29:49,388 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 662 transitions. [2020-10-16 01:29:49,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 142 flow [2020-10-16 01:29:49,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:29:49,391 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2020-10-16 01:29:49,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 01:29:49,392 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:29:49,392 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2020-10-16 01:29:49,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:29:49,392 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:49,392 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:49,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:29:49,393 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1499238772, now seen corresponding path program 1 times [2020-10-16 01:29:49,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:49,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528240634] [2020-10-16 01:29:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:49,555 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:29:49,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528240634] [2020-10-16 01:29:49,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:49,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:29:49,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866785488] [2020-10-16 01:29:49,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:29:49,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:49,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:29:49,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:29:49,559 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 170 [2020-10-16 01:29:49,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand 6 states. [2020-10-16 01:29:49,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:49,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 170 [2020-10-16 01:29:49,560 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:49,807 INFO L129 PetriNetUnfolder]: 113/232 cut-off events. [2020-10-16 01:29:49,807 INFO L130 PetriNetUnfolder]: For 128/130 co-relation queries the response was YES. [2020-10-16 01:29:49,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 232 events. 113/232 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1100 event pairs, 73 based on Foata normal form. 15/240 useless extension candidates. Maximal degree in co-relation 564. Up to 160 conditions per place. [2020-10-16 01:29:49,819 INFO L132 encePairwiseOnDemand]: 163/170 looper letters, 11 selfloop transitions, 6 changer transitions 8/38 dead transitions. [2020-10-16 01:29:49,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 169 flow [2020-10-16 01:29:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:29:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:29:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2020-10-16 01:29:49,823 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7441176470588236 [2020-10-16 01:29:49,823 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2020-10-16 01:29:49,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2020-10-16 01:29:49,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:49,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2020-10-16 01:29:49,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:29:49,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:29:49,827 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:29:49,827 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 6 states and 759 transitions. [2020-10-16 01:29:49,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 169 flow [2020-10-16 01:29:49,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:29:49,830 INFO L241 Difference]: Finished difference. Result has 40 places, 27 transitions, 116 flow [2020-10-16 01:29:49,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2020-10-16 01:29:49,831 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2020-10-16 01:29:49,831 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 116 flow [2020-10-16 01:29:49,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:29:49,831 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:49,831 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:49,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:29:49,832 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -403606317, now seen corresponding path program 1 times [2020-10-16 01:29:49,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:49,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446578853] [2020-10-16 01:29:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:49,934 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:29:49,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446578853] [2020-10-16 01:29:49,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:49,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:29:49,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801305657] [2020-10-16 01:29:49,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:29:49,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:29:49,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:29:49,938 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 170 [2020-10-16 01:29:49,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 116 flow. Second operand 6 states. [2020-10-16 01:29:49,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:49,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 170 [2020-10-16 01:29:49,939 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:50,145 INFO L129 PetriNetUnfolder]: 105/221 cut-off events. [2020-10-16 01:29:50,145 INFO L130 PetriNetUnfolder]: For 323/341 co-relation queries the response was YES. [2020-10-16 01:29:50,147 INFO L80 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 221 events. 105/221 cut-off events. For 323/341 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1020 event pairs, 37 based on Foata normal form. 16/231 useless extension candidates. Maximal degree in co-relation 705. Up to 129 conditions per place. [2020-10-16 01:29:50,149 INFO L132 encePairwiseOnDemand]: 162/170 looper letters, 13 selfloop transitions, 8 changer transitions 8/42 dead transitions. [2020-10-16 01:29:50,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 240 flow [2020-10-16 01:29:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:29:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:29:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2020-10-16 01:29:50,159 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.75 [2020-10-16 01:29:50,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2020-10-16 01:29:50,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2020-10-16 01:29:50,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:50,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2020-10-16 01:29:50,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:29:50,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:29:50,166 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:29:50,166 INFO L185 Difference]: Start difference. First operand has 40 places, 27 transitions, 116 flow. Second operand 6 states and 765 transitions. [2020-10-16 01:29:50,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 240 flow [2020-10-16 01:29:50,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 220 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 01:29:50,170 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 156 flow [2020-10-16 01:29:50,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2020-10-16 01:29:50,171 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2020-10-16 01:29:50,171 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 156 flow [2020-10-16 01:29:50,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:29:50,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:50,171 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:50,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:29:50,171 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash 23541928, now seen corresponding path program 1 times [2020-10-16 01:29:50,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:50,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738284243] [2020-10-16 01:29:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:50,320 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:29:50,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738284243] [2020-10-16 01:29:50,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:50,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:29:50,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367844720] [2020-10-16 01:29:50,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:29:50,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:29:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:29:50,323 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 170 [2020-10-16 01:29:50,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 156 flow. Second operand 7 states. [2020-10-16 01:29:50,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:50,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 170 [2020-10-16 01:29:50,324 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:50,531 INFO L129 PetriNetUnfolder]: 106/222 cut-off events. [2020-10-16 01:29:50,531 INFO L130 PetriNetUnfolder]: For 467/554 co-relation queries the response was YES. [2020-10-16 01:29:50,533 INFO L80 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 222 events. 106/222 cut-off events. For 467/554 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1023 event pairs, 28 based on Foata normal form. 24/240 useless extension candidates. Maximal degree in co-relation 839. Up to 135 conditions per place. [2020-10-16 01:29:50,535 INFO L132 encePairwiseOnDemand]: 161/170 looper letters, 14 selfloop transitions, 11 changer transitions 7/45 dead transitions. [2020-10-16 01:29:50,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 304 flow [2020-10-16 01:29:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:29:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:29:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2020-10-16 01:29:50,540 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2020-10-16 01:29:50,540 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2020-10-16 01:29:50,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2020-10-16 01:29:50,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:50,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2020-10-16 01:29:50,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:29:50,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:29:50,547 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:29:50,547 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 156 flow. Second operand 7 states and 884 transitions. [2020-10-16 01:29:50,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 304 flow [2020-10-16 01:29:50,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 286 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-16 01:29:50,552 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 200 flow [2020-10-16 01:29:50,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2020-10-16 01:29:50,553 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2020-10-16 01:29:50,553 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 200 flow [2020-10-16 01:29:50,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:29:50,553 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:50,554 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:50,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:29:50,554 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash 373091154, now seen corresponding path program 2 times [2020-10-16 01:29:50,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:50,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984386843] [2020-10-16 01:29:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:50,700 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:29:50,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984386843] [2020-10-16 01:29:50,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:50,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:29:50,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84896497] [2020-10-16 01:29:50,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:29:50,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:29:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:29:50,705 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 170 [2020-10-16 01:29:50,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 200 flow. Second operand 7 states. [2020-10-16 01:29:50,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:50,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 170 [2020-10-16 01:29:50,706 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:50,925 INFO L129 PetriNetUnfolder]: 110/231 cut-off events. [2020-10-16 01:29:50,925 INFO L130 PetriNetUnfolder]: For 766/860 co-relation queries the response was YES. [2020-10-16 01:29:50,926 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 231 events. 110/231 cut-off events. For 766/860 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1064 event pairs, 27 based on Foata normal form. 28/253 useless extension candidates. Maximal degree in co-relation 1050. Up to 139 conditions per place. [2020-10-16 01:29:50,928 INFO L132 encePairwiseOnDemand]: 162/170 looper letters, 15 selfloop transitions, 16 changer transitions 7/51 dead transitions. [2020-10-16 01:29:50,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 434 flow [2020-10-16 01:29:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:29:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:29:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions. [2020-10-16 01:29:50,932 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7663865546218488 [2020-10-16 01:29:50,932 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 912 transitions. [2020-10-16 01:29:50,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions. [2020-10-16 01:29:50,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:50,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions. [2020-10-16 01:29:50,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:29:50,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:29:50,937 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:29:50,938 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 200 flow. Second operand 7 states and 912 transitions. [2020-10-16 01:29:50,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 434 flow [2020-10-16 01:29:50,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 404 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 01:29:50,942 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 297 flow [2020-10-16 01:29:50,942 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2020-10-16 01:29:50,943 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 01:29:50,943 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 297 flow [2020-10-16 01:29:50,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:29:50,943 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:50,943 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:50,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:29:50,944 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash -719457540, now seen corresponding path program 3 times [2020-10-16 01:29:50,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:50,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804401135] [2020-10-16 01:29:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:51,044 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:29:51,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804401135] [2020-10-16 01:29:51,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:51,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:29:51,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134122668] [2020-10-16 01:29:51,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:29:51,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:51,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:29:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:29:51,047 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 170 [2020-10-16 01:29:51,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 297 flow. Second operand 6 states. [2020-10-16 01:29:51,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:51,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 170 [2020-10-16 01:29:51,048 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:51,281 INFO L129 PetriNetUnfolder]: 130/266 cut-off events. [2020-10-16 01:29:51,281 INFO L130 PetriNetUnfolder]: For 1931/2059 co-relation queries the response was YES. [2020-10-16 01:29:51,283 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 266 events. 130/266 cut-off events. For 1931/2059 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1235 event pairs, 28 based on Foata normal form. 36/297 useless extension candidates. Maximal degree in co-relation 1555. Up to 157 conditions per place. [2020-10-16 01:29:51,286 INFO L132 encePairwiseOnDemand]: 161/170 looper letters, 20 selfloop transitions, 18 changer transitions 4/55 dead transitions. [2020-10-16 01:29:51,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 562 flow [2020-10-16 01:29:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:29:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:29:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 895 transitions. [2020-10-16 01:29:51,291 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7521008403361344 [2020-10-16 01:29:51,291 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 895 transitions. [2020-10-16 01:29:51,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 895 transitions. [2020-10-16 01:29:51,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:51,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 895 transitions. [2020-10-16 01:29:51,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:29:51,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:29:51,297 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:29:51,297 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 297 flow. Second operand 7 states and 895 transitions. [2020-10-16 01:29:51,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 562 flow [2020-10-16 01:29:51,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 492 flow, removed 29 selfloop flow, removed 3 redundant places. [2020-10-16 01:29:51,304 INFO L241 Difference]: Finished difference. Result has 54 places, 47 transitions, 380 flow [2020-10-16 01:29:51,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2020-10-16 01:29:51,305 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2020-10-16 01:29:51,305 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 380 flow [2020-10-16 01:29:51,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:29:51,305 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:51,305 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:51,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:29:51,306 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1606076664, now seen corresponding path program 4 times [2020-10-16 01:29:51,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:51,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141839267] [2020-10-16 01:29:51,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:51,473 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:29:51,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141839267] [2020-10-16 01:29:51,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:51,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:29:51,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785743692] [2020-10-16 01:29:51,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:29:51,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:29:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:29:51,477 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 170 [2020-10-16 01:29:51,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 380 flow. Second operand 6 states. [2020-10-16 01:29:51,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:51,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 170 [2020-10-16 01:29:51,479 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:51,735 INFO L129 PetriNetUnfolder]: 137/294 cut-off events. [2020-10-16 01:29:51,736 INFO L130 PetriNetUnfolder]: For 2079/2381 co-relation queries the response was YES. [2020-10-16 01:29:51,737 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 294 events. 137/294 cut-off events. For 2079/2381 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1453 event pairs, 11 based on Foata normal form. 50/341 useless extension candidates. Maximal degree in co-relation 1781. Up to 170 conditions per place. [2020-10-16 01:29:51,741 INFO L132 encePairwiseOnDemand]: 162/170 looper letters, 21 selfloop transitions, 23 changer transitions 7/64 dead transitions. [2020-10-16 01:29:51,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 712 flow [2020-10-16 01:29:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:29:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:29:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1014 transitions. [2020-10-16 01:29:51,745 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7455882352941177 [2020-10-16 01:29:51,745 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1014 transitions. [2020-10-16 01:29:51,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1014 transitions. [2020-10-16 01:29:51,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:51,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1014 transitions. [2020-10-16 01:29:51,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:29:51,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:29:51,752 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:29:51,752 INFO L185 Difference]: Start difference. First operand has 54 places, 47 transitions, 380 flow. Second operand 8 states and 1014 transitions. [2020-10-16 01:29:51,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 712 flow [2020-10-16 01:29:51,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 636 flow, removed 31 selfloop flow, removed 4 redundant places. [2020-10-16 01:29:51,762 INFO L241 Difference]: Finished difference. Result has 59 places, 50 transitions, 456 flow [2020-10-16 01:29:51,762 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=456, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2020-10-16 01:29:51,763 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2020-10-16 01:29:51,763 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 456 flow [2020-10-16 01:29:51,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:29:51,763 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:51,763 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:51,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:29:51,764 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:51,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2094638707, now seen corresponding path program 1 times [2020-10-16 01:29:51,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:51,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681729993] [2020-10-16 01:29:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:51,824 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:29:51,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681729993] [2020-10-16 01:29:51,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:51,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:29:51,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622574958] [2020-10-16 01:29:51,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:29:51,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:29:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:29:51,828 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 170 [2020-10-16 01:29:51,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 456 flow. Second operand 4 states. [2020-10-16 01:29:51,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:51,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 170 [2020-10-16 01:29:51,829 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:51,951 INFO L129 PetriNetUnfolder]: 175/381 cut-off events. [2020-10-16 01:29:51,951 INFO L130 PetriNetUnfolder]: For 2504/2649 co-relation queries the response was YES. [2020-10-16 01:29:51,954 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 381 events. 175/381 cut-off events. For 2504/2649 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2176 event pairs, 50 based on Foata normal form. 81/449 useless extension candidates. Maximal degree in co-relation 1883. Up to 173 conditions per place. [2020-10-16 01:29:51,958 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 10 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2020-10-16 01:29:51,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 481 flow [2020-10-16 01:29:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:29:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:29:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2020-10-16 01:29:51,961 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8152941176470588 [2020-10-16 01:29:51,962 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2020-10-16 01:29:51,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2020-10-16 01:29:51,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:51,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2020-10-16 01:29:51,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:29:51,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:29:51,966 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:29:51,966 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 456 flow. Second operand 5 states and 693 transitions. [2020-10-16 01:29:51,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 481 flow [2020-10-16 01:29:51,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 433 flow, removed 16 selfloop flow, removed 5 redundant places. [2020-10-16 01:29:51,973 INFO L241 Difference]: Finished difference. Result has 59 places, 54 transitions, 445 flow [2020-10-16 01:29:51,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2020-10-16 01:29:51,974 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2020-10-16 01:29:51,974 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 445 flow [2020-10-16 01:29:51,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:29:51,974 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:51,974 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:51,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:29:51,974 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:51,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1497831956, now seen corresponding path program 1 times [2020-10-16 01:29:51,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:51,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261971285] [2020-10-16 01:29:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:52,031 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:29:52,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261971285] [2020-10-16 01:29:52,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:52,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:29:52,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468946990] [2020-10-16 01:29:52,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:29:52,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:29:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:29:52,035 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 170 [2020-10-16 01:29:52,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 445 flow. Second operand 5 states. [2020-10-16 01:29:52,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:52,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 170 [2020-10-16 01:29:52,036 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:52,129 INFO L129 PetriNetUnfolder]: 73/218 cut-off events. [2020-10-16 01:29:52,129 INFO L130 PetriNetUnfolder]: For 1090/1426 co-relation queries the response was YES. [2020-10-16 01:29:52,131 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 218 events. 73/218 cut-off events. For 1090/1426 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1171 event pairs, 9 based on Foata normal form. 156/364 useless extension candidates. Maximal degree in co-relation 976. Up to 95 conditions per place. [2020-10-16 01:29:52,133 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 6 selfloop transitions, 15 changer transitions 3/57 dead transitions. [2020-10-16 01:29:52,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 483 flow [2020-10-16 01:29:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:29:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:29:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 970 transitions. [2020-10-16 01:29:52,137 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8151260504201681 [2020-10-16 01:29:52,137 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 970 transitions. [2020-10-16 01:29:52,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 970 transitions. [2020-10-16 01:29:52,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:52,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 970 transitions. [2020-10-16 01:29:52,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:29:52,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:29:52,142 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:29:52,142 INFO L185 Difference]: Start difference. First operand has 59 places, 54 transitions, 445 flow. Second operand 7 states and 970 transitions. [2020-10-16 01:29:52,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 483 flow [2020-10-16 01:29:52,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 447 flow, removed 5 selfloop flow, removed 6 redundant places. [2020-10-16 01:29:52,147 INFO L241 Difference]: Finished difference. Result has 62 places, 54 transitions, 444 flow [2020-10-16 01:29:52,148 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2020-10-16 01:29:52,148 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2020-10-16 01:29:52,148 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 444 flow [2020-10-16 01:29:52,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:29:52,149 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:52,149 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:52,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:29:52,149 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash -900534375, now seen corresponding path program 1 times [2020-10-16 01:29:52,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:52,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653259762] [2020-10-16 01:29:52,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:52,248 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:29:52,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653259762] [2020-10-16 01:29:52,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:52,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:29:52,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793761838] [2020-10-16 01:29:52,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:29:52,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:29:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:29:52,251 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 170 [2020-10-16 01:29:52,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 444 flow. Second operand 6 states. [2020-10-16 01:29:52,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:52,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 170 [2020-10-16 01:29:52,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:52,375 INFO L129 PetriNetUnfolder]: 50/170 cut-off events. [2020-10-16 01:29:52,375 INFO L130 PetriNetUnfolder]: For 1088/1495 co-relation queries the response was YES. [2020-10-16 01:29:52,379 INFO L80 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 170 events. 50/170 cut-off events. For 1088/1495 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 911 event pairs, 3 based on Foata normal form. 147/308 useless extension candidates. Maximal degree in co-relation 825. Up to 86 conditions per place. [2020-10-16 01:29:52,426 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 2 selfloop transitions, 19 changer transitions 3/57 dead transitions. [2020-10-16 01:29:52,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 57 transitions, 510 flow [2020-10-16 01:29:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:29:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:29:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1241 transitions. [2020-10-16 01:29:52,431 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2020-10-16 01:29:52,432 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1241 transitions. [2020-10-16 01:29:52,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1241 transitions. [2020-10-16 01:29:52,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:52,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1241 transitions. [2020-10-16 01:29:52,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:29:52,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:29:52,439 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:29:52,439 INFO L185 Difference]: Start difference. First operand has 62 places, 54 transitions, 444 flow. Second operand 9 states and 1241 transitions. [2020-10-16 01:29:52,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 57 transitions, 510 flow [2020-10-16 01:29:52,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 57 transitions, 429 flow, removed 33 selfloop flow, removed 3 redundant places. [2020-10-16 01:29:52,445 INFO L241 Difference]: Finished difference. Result has 70 places, 54 transitions, 412 flow [2020-10-16 01:29:52,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2020-10-16 01:29:52,446 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2020-10-16 01:29:52,446 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 412 flow [2020-10-16 01:29:52,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:29:52,446 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:52,447 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:52,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:29:52,447 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash -225115628, now seen corresponding path program 1 times [2020-10-16 01:29:52,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:52,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052790214] [2020-10-16 01:29:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:52,670 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:29:52,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052790214] [2020-10-16 01:29:52,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:52,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:29:52,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888053560] [2020-10-16 01:29:52,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:29:52,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:29:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:29:52,674 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 170 [2020-10-16 01:29:52,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 412 flow. Second operand 10 states. [2020-10-16 01:29:52,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:52,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 170 [2020-10-16 01:29:52,675 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:53,061 INFO L129 PetriNetUnfolder]: 150/480 cut-off events. [2020-10-16 01:29:53,061 INFO L130 PetriNetUnfolder]: For 2263/2468 co-relation queries the response was YES. [2020-10-16 01:29:53,067 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2148 conditions, 480 events. 150/480 cut-off events. For 2263/2468 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3580 event pairs, 4 based on Foata normal form. 73/535 useless extension candidates. Maximal degree in co-relation 2118. Up to 102 conditions per place. [2020-10-16 01:29:53,071 INFO L132 encePairwiseOnDemand]: 161/170 looper letters, 24 selfloop transitions, 13 changer transitions 46/109 dead transitions. [2020-10-16 01:29:53,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 1055 flow [2020-10-16 01:29:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 01:29:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 01:29:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1517 transitions. [2020-10-16 01:29:53,079 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6864253393665158 [2020-10-16 01:29:53,079 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1517 transitions. [2020-10-16 01:29:53,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1517 transitions. [2020-10-16 01:29:53,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:53,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1517 transitions. [2020-10-16 01:29:53,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 01:29:53,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 01:29:53,091 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 01:29:53,091 INFO L185 Difference]: Start difference. First operand has 70 places, 54 transitions, 412 flow. Second operand 13 states and 1517 transitions. [2020-10-16 01:29:53,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 1055 flow [2020-10-16 01:29:53,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 909 flow, removed 53 selfloop flow, removed 11 redundant places. [2020-10-16 01:29:53,111 INFO L241 Difference]: Finished difference. Result has 78 places, 58 transitions, 427 flow [2020-10-16 01:29:53,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=427, PETRI_PLACES=78, PETRI_TRANSITIONS=58} [2020-10-16 01:29:53,112 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2020-10-16 01:29:53,112 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 58 transitions, 427 flow [2020-10-16 01:29:53,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:29:53,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:53,113 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:53,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:29:53,113 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -368823184, now seen corresponding path program 2 times [2020-10-16 01:29:53,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:53,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260269150] [2020-10-16 01:29:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:53,287 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:29:53,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260269150] [2020-10-16 01:29:53,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:53,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:29:53,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265994349] [2020-10-16 01:29:53,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:29:53,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:53,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:29:53,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:29:53,292 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 170 [2020-10-16 01:29:53,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 58 transitions, 427 flow. Second operand 10 states. [2020-10-16 01:29:53,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:53,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 170 [2020-10-16 01:29:53,294 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:53,712 INFO L129 PetriNetUnfolder]: 246/699 cut-off events. [2020-10-16 01:29:53,712 INFO L130 PetriNetUnfolder]: For 2453/2584 co-relation queries the response was YES. [2020-10-16 01:29:53,718 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3225 conditions, 699 events. 246/699 cut-off events. For 2453/2584 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5321 event pairs, 30 based on Foata normal form. 69/759 useless extension candidates. Maximal degree in co-relation 3199. Up to 189 conditions per place. [2020-10-16 01:29:53,722 INFO L132 encePairwiseOnDemand]: 162/170 looper letters, 24 selfloop transitions, 19 changer transitions 32/108 dead transitions. [2020-10-16 01:29:53,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 108 transitions, 888 flow [2020-10-16 01:29:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 01:29:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 01:29:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1622 transitions. [2020-10-16 01:29:53,727 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7339366515837104 [2020-10-16 01:29:53,728 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1622 transitions. [2020-10-16 01:29:53,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1622 transitions. [2020-10-16 01:29:53,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:53,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1622 transitions. [2020-10-16 01:29:53,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 01:29:53,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 01:29:53,736 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 01:29:53,737 INFO L185 Difference]: Start difference. First operand has 78 places, 58 transitions, 427 flow. Second operand 13 states and 1622 transitions. [2020-10-16 01:29:53,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 108 transitions, 888 flow [2020-10-16 01:29:53,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 852 flow, removed 10 selfloop flow, removed 7 redundant places. [2020-10-16 01:29:53,753 INFO L241 Difference]: Finished difference. Result has 86 places, 70 transitions, 591 flow [2020-10-16 01:29:53,753 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=591, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2020-10-16 01:29:53,754 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2020-10-16 01:29:53,754 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 591 flow [2020-10-16 01:29:53,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:29:53,754 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:53,754 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:53,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:29:53,754 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2106038434, now seen corresponding path program 3 times [2020-10-16 01:29:53,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:53,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512933959] [2020-10-16 01:29:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:53,811 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:29:53,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512933959] [2020-10-16 01:29:53,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:53,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:29:53,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201079955] [2020-10-16 01:29:53,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:29:53,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:53,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:29:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:29:53,814 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 170 [2020-10-16 01:29:53,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 591 flow. Second operand 5 states. [2020-10-16 01:29:53,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:53,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 170 [2020-10-16 01:29:53,815 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:53,944 INFO L129 PetriNetUnfolder]: 192/586 cut-off events. [2020-10-16 01:29:53,944 INFO L130 PetriNetUnfolder]: For 2558/2755 co-relation queries the response was YES. [2020-10-16 01:29:53,949 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 586 events. 192/586 cut-off events. For 2558/2755 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4346 event pairs, 16 based on Foata normal form. 114/682 useless extension candidates. Maximal degree in co-relation 2724. Up to 177 conditions per place. [2020-10-16 01:29:53,951 INFO L132 encePairwiseOnDemand]: 166/170 looper letters, 4 selfloop transitions, 2 changer transitions 9/72 dead transitions. [2020-10-16 01:29:53,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 72 transitions, 613 flow [2020-10-16 01:29:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:29:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:29:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2020-10-16 01:29:53,955 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8094117647058824 [2020-10-16 01:29:53,955 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2020-10-16 01:29:53,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2020-10-16 01:29:53,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:53,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2020-10-16 01:29:53,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:29:53,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:29:53,959 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:29:53,959 INFO L185 Difference]: Start difference. First operand has 86 places, 70 transitions, 591 flow. Second operand 5 states and 688 transitions. [2020-10-16 01:29:53,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 72 transitions, 613 flow [2020-10-16 01:29:53,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 584 flow, removed 9 selfloop flow, removed 6 redundant places. [2020-10-16 01:29:53,973 INFO L241 Difference]: Finished difference. Result has 82 places, 63 transitions, 517 flow [2020-10-16 01:29:53,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2020-10-16 01:29:53,974 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2020-10-16 01:29:53,974 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 517 flow [2020-10-16 01:29:53,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:29:53,974 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:53,974 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:53,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:29:53,975 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash -249161410, now seen corresponding path program 4 times [2020-10-16 01:29:53,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:53,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596676840] [2020-10-16 01:29:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:29:54,125 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:29:54,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596676840] [2020-10-16 01:29:54,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:29:54,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:29:54,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93897250] [2020-10-16 01:29:54,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:29:54,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:29:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:29:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:29:54,129 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 170 [2020-10-16 01:29:54,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 517 flow. Second operand 10 states. [2020-10-16 01:29:54,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:29:54,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 170 [2020-10-16 01:29:54,131 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:29:54,542 INFO L129 PetriNetUnfolder]: 279/815 cut-off events. [2020-10-16 01:29:54,542 INFO L130 PetriNetUnfolder]: For 4430/4814 co-relation queries the response was YES. [2020-10-16 01:29:54,549 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 815 events. 279/815 cut-off events. For 4430/4814 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6435 event pairs, 34 based on Foata normal form. 159/953 useless extension candidates. Maximal degree in co-relation 4017. Up to 271 conditions per place. [2020-10-16 01:29:54,552 INFO L132 encePairwiseOnDemand]: 162/170 looper letters, 21 selfloop transitions, 17 changer transitions 20/77 dead transitions. [2020-10-16 01:29:54,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 77 transitions, 703 flow [2020-10-16 01:29:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:29:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:29:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1368 transitions. [2020-10-16 01:29:54,558 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7315508021390374 [2020-10-16 01:29:54,558 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1368 transitions. [2020-10-16 01:29:54,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1368 transitions. [2020-10-16 01:29:54,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:29:54,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1368 transitions. [2020-10-16 01:29:54,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:29:54,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:29:54,566 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:29:54,566 INFO L185 Difference]: Start difference. First operand has 82 places, 63 transitions, 517 flow. Second operand 11 states and 1368 transitions. [2020-10-16 01:29:54,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 77 transitions, 703 flow [2020-10-16 01:29:54,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 77 transitions, 690 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:29:54,583 INFO L241 Difference]: Finished difference. Result has 92 places, 53 transitions, 454 flow [2020-10-16 01:29:54,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=454, PETRI_PLACES=92, PETRI_TRANSITIONS=53} [2020-10-16 01:29:54,584 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2020-10-16 01:29:54,584 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 53 transitions, 454 flow [2020-10-16 01:29:54,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:29:54,584 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:29:54,584 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:29:54,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:29:54,585 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:29:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:29:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1858082388, now seen corresponding path program 5 times [2020-10-16 01:29:54,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:29:54,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331835926] [2020-10-16 01:29:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:29:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:29:54,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:29:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:29:54,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:29:54,743 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:29:54,745 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:29:54,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:29:54,772 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:29:54,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,774 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:29:54,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,774 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:29:54,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,774 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:29:54,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,775 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:29:54,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,775 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:29:54,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,776 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:29:54,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,777 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:29:54,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,777 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:29:54,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,777 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:29:54,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,778 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:29:54,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,778 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:29:54,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,779 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:29:54,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,779 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:29:54,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,779 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:29:54,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,780 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:29:54,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,780 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:29:54,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,780 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:29:54,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,781 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:29:54,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,786 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:29:54,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,787 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:29:54,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,787 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:29:54,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,787 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:29:54,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,788 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:29:54,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,788 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:29:54,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,788 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:29:54,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,789 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:29:54,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,789 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:29:54,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,789 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:29:54,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,789 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:29:54,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,790 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:29:54,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,790 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:29:54,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,791 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:29:54,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,791 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:29:54,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,791 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:29:54,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,792 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:29:54,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:29:54,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:29:54 BasicIcfg [2020-10-16 01:29:54,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:29:54,894 INFO L168 Benchmark]: Toolchain (without parser) took 15456.15 ms. Allocated memory was 248.5 MB in the beginning and 580.9 MB in the end (delta: 332.4 MB). Free memory was 204.3 MB in the beginning and 421.0 MB in the end (delta: -216.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:29:54,895 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:29:54,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.66 ms. Allocated memory was 248.5 MB in the beginning and 306.7 MB in the end (delta: 58.2 MB). Free memory was 204.3 MB in the beginning and 257.4 MB in the end (delta: -53.1 MB). Peak memory consumption was 32.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:29:54,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.27 ms. Allocated memory is still 306.7 MB. Free memory was 257.4 MB in the beginning and 252.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:29:54,900 INFO L168 Benchmark]: Boogie Preprocessor took 38.41 ms. Allocated memory is still 306.7 MB. Free memory was 252.4 MB in the beginning and 249.8 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:29:54,901 INFO L168 Benchmark]: RCFGBuilder took 2090.29 ms. Allocated memory was 306.7 MB in the beginning and 356.0 MB in the end (delta: 49.3 MB). Free memory was 249.8 MB in the beginning and 181.8 MB in the end (delta: 68.1 MB). Peak memory consumption was 117.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:29:54,904 INFO L168 Benchmark]: TraceAbstraction took 12465.75 ms. Allocated memory was 356.0 MB in the beginning and 580.9 MB in the end (delta: 224.9 MB). Free memory was 181.8 MB in the beginning and 421.0 MB in the end (delta: -239.2 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:29:54,910 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 786.66 ms. Allocated memory was 248.5 MB in the beginning and 306.7 MB in the end (delta: 58.2 MB). Free memory was 204.3 MB in the beginning and 257.4 MB in the end (delta: -53.1 MB). Peak memory consumption was 32.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.27 ms. Allocated memory is still 306.7 MB. Free memory was 257.4 MB in the beginning and 252.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.41 ms. Allocated memory is still 306.7 MB. Free memory was 252.4 MB in the beginning and 249.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2090.29 ms. Allocated memory was 306.7 MB in the beginning and 356.0 MB in the end (delta: 49.3 MB). Free memory was 249.8 MB in the beginning and 181.8 MB in the end (delta: 68.1 MB). Peak memory consumption was 117.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12465.75 ms. Allocated memory was 356.0 MB in the beginning and 580.9 MB in the end (delta: 224.9 MB). Free memory was 181.8 MB in the beginning and 421.0 MB in the end (delta: -239.2 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1065 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 128 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.8s, 98 PlacesBefore, 34 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4761 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1403; [L810] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 0 pthread_t t1404; [L812] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t1405; [L814] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L787] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L791] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L839] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L839] 0 x = x$flush_delayed ? x$mem_tmp : x [L840] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 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: 12.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 81 SDtfs, 106 SDslu, 121 SDs, 0 SdLazy, 982 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 22919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...