/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/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:38:38,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:38:38,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:38:38,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:38:38,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:38:38,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:38:38,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:38:38,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:38:38,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:38:38,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:38:38,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:38:38,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:38:38,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:38:38,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:38:38,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:38:38,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:38:38,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:38:38,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:38:38,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:38:38,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:38:38,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:38:38,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:38:38,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:38:38,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:38:38,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:38:38,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:38:38,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:38:38,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:38:38,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:38:38,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:38:38,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:38:38,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:38:38,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:38:38,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:38:38,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:38:38,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:38:38,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:38:38,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:38:38,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:38:38,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:38:38,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:38:38,067 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:38:38,089 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:38:38,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:38:38,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:38:38,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:38:38,091 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:38:38,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:38:38,091 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:38:38,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:38:38,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:38:38,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:38:38,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:38:38,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:38:38,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:38:38,093 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:38:38,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:38:38,093 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:38:38,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:38:38,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:38:38,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:38:38,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:38:38,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:38:38,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:38:38,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:38:38,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:38:38,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:38:38,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:38:38,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:38:38,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:38:38,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:38:38,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:38:38,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:38:38,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:38:38,426 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:38:38,426 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:38:38,427 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2020-10-16 01:38:38,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fc2fac9/d89d484f86d54a5098698465a37eadb9/FLAG03ec0a25f [2020-10-16 01:38:38,956 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:38:38,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2020-10-16 01:38:38,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fc2fac9/d89d484f86d54a5098698465a37eadb9/FLAG03ec0a25f [2020-10-16 01:38:39,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fc2fac9/d89d484f86d54a5098698465a37eadb9 [2020-10-16 01:38:39,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:38:39,248 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:38:39,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:38:39,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:38:39,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:38:39,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:39" (1/1) ... [2020-10-16 01:38:39,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c10ed73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:39, skipping insertion in model container [2020-10-16 01:38:39,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:39" (1/1) ... [2020-10-16 01:38:39,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:38:39,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:38:39,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:38:39,805 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:38:39,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:38:40,003 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:38:40,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40 WrapperNode [2020-10-16 01:38:40,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:38:40,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:38:40,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:38:40,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:38:40,016 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:38:40" (1/1) ... [2020-10-16 01:38:40,036 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:38:40" (1/1) ... [2020-10-16 01:38:40,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:38:40,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:38:40,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:38:40,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:38:40,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (1/1) ... [2020-10-16 01:38:40,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (1/1) ... [2020-10-16 01:38:40,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (1/1) ... [2020-10-16 01:38:40,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (1/1) ... [2020-10-16 01:38:40,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (1/1) ... [2020-10-16 01:38:40,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (1/1) ... [2020-10-16 01:38:40,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (1/1) ... [2020-10-16 01:38:40,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:38:40,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:38:40,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:38:40,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:38:40,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38: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:38:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:38:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:38:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:38:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:38:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:38:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:38:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:38:40,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:38:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:38:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:38:40,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:38:40,215 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:38:41,989 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:38:41,989 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:38:41,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:41 BoogieIcfgContainer [2020-10-16 01:38:41,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:38:41,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:38:41,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:38:41,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:38:41,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:38:39" (1/3) ... [2020-10-16 01:38:41,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1004c9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:41, skipping insertion in model container [2020-10-16 01:38:41,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:40" (2/3) ... [2020-10-16 01:38:41,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1004c9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:41, skipping insertion in model container [2020-10-16 01:38:41,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:41" (3/3) ... [2020-10-16 01:38:42,000 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2020-10-16 01:38:42,012 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:38:42,019 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:38:42,020 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:38:42,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,047 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,048 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,048 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,052 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,052 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,059 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,060 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,060 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:42,088 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:38:42,110 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:38:42,110 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:38:42,110 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:38:42,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:38:42,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:38:42,111 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:38:42,111 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:38:42,111 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:38:42,125 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 01:38:42,163 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 01:38:42,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:42,168 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 01:38:42,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 01:38:42,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 73 transitions, 152 flow [2020-10-16 01:38:42,178 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:38:42,181 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 73 transitions, 152 flow [2020-10-16 01:38:42,184 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 73 transitions, 152 flow [2020-10-16 01:38:42,185 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 78 places, 73 transitions, 152 flow [2020-10-16 01:38:42,204 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 01:38:42,204 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:42,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 01:38:42,207 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-16 01:38:42,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:42,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:42,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:38:42,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:38:42,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:42,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:42,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:42,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:42,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:42,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:42,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:42,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:42,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:42,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:42,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:42,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:42,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:43,977 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 01:38:44,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:38:44,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:44,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,862 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 01:38:44,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:44,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:44,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:38:44,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:38:44,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:44,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:44,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:44,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:44,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:44,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:44,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:44,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:44,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:44,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:44,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:44,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:44,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:44,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:44,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:44,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:45,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:45,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:45,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:45,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:45,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:45,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:45,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:38:45,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-16 01:38:45,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:45,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:45,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:45,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:45,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:45,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:45,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:45,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:45,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:38:45,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:45,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:38:45,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:38:45,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:38:45,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:46,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:46,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:46,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:46,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:38:46,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:46,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:46,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:46,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:46,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:46,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:46,444 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 01:38:46,551 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:38:46,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:38:46,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:46,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:38:46,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:47,805 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-16 01:38:48,082 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 01:38:49,223 WARN L193 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2020-10-16 01:38:49,527 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 01:38:49,761 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-16 01:38:49,884 INFO L132 LiptonReduction]: Checked pairs total: 2364 [2020-10-16 01:38:49,884 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 01:38:49,890 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7714 [2020-10-16 01:38:49,900 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 01:38:49,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:49,901 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:49,901 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:38:49,903 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash 897514, now seen corresponding path program 1 times [2020-10-16 01:38:49,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:49,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595967148] [2020-10-16 01:38:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:50,167 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:38:50,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595967148] [2020-10-16 01:38:50,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:50,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:38:50,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460104388] [2020-10-16 01:38:50,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:38:50,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:38:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:38:50,202 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2020-10-16 01:38:50,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states. [2020-10-16 01:38:50,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:50,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2020-10-16 01:38:50,208 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:50,307 INFO L129 PetriNetUnfolder]: 23/59 cut-off events. [2020-10-16 01:38:50,307 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:50,309 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 59 events. 23/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 205 event pairs, 16 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 105. Up to 37 conditions per place. [2020-10-16 01:38:50,312 INFO L132 encePairwiseOnDemand]: 138/141 looper letters, 7 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 01:38:50,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 68 flow [2020-10-16 01:38:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:38:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:38:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2020-10-16 01:38:50,337 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2020-10-16 01:38:50,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2020-10-16 01:38:50,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2020-10-16 01:38:50,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:50,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2020-10-16 01:38:50,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:38:50,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:38:50,371 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:38:50,373 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 351 transitions. [2020-10-16 01:38:50,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 68 flow [2020-10-16 01:38:50,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:50,383 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2020-10-16 01:38:50,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 01:38:50,387 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 01:38:50,387 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2020-10-16 01:38:50,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:38:50,387 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:50,387 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:50,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:38:50,388 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash -13139347, now seen corresponding path program 1 times [2020-10-16 01:38:50,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:50,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807074017] [2020-10-16 01:38:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:50,518 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:38:50,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807074017] [2020-10-16 01:38:50,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:50,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:38:50,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939775035] [2020-10-16 01:38:50,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:38:50,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:38:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:38:50,522 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 141 [2020-10-16 01:38:50,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states. [2020-10-16 01:38:50,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:50,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2020-10-16 01:38:50,523 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:50,537 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2020-10-16 01:38:50,538 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:50,538 INFO L80 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 01:38:50,538 INFO L132 encePairwiseOnDemand]: 138/141 looper letters, 1 selfloop transitions, 2 changer transitions 0/15 dead transitions. [2020-10-16 01:38:50,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 15 transitions, 44 flow [2020-10-16 01:38:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:38:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:38:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2020-10-16 01:38:50,542 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8605200945626478 [2020-10-16 01:38:50,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2020-10-16 01:38:50,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2020-10-16 01:38:50,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:50,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2020-10-16 01:38:50,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:38:50,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:38:50,546 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:38:50,546 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 364 transitions. [2020-10-16 01:38:50,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 15 transitions, 44 flow [2020-10-16 01:38:50,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 15 transitions, 40 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:50,547 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2020-10-16 01:38:50,547 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 01:38:50,548 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 01:38:50,548 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2020-10-16 01:38:50,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:38:50,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:50,549 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:50,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:38:50,549 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash -408043731, now seen corresponding path program 1 times [2020-10-16 01:38:50,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:50,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032633531] [2020-10-16 01:38:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:50,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032633531] [2020-10-16 01:38:50,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:50,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:38:50,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611572389] [2020-10-16 01:38:50,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:50,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:50,662 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2020-10-16 01:38:50,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states. [2020-10-16 01:38:50,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:50,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2020-10-16 01:38:50,662 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:50,692 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2020-10-16 01:38:50,693 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2020-10-16 01:38:50,693 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 3/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 01:38:50,693 INFO L132 encePairwiseOnDemand]: 137/141 looper letters, 1 selfloop transitions, 3 changer transitions 1/16 dead transitions. [2020-10-16 01:38:50,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 57 flow [2020-10-16 01:38:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:38:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:38:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2020-10-16 01:38:50,696 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8280141843971631 [2020-10-16 01:38:50,696 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2020-10-16 01:38:50,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2020-10-16 01:38:50,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:50,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2020-10-16 01:38:50,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:38:50,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:38:50,701 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:38:50,701 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 467 transitions. [2020-10-16 01:38:50,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 57 flow [2020-10-16 01:38:50,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 16 transitions, 51 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:50,702 INFO L241 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2020-10-16 01:38:50,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2020-10-16 01:38:50,703 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2020-10-16 01:38:50,703 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 52 flow [2020-10-16 01:38:50,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:50,703 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:50,703 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:50,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:38:50,704 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -996248062, now seen corresponding path program 1 times [2020-10-16 01:38:50,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:50,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462068432] [2020-10-16 01:38:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:50,807 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:38:50,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462068432] [2020-10-16 01:38:50,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:50,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:38:50,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110337662] [2020-10-16 01:38:50,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:50,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:50,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:50,811 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 141 [2020-10-16 01:38:50,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 15 transitions, 52 flow. Second operand 4 states. [2020-10-16 01:38:50,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:50,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 141 [2020-10-16 01:38:50,812 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:50,877 INFO L129 PetriNetUnfolder]: 15/46 cut-off events. [2020-10-16 01:38:50,877 INFO L130 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2020-10-16 01:38:50,878 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 46 events. 15/46 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 3 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 99. Up to 30 conditions per place. [2020-10-16 01:38:50,878 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 7 selfloop transitions, 4 changer transitions 0/19 dead transitions. [2020-10-16 01:38:50,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 19 transitions, 82 flow [2020-10-16 01:38:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:38:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:38:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 420 transitions. [2020-10-16 01:38:50,882 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7446808510638298 [2020-10-16 01:38:50,882 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 420 transitions. [2020-10-16 01:38:50,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 420 transitions. [2020-10-16 01:38:50,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:50,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 420 transitions. [2020-10-16 01:38:50,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:38:50,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:38:50,885 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:38:50,885 INFO L185 Difference]: Start difference. First operand has 26 places, 15 transitions, 52 flow. Second operand 4 states and 420 transitions. [2020-10-16 01:38:50,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 19 transitions, 82 flow [2020-10-16 01:38:50,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 70 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:38:50,886 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 61 flow [2020-10-16 01:38:50,887 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=61, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2020-10-16 01:38:50,887 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2020-10-16 01:38:50,887 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 61 flow [2020-10-16 01:38:50,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:50,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:50,887 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:50,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:38:50,888 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1597721130, now seen corresponding path program 1 times [2020-10-16 01:38:50,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:50,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642675243] [2020-10-16 01:38:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:50,977 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:38:50,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642675243] [2020-10-16 01:38:50,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:50,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:50,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987482152] [2020-10-16 01:38:50,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:50,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:50,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:50,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:50,980 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2020-10-16 01:38:50,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 61 flow. Second operand 4 states. [2020-10-16 01:38:50,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:50,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2020-10-16 01:38:50,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:51,022 INFO L129 PetriNetUnfolder]: 10/45 cut-off events. [2020-10-16 01:38:51,022 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 01:38:51,023 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 45 events. 10/45 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 121 event pairs, 4 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 90. Up to 19 conditions per place. [2020-10-16 01:38:51,023 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 4 selfloop transitions, 5 changer transitions 3/24 dead transitions. [2020-10-16 01:38:51,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 99 flow [2020-10-16 01:38:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2020-10-16 01:38:51,026 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8 [2020-10-16 01:38:51,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2020-10-16 01:38:51,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2020-10-16 01:38:51,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:51,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2020-10-16 01:38:51,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:51,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:51,030 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:51,030 INFO L185 Difference]: Start difference. First operand has 26 places, 17 transitions, 61 flow. Second operand 5 states and 564 transitions. [2020-10-16 01:38:51,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 99 flow [2020-10-16 01:38:51,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:51,032 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 93 flow [2020-10-16 01:38:51,032 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2020-10-16 01:38:51,033 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2020-10-16 01:38:51,033 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 93 flow [2020-10-16 01:38:51,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:51,033 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:51,033 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:51,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:38:51,033 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:51,034 INFO L82 PathProgramCache]: Analyzing trace with hash 801474481, now seen corresponding path program 1 times [2020-10-16 01:38:51,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:51,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42136780] [2020-10-16 01:38:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:51,114 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:38:51,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42136780] [2020-10-16 01:38:51,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:51,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:38:51,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982243440] [2020-10-16 01:38:51,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:38:51,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:38:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:38:51,121 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2020-10-16 01:38:51,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 93 flow. Second operand 5 states. [2020-10-16 01:38:51,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:51,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2020-10-16 01:38:51,122 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:51,181 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2020-10-16 01:38:51,181 INFO L130 PetriNetUnfolder]: For 31/44 co-relation queries the response was YES. [2020-10-16 01:38:51,181 INFO L80 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 30 events. 3/30 cut-off events. For 31/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 51 event pairs, 0 based on Foata normal form. 17/47 useless extension candidates. Maximal degree in co-relation 81. Up to 12 conditions per place. [2020-10-16 01:38:51,182 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 2 selfloop transitions, 8 changer transitions 2/24 dead transitions. [2020-10-16 01:38:51,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 24 transitions, 131 flow [2020-10-16 01:38:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:38:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:38:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 784 transitions. [2020-10-16 01:38:51,186 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7943262411347518 [2020-10-16 01:38:51,186 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 784 transitions. [2020-10-16 01:38:51,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 784 transitions. [2020-10-16 01:38:51,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:51,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 784 transitions. [2020-10-16 01:38:51,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:38:51,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:38:51,191 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:38:51,191 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 93 flow. Second operand 7 states and 784 transitions. [2020-10-16 01:38:51,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 24 transitions, 131 flow [2020-10-16 01:38:51,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 125 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:38:51,193 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 120 flow [2020-10-16 01:38:51,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2020-10-16 01:38:51,194 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2020-10-16 01:38:51,194 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 120 flow [2020-10-16 01:38:51,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:38:51,194 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:51,194 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:51,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:38:51,195 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:51,195 INFO L82 PathProgramCache]: Analyzing trace with hash 726939784, now seen corresponding path program 1 times [2020-10-16 01:38:51,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:51,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826416630] [2020-10-16 01:38:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:51,378 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:38:51,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826416630] [2020-10-16 01:38:51,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:51,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:38:51,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093580170] [2020-10-16 01:38:51,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:38:51,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:38:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:38:51,381 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 141 [2020-10-16 01:38:51,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 120 flow. Second operand 7 states. [2020-10-16 01:38:51,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:51,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 141 [2020-10-16 01:38:51,383 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:51,513 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2020-10-16 01:38:51,513 INFO L130 PetriNetUnfolder]: For 68/79 co-relation queries the response was YES. [2020-10-16 01:38:51,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 37 events. 3/37 cut-off events. For 68/79 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 86 event pairs, 0 based on Foata normal form. 8/45 useless extension candidates. Maximal degree in co-relation 121. Up to 16 conditions per place. [2020-10-16 01:38:51,514 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 4 selfloop transitions, 4 changer transitions 4/24 dead transitions. [2020-10-16 01:38:51,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 24 transitions, 154 flow [2020-10-16 01:38:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2020-10-16 01:38:51,517 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6964539007092199 [2020-10-16 01:38:51,517 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2020-10-16 01:38:51,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2020-10-16 01:38:51,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:51,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2020-10-16 01:38:51,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:51,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:51,521 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:51,521 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 120 flow. Second operand 5 states and 491 transitions. [2020-10-16 01:38:51,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 24 transitions, 154 flow [2020-10-16 01:38:51,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 125 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 01:38:51,524 INFO L241 Difference]: Finished difference. Result has 37 places, 19 transitions, 92 flow [2020-10-16 01:38:51,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2020-10-16 01:38:51,524 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2020-10-16 01:38:51,524 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 92 flow [2020-10-16 01:38:51,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:38:51,525 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:51,525 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:51,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:38:51,525 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -944094530, now seen corresponding path program 2 times [2020-10-16 01:38:51,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:51,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166055060] [2020-10-16 01:38:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:38:51,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:38:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:38:51,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:38:51,641 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:38:51,642 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:38:51,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:38:51,643 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:38:51,656 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L2-->L795: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In1033287348 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In1033287348 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In1033287348 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In1033287348 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1033287348 0)) (or (and .cse0 .cse1 (= ~y$w_buff0_used~0_Out1033287348 0)) (and (= ~y$w_buff0_used~0_In1033287348 ~y$w_buff0_used~0_Out1033287348) .cse2)) (= ~y$r_buff1_thd0~0_Out1033287348 ~y$r_buff1_thd0~0_In1033287348) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1033287348 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1033287348|) (or (and .cse0 (= ~y$w_buff0~0_In1033287348 ~y~0_Out1033287348) .cse1) (and (or (and .cse3 .cse4 (= ~y$w_buff1~0_In1033287348 ~y~0_Out1033287348)) (and .cse5 (= ~y~0_In1033287348 ~y~0_Out1033287348))) .cse2)) (= ~y$r_buff0_thd0~0_Out1033287348 ~y$r_buff0_thd0~0_In1033287348) (or (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out1033287348 0)) (and .cse5 (= ~y$w_buff1_used~0_Out1033287348 ~y$w_buff1_used~0_In1033287348)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1033287348|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1033287348, ~y$w_buff1~0=~y$w_buff1~0_In1033287348, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1033287348, ~y$w_buff0~0=~y$w_buff0~0_In1033287348, ~y~0=~y~0_In1033287348, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1033287348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1033287348} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1033287348, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1033287348|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1033287348|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1033287348|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out1033287348|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1033287348|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1033287348|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1033287348|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1033287348, ~y$w_buff1~0=~y$w_buff1~0_In1033287348, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1033287348, ~y$w_buff0~0=~y$w_buff0~0_In1033287348, ~y~0=~y~0_Out1033287348, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1033287348, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1033287348} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 01:38:51,661 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:38:51,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,666 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,667 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:38:51,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,667 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:38:51,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,667 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:38:51,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,668 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:38:51,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,668 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:38:51,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,669 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:38:51,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,670 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:38:51,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,670 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:38:51,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,678 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:38:51,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,678 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:38:51,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:51,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:51,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:38:51 BasicIcfg [2020-10-16 01:38:51,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:38:51,771 INFO L168 Benchmark]: Toolchain (without parser) took 12523.89 ms. Allocated memory was 249.6 MB in the beginning and 494.4 MB in the end (delta: 244.8 MB). Free memory was 205.8 MB in the beginning and 263.3 MB in the end (delta: -57.5 MB). Peak memory consumption was 187.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:51,772 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 01:38:51,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.66 ms. Allocated memory was 249.6 MB in the beginning and 310.4 MB in the end (delta: 60.8 MB). Free memory was 205.8 MB in the beginning and 262.5 MB in the end (delta: -56.7 MB). Peak memory consumption was 32.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:51,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.40 ms. Allocated memory is still 310.4 MB. Free memory was 262.5 MB in the beginning and 259.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:51,774 INFO L168 Benchmark]: Boogie Preprocessor took 46.46 ms. Allocated memory is still 310.4 MB. Free memory was 259.2 MB in the beginning and 257.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:51,775 INFO L168 Benchmark]: RCFGBuilder took 1870.89 ms. Allocated memory was 310.4 MB in the beginning and 354.9 MB in the end (delta: 44.6 MB). Free memory was 257.5 MB in the beginning and 216.4 MB in the end (delta: 41.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:51,776 INFO L168 Benchmark]: TraceAbstraction took 9776.47 ms. Allocated memory was 354.9 MB in the beginning and 494.4 MB in the end (delta: 139.5 MB). Free memory was 214.2 MB in the beginning and 263.3 MB in the end (delta: -49.1 MB). Peak memory consumption was 90.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:51,781 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.24 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 752.66 ms. Allocated memory was 249.6 MB in the beginning and 310.4 MB in the end (delta: 60.8 MB). Free memory was 205.8 MB in the beginning and 262.5 MB in the end (delta: -56.7 MB). Peak memory consumption was 32.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.40 ms. Allocated memory is still 310.4 MB. Free memory was 262.5 MB in the beginning and 259.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.46 ms. Allocated memory is still 310.4 MB. Free memory was 259.2 MB in the beginning and 257.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1870.89 ms. Allocated memory was 310.4 MB in the beginning and 354.9 MB in the end (delta: 44.6 MB). Free memory was 257.5 MB in the beginning and 216.4 MB in the end (delta: 41.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9776.47 ms. Allocated memory was 354.9 MB in the beginning and 494.4 MB in the end (delta: 139.5 MB). Free memory was 214.2 MB in the beginning and 263.3 MB in the end (delta: -49.1 MB). Peak memory consumption was 90.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 573 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 57 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.7s, 78 PlacesBefore, 24 PlacesAfterwards, 73 TransitionsBefore, 17 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2364 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L705] 0 int y = 0; [L706] 0 _Bool y$flush_delayed; [L707] 0 int y$mem_tmp; [L708] 0 _Bool y$r_buff0_thd0; [L709] 0 _Bool y$r_buff0_thd1; [L710] 0 _Bool y$r_buff0_thd2; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$read_delayed; [L715] 0 int *y$read_delayed_var; [L716] 0 int y$w_buff0; [L717] 0 _Bool y$w_buff0_used; [L718] 0 int y$w_buff1; [L719] 0 _Bool y$w_buff1_used; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t2011; [L782] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$w_buff1 = y$w_buff0 [L726] 1 y$w_buff0 = 2 [L727] 1 y$w_buff1_used = y$w_buff0_used [L728] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 pthread_t t2012; [L784] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L748] 1 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 y$flush_delayed = weak$$choice2 [L800] 0 y$mem_tmp = y [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L802] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L802] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L802] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L803] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L804] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L804] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L805] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L805] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L805] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L806] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L807] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L808] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L809] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L809] 0 y = y$flush_delayed ? y$mem_tmp : y [L810] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 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: 9.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 21 SDtfs, 7 SDslu, 7 SDs, 0 SdLazy, 96 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 4624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...