/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/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:30:29,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:30:29,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:30:29,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:30:29,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:30:29,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:30:29,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:30:29,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:30:29,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:30:29,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:30:29,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:30:29,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:30:29,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:30:29,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:30:29,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:30:29,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:30:29,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:30:29,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:30:29,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:30:29,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:30:30,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:30:30,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:30:30,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:30:30,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:30:30,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:30:30,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:30:30,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:30:30,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:30:30,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:30:30,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:30:30,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:30:30,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:30:30,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:30:30,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:30:30,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:30:30,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:30:30,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:30:30,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:30:30,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:30:30,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:30:30,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:30:30,016 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:30:30,039 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:30:30,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:30:30,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:30:30,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:30:30,041 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:30:30,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:30:30,042 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:30:30,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:30:30,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:30:30,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:30:30,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:30:30,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:30:30,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:30:30,043 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:30:30,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:30:30,044 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:30:30,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:30:30,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:30:30,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:30:30,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:30:30,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:30:30,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:30:30,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:30:30,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:30:30,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:30:30,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:30:30,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:30:30,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:30:30,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:30:30,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:30:30,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:30:30,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:30:30,382 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:30:30,382 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:30:30,383 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-16 01:30:30,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85b958a8/42cc387578c94d3db55d05762fd5fb65/FLAG56a6f946b [2020-10-16 01:30:31,064 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:30:31,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-16 01:30:31,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85b958a8/42cc387578c94d3db55d05762fd5fb65/FLAG56a6f946b [2020-10-16 01:30:31,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85b958a8/42cc387578c94d3db55d05762fd5fb65 [2020-10-16 01:30:31,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:30:31,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:30:31,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:30:31,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:30:31,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:30:31,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:31" (1/1) ... [2020-10-16 01:30:31,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d93a155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:31, skipping insertion in model container [2020-10-16 01:30:31,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:31" (1/1) ... [2020-10-16 01:30:31,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:30:31,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:30:32,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:30:32,020 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:30:32,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:30:32,186 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:30:32,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32 WrapperNode [2020-10-16 01:30:32,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:30:32,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:30:32,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:30:32,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:30:32,197 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:30:32" (1/1) ... [2020-10-16 01:30:32,217 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:30:32" (1/1) ... [2020-10-16 01:30:32,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:30:32,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:30:32,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:30:32,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:30:32,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (1/1) ... [2020-10-16 01:30:32,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (1/1) ... [2020-10-16 01:30:32,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (1/1) ... [2020-10-16 01:30:32,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (1/1) ... [2020-10-16 01:30:32,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (1/1) ... [2020-10-16 01:30:32,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (1/1) ... [2020-10-16 01:30:32,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (1/1) ... [2020-10-16 01:30:32,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:30:32,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:30:32,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:30:32,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:30:32,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (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:30:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:30:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:30:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:30:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:30:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:30:32,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:30:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:30:32,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:30:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:30:32,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:30:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:30:32,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:30:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:30:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:30:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:30:32,408 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:30:34,302 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:30:34,303 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:30:34,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:34 BoogieIcfgContainer [2020-10-16 01:30:34,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:30:34,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:30:34,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:30:34,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:30:34,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:30:31" (1/3) ... [2020-10-16 01:30:34,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c94cb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:34, skipping insertion in model container [2020-10-16 01:30:34,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:32" (2/3) ... [2020-10-16 01:30:34,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c94cb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:34, skipping insertion in model container [2020-10-16 01:30:34,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:34" (3/3) ... [2020-10-16 01:30:34,314 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2020-10-16 01:30:34,326 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:30:34,334 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:30:34,335 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:30:34,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,369 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,369 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,372 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,373 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,380 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,381 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,385 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,386 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,387 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,390 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,392 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:34,413 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:30:34,436 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:30:34,436 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:30:34,436 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:30:34,437 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:30:34,437 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:30:34,437 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:30:34,437 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:30:34,437 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:30:34,452 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-16 01:30:34,505 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-16 01:30:34,505 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:34,511 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:30:34,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 108 transitions, 236 flow [2020-10-16 01:30:34,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 104 transitions, 220 flow [2020-10-16 01:30:34,523 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:30:34,526 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 104 transitions, 220 flow [2020-10-16 01:30:34,530 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 104 transitions, 220 flow [2020-10-16 01:30:34,531 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 115 places, 104 transitions, 220 flow [2020-10-16 01:30:34,563 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-16 01:30:34,563 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:34,564 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:30:34,568 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 01:30:34,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:34,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:34,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:34,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:35,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:35,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:35,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:35,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:30:35,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:35,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:35,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:35,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:35,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:35,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:35,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:35,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:35,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:35,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:35,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:30:35,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:35,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:30:35,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:35,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:35,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:35,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:35,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:35,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:35,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:36,629 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 01:30:36,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 01:30:36,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:36,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:36,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:37,479 WARN L193 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 01:30:37,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:37,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:37,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:37,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:37,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:37,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:37,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:37,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:37,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:37,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:37,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:37,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:37,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:37,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:37,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:37,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:30:37,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:38,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:38,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:38,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:38,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:38,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:38,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:38,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:38,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:38,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:38,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:38,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:30:38,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:30:38,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:30:38,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:30:38,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:30:38,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:38,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:38,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:30:38,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:38,517 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 01:30:38,638 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:30:38,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:30:38,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:30:39,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:39,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:30:39,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:39,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:30:39,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:39,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:30:39,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:39,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:30:39,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:40,122 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 01:30:40,228 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 01:30:40,522 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 01:30:40,656 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 01:30:40,665 INFO L132 LiptonReduction]: Checked pairs total: 6387 [2020-10-16 01:30:40,665 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 01:30:40,668 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6148 [2020-10-16 01:30:40,676 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 01:30:40,676 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:40,677 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:40,677 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:40,678 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash 453703469, now seen corresponding path program 1 times [2020-10-16 01:30:40,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:40,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461427883] [2020-10-16 01:30:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:40,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461427883] [2020-10-16 01:30:40,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:40,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:30:40,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085641900] [2020-10-16 01:30:41,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:30:41,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:30:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:30:41,031 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 197 [2020-10-16 01:30:41,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 01:30:41,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:41,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 197 [2020-10-16 01:30:41,035 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:41,100 INFO L129 PetriNetUnfolder]: 16/68 cut-off events. [2020-10-16 01:30:41,100 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:41,101 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 68 events. 16/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 6 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 105. Up to 27 conditions per place. [2020-10-16 01:30:41,102 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2020-10-16 01:30:41,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 90 flow [2020-10-16 01:30:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:30:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:30:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2020-10-16 01:30:41,122 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2020-10-16 01:30:41,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2020-10-16 01:30:41,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2020-10-16 01:30:41,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:41,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2020-10-16 01:30:41,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:30:41,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:30:41,141 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:30:41,144 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 522 transitions. [2020-10-16 01:30:41,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 90 flow [2020-10-16 01:30:41,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:41,150 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 66 flow [2020-10-16 01:30:41,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2020-10-16 01:30:41,155 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 01:30:41,155 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2020-10-16 01:30:41,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:30:41,155 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:41,155 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:41,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:30:41,156 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:41,156 INFO L82 PathProgramCache]: Analyzing trace with hash 21037090, now seen corresponding path program 1 times [2020-10-16 01:30:41,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:41,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009108180] [2020-10-16 01:30:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:41,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009108180] [2020-10-16 01:30:41,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:41,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:30:41,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079883734] [2020-10-16 01:30:41,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:41,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:41,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:41,327 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 197 [2020-10-16 01:30:41,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand 4 states. [2020-10-16 01:30:41,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:41,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 197 [2020-10-16 01:30:41,328 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:41,503 INFO L129 PetriNetUnfolder]: 275/516 cut-off events. [2020-10-16 01:30:41,503 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2020-10-16 01:30:41,506 INFO L80 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 516 events. 275/516 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2784 event pairs, 59 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 978. Up to 259 conditions per place. [2020-10-16 01:30:41,509 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 10 selfloop transitions, 4 changer transitions 13/44 dead transitions. [2020-10-16 01:30:41,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 160 flow [2020-10-16 01:30:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 779 transitions. [2020-10-16 01:30:41,513 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7908629441624365 [2020-10-16 01:30:41,514 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 779 transitions. [2020-10-16 01:30:41,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 779 transitions. [2020-10-16 01:30:41,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:41,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 779 transitions. [2020-10-16 01:30:41,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:41,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:41,522 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:41,522 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 779 transitions. [2020-10-16 01:30:41,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 160 flow [2020-10-16 01:30:41,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:41,528 INFO L241 Difference]: Finished difference. Result has 43 places, 29 transitions, 96 flow [2020-10-16 01:30:41,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2020-10-16 01:30:41,528 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2020-10-16 01:30:41,528 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 96 flow [2020-10-16 01:30:41,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:41,529 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:41,529 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:41,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:30:41,529 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash 652165596, now seen corresponding path program 1 times [2020-10-16 01:30:41,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:41,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387857819] [2020-10-16 01:30:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:41,701 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:30:41,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387857819] [2020-10-16 01:30:41,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:41,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:41,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377121332] [2020-10-16 01:30:41,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:41,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:41,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:41,705 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 197 [2020-10-16 01:30:41,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 96 flow. Second operand 5 states. [2020-10-16 01:30:41,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:41,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 197 [2020-10-16 01:30:41,707 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:41,936 INFO L129 PetriNetUnfolder]: 199/440 cut-off events. [2020-10-16 01:30:41,936 INFO L130 PetriNetUnfolder]: For 320/342 co-relation queries the response was YES. [2020-10-16 01:30:41,939 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 440 events. 199/440 cut-off events. For 320/342 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2500 event pairs, 108 based on Foata normal form. 25/435 useless extension candidates. Maximal degree in co-relation 1056. Up to 212 conditions per place. [2020-10-16 01:30:41,943 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 9 selfloop transitions, 4 changer transitions 7/40 dead transitions. [2020-10-16 01:30:41,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 175 flow [2020-10-16 01:30:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2020-10-16 01:30:41,947 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7563451776649747 [2020-10-16 01:30:41,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2020-10-16 01:30:41,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2020-10-16 01:30:41,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:41,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2020-10-16 01:30:41,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:41,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:41,951 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:41,952 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 96 flow. Second operand 5 states and 745 transitions. [2020-10-16 01:30:41,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 175 flow [2020-10-16 01:30:41,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 168 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:41,955 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 130 flow [2020-10-16 01:30:41,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2020-10-16 01:30:41,956 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2020-10-16 01:30:41,956 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 130 flow [2020-10-16 01:30:41,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:41,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:41,957 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:41,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:30:41,957 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:41,957 INFO L82 PathProgramCache]: Analyzing trace with hash 585859479, now seen corresponding path program 1 times [2020-10-16 01:30:41,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:41,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133691680] [2020-10-16 01:30:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:42,073 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:30:42,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133691680] [2020-10-16 01:30:42,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:42,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:42,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639100946] [2020-10-16 01:30:42,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:42,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:42,077 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 197 [2020-10-16 01:30:42,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 130 flow. Second operand 5 states. [2020-10-16 01:30:42,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:42,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 197 [2020-10-16 01:30:42,078 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:42,278 INFO L129 PetriNetUnfolder]: 231/470 cut-off events. [2020-10-16 01:30:42,278 INFO L130 PetriNetUnfolder]: For 581/615 co-relation queries the response was YES. [2020-10-16 01:30:42,280 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 470 events. 231/470 cut-off events. For 581/615 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2454 event pairs, 116 based on Foata normal form. 30/489 useless extension candidates. Maximal degree in co-relation 1360. Up to 271 conditions per place. [2020-10-16 01:30:42,284 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 14 selfloop transitions, 7 changer transitions 9/48 dead transitions. [2020-10-16 01:30:42,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 250 flow [2020-10-16 01:30:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:30:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:30:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions. [2020-10-16 01:30:42,288 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7766497461928934 [2020-10-16 01:30:42,289 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 918 transitions. [2020-10-16 01:30:42,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions. [2020-10-16 01:30:42,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:42,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions. [2020-10-16 01:30:42,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:30:42,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:30:42,293 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:30:42,294 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 130 flow. Second operand 6 states and 918 transitions. [2020-10-16 01:30:42,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 250 flow [2020-10-16 01:30:42,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 244 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:42,297 INFO L241 Difference]: Finished difference. Result has 49 places, 34 transitions, 168 flow [2020-10-16 01:30:42,298 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2020-10-16 01:30:42,298 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2020-10-16 01:30:42,298 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 168 flow [2020-10-16 01:30:42,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:42,298 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:42,298 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:42,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:30:42,299 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:42,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1265756715, now seen corresponding path program 1 times [2020-10-16 01:30:42,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:42,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431296963] [2020-10-16 01:30:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:42,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431296963] [2020-10-16 01:30:42,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:42,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:42,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95987234] [2020-10-16 01:30:42,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:42,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:42,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:42,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:42,482 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 197 [2020-10-16 01:30:42,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 168 flow. Second operand 6 states. [2020-10-16 01:30:42,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:42,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 197 [2020-10-16 01:30:42,483 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:42,657 INFO L129 PetriNetUnfolder]: 150/345 cut-off events. [2020-10-16 01:30:42,657 INFO L130 PetriNetUnfolder]: For 867/914 co-relation queries the response was YES. [2020-10-16 01:30:42,659 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 345 events. 150/345 cut-off events. For 867/914 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1811 event pairs, 89 based on Foata normal form. 22/347 useless extension candidates. Maximal degree in co-relation 1115. Up to 167 conditions per place. [2020-10-16 01:30:42,662 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 10 selfloop transitions, 6 changer transitions 6/44 dead transitions. [2020-10-16 01:30:42,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 250 flow [2020-10-16 01:30:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:30:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:30:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2020-10-16 01:30:42,666 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.739424703891709 [2020-10-16 01:30:42,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 874 transitions. [2020-10-16 01:30:42,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 874 transitions. [2020-10-16 01:30:42,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:42,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 874 transitions. [2020-10-16 01:30:42,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:30:42,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:30:42,671 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:30:42,672 INFO L185 Difference]: Start difference. First operand has 49 places, 34 transitions, 168 flow. Second operand 6 states and 874 transitions. [2020-10-16 01:30:42,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 250 flow [2020-10-16 01:30:42,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 224 flow, removed 8 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:42,677 INFO L241 Difference]: Finished difference. Result has 51 places, 36 transitions, 180 flow [2020-10-16 01:30:42,677 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2020-10-16 01:30:42,677 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2020-10-16 01:30:42,677 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 180 flow [2020-10-16 01:30:42,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:42,678 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:42,678 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:42,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:30:42,678 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1236543189, now seen corresponding path program 1 times [2020-10-16 01:30:42,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:42,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685482253] [2020-10-16 01:30:42,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:42,774 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:30:42,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685482253] [2020-10-16 01:30:42,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:42,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:42,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833480368] [2020-10-16 01:30:42,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:42,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:42,777 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 197 [2020-10-16 01:30:42,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 180 flow. Second operand 6 states. [2020-10-16 01:30:42,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:42,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 197 [2020-10-16 01:30:42,778 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:42,987 INFO L129 PetriNetUnfolder]: 140/344 cut-off events. [2020-10-16 01:30:42,987 INFO L130 PetriNetUnfolder]: For 983/1039 co-relation queries the response was YES. [2020-10-16 01:30:42,991 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 344 events. 140/344 cut-off events. For 983/1039 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1847 event pairs, 27 based on Foata normal form. 21/341 useless extension candidates. Maximal degree in co-relation 1135. Up to 153 conditions per place. [2020-10-16 01:30:42,994 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 12 selfloop transitions, 13 changer transitions 7/54 dead transitions. [2020-10-16 01:30:42,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 360 flow [2020-10-16 01:30:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:30:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:30:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1196 transitions. [2020-10-16 01:30:43,001 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7588832487309645 [2020-10-16 01:30:43,001 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1196 transitions. [2020-10-16 01:30:43,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1196 transitions. [2020-10-16 01:30:43,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:43,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1196 transitions. [2020-10-16 01:30:43,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:30:43,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:30:43,010 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:30:43,010 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 180 flow. Second operand 8 states and 1196 transitions. [2020-10-16 01:30:43,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 360 flow [2020-10-16 01:30:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 344 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:43,016 INFO L241 Difference]: Finished difference. Result has 58 places, 43 transitions, 261 flow [2020-10-16 01:30:43,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2020-10-16 01:30:43,017 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2020-10-16 01:30:43,017 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 261 flow [2020-10-16 01:30:43,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:43,017 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:43,017 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:43,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:30:43,017 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:43,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1772373226, now seen corresponding path program 1 times [2020-10-16 01:30:43,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:43,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679962277] [2020-10-16 01:30:43,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:43,139 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:30:43,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679962277] [2020-10-16 01:30:43,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:43,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:43,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216203752] [2020-10-16 01:30:43,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:43,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:43,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:43,143 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 197 [2020-10-16 01:30:43,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 261 flow. Second operand 6 states. [2020-10-16 01:30:43,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:43,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 197 [2020-10-16 01:30:43,144 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:43,309 INFO L129 PetriNetUnfolder]: 132/300 cut-off events. [2020-10-16 01:30:43,309 INFO L130 PetriNetUnfolder]: For 1464/1542 co-relation queries the response was YES. [2020-10-16 01:30:43,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 300 events. 132/300 cut-off events. For 1464/1542 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1439 event pairs, 36 based on Foata normal form. 20/294 useless extension candidates. Maximal degree in co-relation 1265. Up to 166 conditions per place. [2020-10-16 01:30:43,315 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 11 selfloop transitions, 18 changer transitions 3/54 dead transitions. [2020-10-16 01:30:43,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 445 flow [2020-10-16 01:30:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1052 transitions. [2020-10-16 01:30:43,319 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7628716461203771 [2020-10-16 01:30:43,319 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1052 transitions. [2020-10-16 01:30:43,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1052 transitions. [2020-10-16 01:30:43,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:43,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1052 transitions. [2020-10-16 01:30:43,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:43,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:43,326 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:43,326 INFO L185 Difference]: Start difference. First operand has 58 places, 43 transitions, 261 flow. Second operand 7 states and 1052 transitions. [2020-10-16 01:30:43,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 445 flow [2020-10-16 01:30:43,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 425 flow, removed 10 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:43,332 INFO L241 Difference]: Finished difference. Result has 61 places, 49 transitions, 359 flow [2020-10-16 01:30:43,333 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2020-10-16 01:30:43,333 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2020-10-16 01:30:43,333 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 359 flow [2020-10-16 01:30:43,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:43,333 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:43,334 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:43,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:30:43,334 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash -899616234, now seen corresponding path program 2 times [2020-10-16 01:30:43,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:43,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053234131] [2020-10-16 01:30:43,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:43,480 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:30:43,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053234131] [2020-10-16 01:30:43,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:43,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:30:43,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740069963] [2020-10-16 01:30:43,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:30:43,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:30:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:30:43,484 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 197 [2020-10-16 01:30:43,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 359 flow. Second operand 7 states. [2020-10-16 01:30:43,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:43,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 197 [2020-10-16 01:30:43,485 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:43,685 INFO L129 PetriNetUnfolder]: 122/282 cut-off events. [2020-10-16 01:30:43,685 INFO L130 PetriNetUnfolder]: For 1212/1285 co-relation queries the response was YES. [2020-10-16 01:30:43,687 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 282 events. 122/282 cut-off events. For 1212/1285 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1335 event pairs, 34 based on Foata normal form. 18/277 useless extension candidates. Maximal degree in co-relation 1223. Up to 160 conditions per place. [2020-10-16 01:30:43,690 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 13 selfloop transitions, 15 changer transitions 3/53 dead transitions. [2020-10-16 01:30:43,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 464 flow [2020-10-16 01:30:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:30:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:30:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 888 transitions. [2020-10-16 01:30:43,694 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.751269035532995 [2020-10-16 01:30:43,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 888 transitions. [2020-10-16 01:30:43,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 888 transitions. [2020-10-16 01:30:43,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:43,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 888 transitions. [2020-10-16 01:30:43,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:30:43,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:30:43,700 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:30:43,700 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 359 flow. Second operand 6 states and 888 transitions. [2020-10-16 01:30:43,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 464 flow [2020-10-16 01:30:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 430 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:43,706 INFO L241 Difference]: Finished difference. Result has 63 places, 49 transitions, 376 flow [2020-10-16 01:30:43,706 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2020-10-16 01:30:43,706 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2020-10-16 01:30:43,707 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 376 flow [2020-10-16 01:30:43,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:30:43,707 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:43,707 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:43,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:30:43,707 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:43,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1249403778, now seen corresponding path program 1 times [2020-10-16 01:30:43,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:43,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120360856] [2020-10-16 01:30:43,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:43,897 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:30:43,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120360856] [2020-10-16 01:30:43,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:43,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:30:43,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906662790] [2020-10-16 01:30:43,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:30:43,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:30:43,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:30:43,901 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 197 [2020-10-16 01:30:43,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 376 flow. Second operand 7 states. [2020-10-16 01:30:43,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:43,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 197 [2020-10-16 01:30:43,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:44,080 INFO L129 PetriNetUnfolder]: 136/306 cut-off events. [2020-10-16 01:30:44,081 INFO L130 PetriNetUnfolder]: For 1467/1534 co-relation queries the response was YES. [2020-10-16 01:30:44,083 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 306 events. 136/306 cut-off events. For 1467/1534 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1473 event pairs, 28 based on Foata normal form. 19/303 useless extension candidates. Maximal degree in co-relation 1319. Up to 165 conditions per place. [2020-10-16 01:30:44,086 INFO L132 encePairwiseOnDemand]: 189/197 looper letters, 11 selfloop transitions, 19 changer transitions 5/57 dead transitions. [2020-10-16 01:30:44,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 500 flow [2020-10-16 01:30:44,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1053 transitions. [2020-10-16 01:30:44,090 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7635968092820885 [2020-10-16 01:30:44,090 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1053 transitions. [2020-10-16 01:30:44,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1053 transitions. [2020-10-16 01:30:44,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:44,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1053 transitions. [2020-10-16 01:30:44,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:44,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:44,096 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:44,096 INFO L185 Difference]: Start difference. First operand has 63 places, 49 transitions, 376 flow. Second operand 7 states and 1053 transitions. [2020-10-16 01:30:44,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 500 flow [2020-10-16 01:30:44,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 460 flow, removed 10 selfloop flow, removed 5 redundant places. [2020-10-16 01:30:44,102 INFO L241 Difference]: Finished difference. Result has 65 places, 51 transitions, 402 flow [2020-10-16 01:30:44,103 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2020-10-16 01:30:44,103 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2020-10-16 01:30:44,103 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 402 flow [2020-10-16 01:30:44,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:30:44,104 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:44,104 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:44,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:30:44,104 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:44,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1315683948, now seen corresponding path program 2 times [2020-10-16 01:30:44,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:44,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776506351] [2020-10-16 01:30:44,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:44,254 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:30:44,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776506351] [2020-10-16 01:30:44,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:44,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:30:44,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043385402] [2020-10-16 01:30:44,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:30:44,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:30:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:30:44,257 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 197 [2020-10-16 01:30:44,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 402 flow. Second operand 7 states. [2020-10-16 01:30:44,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:44,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 197 [2020-10-16 01:30:44,259 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:44,544 INFO L129 PetriNetUnfolder]: 128/324 cut-off events. [2020-10-16 01:30:44,544 INFO L130 PetriNetUnfolder]: For 1820/1887 co-relation queries the response was YES. [2020-10-16 01:30:44,547 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 324 events. 128/324 cut-off events. For 1820/1887 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1735 event pairs, 16 based on Foata normal form. 25/327 useless extension candidates. Maximal degree in co-relation 1459. Up to 117 conditions per place. [2020-10-16 01:30:44,550 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 10 selfloop transitions, 22 changer transitions 5/59 dead transitions. [2020-10-16 01:30:44,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 59 transitions, 556 flow [2020-10-16 01:30:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1018 transitions. [2020-10-16 01:30:44,554 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.73821609862219 [2020-10-16 01:30:44,555 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1018 transitions. [2020-10-16 01:30:44,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1018 transitions. [2020-10-16 01:30:44,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:44,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1018 transitions. [2020-10-16 01:30:44,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:44,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:44,561 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:44,561 INFO L185 Difference]: Start difference. First operand has 65 places, 51 transitions, 402 flow. Second operand 7 states and 1018 transitions. [2020-10-16 01:30:44,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 59 transitions, 556 flow [2020-10-16 01:30:44,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 514 flow, removed 4 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:44,567 INFO L241 Difference]: Finished difference. Result has 68 places, 53 transitions, 453 flow [2020-10-16 01:30:44,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=453, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2020-10-16 01:30:44,568 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2020-10-16 01:30:44,568 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 453 flow [2020-10-16 01:30:44,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:30:44,568 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:44,568 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:44,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:30:44,569 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 166167928, now seen corresponding path program 1 times [2020-10-16 01:30:44,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:44,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554768566] [2020-10-16 01:30:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:44,630 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:30:44,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554768566] [2020-10-16 01:30:44,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:44,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:44,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673389526] [2020-10-16 01:30:44,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:44,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:44,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:44,633 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2020-10-16 01:30:44,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 453 flow. Second operand 4 states. [2020-10-16 01:30:44,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:44,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2020-10-16 01:30:44,634 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:44,846 INFO L129 PetriNetUnfolder]: 492/983 cut-off events. [2020-10-16 01:30:44,846 INFO L130 PetriNetUnfolder]: For 4985/5174 co-relation queries the response was YES. [2020-10-16 01:30:44,856 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3862 conditions, 983 events. 492/983 cut-off events. For 4985/5174 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6414 event pairs, 163 based on Foata normal form. 91/994 useless extension candidates. Maximal degree in co-relation 3833. Up to 448 conditions per place. [2020-10-16 01:30:44,866 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 12 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2020-10-16 01:30:44,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 491 flow [2020-10-16 01:30:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2020-10-16 01:30:44,870 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8548223350253807 [2020-10-16 01:30:44,870 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2020-10-16 01:30:44,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2020-10-16 01:30:44,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:44,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2020-10-16 01:30:44,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:44,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:44,875 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:44,876 INFO L185 Difference]: Start difference. First operand has 68 places, 53 transitions, 453 flow. Second operand 5 states and 842 transitions. [2020-10-16 01:30:44,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 491 flow [2020-10-16 01:30:44,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 442 flow, removed 11 selfloop flow, removed 5 redundant places. [2020-10-16 01:30:44,888 INFO L241 Difference]: Finished difference. Result has 68 places, 60 transitions, 455 flow [2020-10-16 01:30:44,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2020-10-16 01:30:44,889 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2020-10-16 01:30:44,890 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 455 flow [2020-10-16 01:30:44,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:44,890 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:44,890 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:44,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:30:44,890 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:44,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:44,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1322925844, now seen corresponding path program 1 times [2020-10-16 01:30:44,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:44,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829999836] [2020-10-16 01:30:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:44,997 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:30:44,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829999836] [2020-10-16 01:30:44,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:44,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:44,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944814748] [2020-10-16 01:30:44,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:44,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:45,001 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2020-10-16 01:30:45,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 455 flow. Second operand 5 states. [2020-10-16 01:30:45,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:45,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2020-10-16 01:30:45,002 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:45,230 INFO L129 PetriNetUnfolder]: 308/684 cut-off events. [2020-10-16 01:30:45,230 INFO L130 PetriNetUnfolder]: For 2770/3557 co-relation queries the response was YES. [2020-10-16 01:30:45,237 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 684 events. 308/684 cut-off events. For 2770/3557 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4341 event pairs, 42 based on Foata normal form. 217/853 useless extension candidates. Maximal degree in co-relation 2966. Up to 379 conditions per place. [2020-10-16 01:30:45,246 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 12 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2020-10-16 01:30:45,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 581 flow [2020-10-16 01:30:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1179 transitions. [2020-10-16 01:30:45,250 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.854967367657723 [2020-10-16 01:30:45,250 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1179 transitions. [2020-10-16 01:30:45,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1179 transitions. [2020-10-16 01:30:45,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:45,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1179 transitions. [2020-10-16 01:30:45,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:45,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:45,262 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:45,262 INFO L185 Difference]: Start difference. First operand has 68 places, 60 transitions, 455 flow. Second operand 7 states and 1179 transitions. [2020-10-16 01:30:45,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 581 flow [2020-10-16 01:30:45,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 576 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:30:45,275 INFO L241 Difference]: Finished difference. Result has 76 places, 68 transitions, 580 flow [2020-10-16 01:30:45,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=580, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2020-10-16 01:30:45,276 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2020-10-16 01:30:45,276 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 580 flow [2020-10-16 01:30:45,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:45,276 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:45,276 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:45,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:30:45,277 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1418301531, now seen corresponding path program 1 times [2020-10-16 01:30:45,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:45,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914619621] [2020-10-16 01:30:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:45,347 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:30:45,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914619621] [2020-10-16 01:30:45,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:45,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:45,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217029170] [2020-10-16 01:30:45,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:45,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:45,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:45,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:45,350 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 197 [2020-10-16 01:30:45,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 580 flow. Second operand 4 states. [2020-10-16 01:30:45,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:45,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 197 [2020-10-16 01:30:45,351 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:45,533 INFO L129 PetriNetUnfolder]: 447/1001 cut-off events. [2020-10-16 01:30:45,533 INFO L130 PetriNetUnfolder]: For 5822/6557 co-relation queries the response was YES. [2020-10-16 01:30:45,544 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5200 conditions, 1001 events. 447/1001 cut-off events. For 5822/6557 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7040 event pairs, 55 based on Foata normal form. 66/1002 useless extension candidates. Maximal degree in co-relation 5166. Up to 619 conditions per place. [2020-10-16 01:30:45,552 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 6 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2020-10-16 01:30:45,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 640 flow [2020-10-16 01:30:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2020-10-16 01:30:45,556 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8385786802030457 [2020-10-16 01:30:45,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2020-10-16 01:30:45,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2020-10-16 01:30:45,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:45,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2020-10-16 01:30:45,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:45,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:45,561 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:45,561 INFO L185 Difference]: Start difference. First operand has 76 places, 68 transitions, 580 flow. Second operand 5 states and 826 transitions. [2020-10-16 01:30:45,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 640 flow [2020-10-16 01:30:45,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 590 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:45,580 INFO L241 Difference]: Finished difference. Result has 80 places, 70 transitions, 584 flow [2020-10-16 01:30:45,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=584, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2020-10-16 01:30:45,580 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2020-10-16 01:30:45,581 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 584 flow [2020-10-16 01:30:45,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:45,581 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:45,581 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:45,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:30:45,581 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash -226474734, now seen corresponding path program 1 times [2020-10-16 01:30:45,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:45,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345220694] [2020-10-16 01:30:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:45,701 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:30:45,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345220694] [2020-10-16 01:30:45,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:45,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:30:45,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153489150] [2020-10-16 01:30:45,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:45,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:45,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:45,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:45,703 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2020-10-16 01:30:45,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 584 flow. Second operand 6 states. [2020-10-16 01:30:45,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:45,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2020-10-16 01:30:45,704 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:45,927 INFO L129 PetriNetUnfolder]: 306/709 cut-off events. [2020-10-16 01:30:45,927 INFO L130 PetriNetUnfolder]: For 4448/5694 co-relation queries the response was YES. [2020-10-16 01:30:45,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 709 events. 306/709 cut-off events. For 4448/5694 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 4739 event pairs, 11 based on Foata normal form. 367/1019 useless extension candidates. Maximal degree in co-relation 3491. Up to 393 conditions per place. [2020-10-16 01:30:45,939 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 7 selfloop transitions, 28 changer transitions 6/78 dead transitions. [2020-10-16 01:30:45,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 78 transitions, 726 flow [2020-10-16 01:30:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:30:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:30:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1516 transitions. [2020-10-16 01:30:45,946 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8550479413423576 [2020-10-16 01:30:45,946 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1516 transitions. [2020-10-16 01:30:45,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1516 transitions. [2020-10-16 01:30:45,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:45,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1516 transitions. [2020-10-16 01:30:45,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:30:45,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:30:45,955 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:30:45,955 INFO L185 Difference]: Start difference. First operand has 80 places, 70 transitions, 584 flow. Second operand 9 states and 1516 transitions. [2020-10-16 01:30:45,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 78 transitions, 726 flow [2020-10-16 01:30:45,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 78 transitions, 684 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:45,969 INFO L241 Difference]: Finished difference. Result has 87 places, 72 transitions, 640 flow [2020-10-16 01:30:45,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=640, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2020-10-16 01:30:45,969 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2020-10-16 01:30:45,969 INFO L481 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 640 flow [2020-10-16 01:30:45,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:45,969 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:45,970 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:45,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:30:45,970 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1982007247, now seen corresponding path program 1 times [2020-10-16 01:30:45,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:45,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124679942] [2020-10-16 01:30:45,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:46,057 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:30:46,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124679942] [2020-10-16 01:30:46,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:46,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:46,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608943241] [2020-10-16 01:30:46,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:46,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:46,061 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2020-10-16 01:30:46,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 640 flow. Second operand 5 states. [2020-10-16 01:30:46,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:46,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2020-10-16 01:30:46,062 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:46,300 INFO L129 PetriNetUnfolder]: 512/1187 cut-off events. [2020-10-16 01:30:46,301 INFO L130 PetriNetUnfolder]: For 7467/7916 co-relation queries the response was YES. [2020-10-16 01:30:46,315 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6200 conditions, 1187 events. 512/1187 cut-off events. For 7467/7916 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 9281 event pairs, 15 based on Foata normal form. 23/1105 useless extension candidates. Maximal degree in co-relation 6162. Up to 683 conditions per place. [2020-10-16 01:30:46,326 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 2 changer transitions 3/77 dead transitions. [2020-10-16 01:30:46,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 77 transitions, 718 flow [2020-10-16 01:30:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2020-10-16 01:30:46,331 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8182741116751269 [2020-10-16 01:30:46,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2020-10-16 01:30:46,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2020-10-16 01:30:46,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:46,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2020-10-16 01:30:46,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:46,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:46,340 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:46,340 INFO L185 Difference]: Start difference. First operand has 87 places, 72 transitions, 640 flow. Second operand 5 states and 806 transitions. [2020-10-16 01:30:46,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 77 transitions, 718 flow [2020-10-16 01:30:46,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 77 transitions, 609 flow, removed 40 selfloop flow, removed 6 redundant places. [2020-10-16 01:30:46,464 INFO L241 Difference]: Finished difference. Result has 86 places, 71 transitions, 529 flow [2020-10-16 01:30:46,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=529, PETRI_PLACES=86, PETRI_TRANSITIONS=71} [2020-10-16 01:30:46,465 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2020-10-16 01:30:46,465 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 71 transitions, 529 flow [2020-10-16 01:30:46,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:46,465 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:46,466 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:46,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:30:46,466 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:46,466 INFO L82 PathProgramCache]: Analyzing trace with hash -548029459, now seen corresponding path program 2 times [2020-10-16 01:30:46,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:46,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647141882] [2020-10-16 01:30:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:46,632 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:30:46,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647141882] [2020-10-16 01:30:46,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:46,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:30:46,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881184632] [2020-10-16 01:30:46,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:30:46,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:30:46,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:30:46,644 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2020-10-16 01:30:46,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 529 flow. Second operand 7 states. [2020-10-16 01:30:46,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:46,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2020-10-16 01:30:46,646 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:46,993 INFO L129 PetriNetUnfolder]: 476/1085 cut-off events. [2020-10-16 01:30:46,994 INFO L130 PetriNetUnfolder]: For 4540/6266 co-relation queries the response was YES. [2020-10-16 01:30:47,005 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 1085 events. 476/1085 cut-off events. For 4540/6266 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 8503 event pairs, 6 based on Foata normal form. 471/1451 useless extension candidates. Maximal degree in co-relation 4726. Up to 300 conditions per place. [2020-10-16 01:30:47,009 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 2 selfloop transitions, 33 changer transitions 10/76 dead transitions. [2020-10-16 01:30:47,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 76 transitions, 663 flow [2020-10-16 01:30:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:30:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:30:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1845 transitions. [2020-10-16 01:30:47,016 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8514074757729581 [2020-10-16 01:30:47,016 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1845 transitions. [2020-10-16 01:30:47,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1845 transitions. [2020-10-16 01:30:47,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:47,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1845 transitions. [2020-10-16 01:30:47,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:30:47,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:30:47,030 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:30:47,031 INFO L185 Difference]: Start difference. First operand has 86 places, 71 transitions, 529 flow. Second operand 11 states and 1845 transitions. [2020-10-16 01:30:47,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 76 transitions, 663 flow [2020-10-16 01:30:47,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 622 flow, removed 14 selfloop flow, removed 6 redundant places. [2020-10-16 01:30:47,073 INFO L241 Difference]: Finished difference. Result has 91 places, 66 transitions, 524 flow [2020-10-16 01:30:47,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=524, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2020-10-16 01:30:47,074 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2020-10-16 01:30:47,074 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 524 flow [2020-10-16 01:30:47,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:30:47,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:47,075 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:47,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:30:47,075 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash -225181139, now seen corresponding path program 1 times [2020-10-16 01:30:47,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:47,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556259637] [2020-10-16 01:30:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:47,409 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:30:47,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556259637] [2020-10-16 01:30:47,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:47,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:30:47,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991542613] [2020-10-16 01:30:47,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:30:47,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:47,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:30:47,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:30:47,415 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 197 [2020-10-16 01:30:47,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 66 transitions, 524 flow. Second operand 9 states. [2020-10-16 01:30:47,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:47,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 197 [2020-10-16 01:30:47,416 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:47,744 INFO L129 PetriNetUnfolder]: 536/1264 cut-off events. [2020-10-16 01:30:47,744 INFO L130 PetriNetUnfolder]: For 7282/7958 co-relation queries the response was YES. [2020-10-16 01:30:47,756 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5462 conditions, 1264 events. 536/1264 cut-off events. For 7282/7958 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 10246 event pairs, 4 based on Foata normal form. 66/1200 useless extension candidates. Maximal degree in co-relation 5424. Up to 360 conditions per place. [2020-10-16 01:30:47,763 INFO L132 encePairwiseOnDemand]: 189/197 looper letters, 14 selfloop transitions, 16 changer transitions 2/81 dead transitions. [2020-10-16 01:30:47,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 81 transitions, 698 flow [2020-10-16 01:30:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:30:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:30:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1141 transitions. [2020-10-16 01:30:47,769 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7239847715736041 [2020-10-16 01:30:47,770 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1141 transitions. [2020-10-16 01:30:47,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1141 transitions. [2020-10-16 01:30:47,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:47,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1141 transitions. [2020-10-16 01:30:47,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:30:47,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:30:47,776 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:30:47,776 INFO L185 Difference]: Start difference. First operand has 91 places, 66 transitions, 524 flow. Second operand 8 states and 1141 transitions. [2020-10-16 01:30:47,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 81 transitions, 698 flow [2020-10-16 01:30:47,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 81 transitions, 554 flow, removed 31 selfloop flow, removed 16 redundant places. [2020-10-16 01:30:47,871 INFO L241 Difference]: Finished difference. Result has 86 places, 76 transitions, 531 flow [2020-10-16 01:30:47,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=531, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2020-10-16 01:30:47,871 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2020-10-16 01:30:47,871 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 531 flow [2020-10-16 01:30:47,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:30:47,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:47,872 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:47,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:30:47,872 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash -92487445, now seen corresponding path program 2 times [2020-10-16 01:30:47,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:47,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458682909] [2020-10-16 01:30:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:47,930 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:30:47,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458682909] [2020-10-16 01:30:47,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:47,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:47,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615363116] [2020-10-16 01:30:47,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:47,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:47,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:47,933 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 197 [2020-10-16 01:30:47,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 531 flow. Second operand 5 states. [2020-10-16 01:30:47,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:47,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 197 [2020-10-16 01:30:47,934 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:48,106 INFO L129 PetriNetUnfolder]: 731/1735 cut-off events. [2020-10-16 01:30:48,107 INFO L130 PetriNetUnfolder]: For 3267/3415 co-relation queries the response was YES. [2020-10-16 01:30:48,118 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6232 conditions, 1735 events. 731/1735 cut-off events. For 3267/3415 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 15404 event pairs, 5 based on Foata normal form. 7/1552 useless extension candidates. Maximal degree in co-relation 6202. Up to 515 conditions per place. [2020-10-16 01:30:48,122 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 4 selfloop transitions, 2 changer transitions 22/78 dead transitions. [2020-10-16 01:30:48,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 78 transitions, 557 flow [2020-10-16 01:30:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 813 transitions. [2020-10-16 01:30:48,125 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8253807106598985 [2020-10-16 01:30:48,125 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 813 transitions. [2020-10-16 01:30:48,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 813 transitions. [2020-10-16 01:30:48,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:48,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 813 transitions. [2020-10-16 01:30:48,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:48,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:48,129 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:48,129 INFO L185 Difference]: Start difference. First operand has 86 places, 76 transitions, 531 flow. Second operand 5 states and 813 transitions. [2020-10-16 01:30:48,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 78 transitions, 557 flow [2020-10-16 01:30:48,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 78 transitions, 548 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:48,229 INFO L241 Difference]: Finished difference. Result has 89 places, 56 transitions, 344 flow [2020-10-16 01:30:48,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=89, PETRI_TRANSITIONS=56} [2020-10-16 01:30:48,229 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2020-10-16 01:30:48,229 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 56 transitions, 344 flow [2020-10-16 01:30:48,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:48,230 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:48,230 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:48,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:30:48,230 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1638615119, now seen corresponding path program 3 times [2020-10-16 01:30:48,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:48,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947163448] [2020-10-16 01:30:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:30:48,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:30:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:30:48,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:30:48,339 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:30:48,339 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:30:48,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:30:48,365 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:30:48,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,367 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:30:48,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,368 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:30:48,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,368 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:30:48,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,369 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:30:48,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,369 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:30:48,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,370 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:30:48,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,371 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:30:48,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,371 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:30:48,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,372 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:30:48,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,372 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:30:48,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,372 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:30:48,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,374 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:30:48,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,374 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:30:48,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,376 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:30:48,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,376 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:30:48,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:48,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:48,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:30:48 BasicIcfg [2020-10-16 01:30:48,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:30:48,473 INFO L168 Benchmark]: Toolchain (without parser) took 17112.38 ms. Allocated memory was 248.0 MB in the beginning and 654.8 MB in the end (delta: 406.8 MB). Free memory was 202.4 MB in the beginning and 164.9 MB in the end (delta: 37.5 MB). Peak memory consumption was 444.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:48,474 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:30:48,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.14 ms. Allocated memory was 248.0 MB in the beginning and 305.1 MB in the end (delta: 57.1 MB). Free memory was 202.4 MB in the beginning and 250.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:48,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.29 ms. Allocated memory is still 305.1 MB. Free memory was 250.9 MB in the beginning and 248.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:48,481 INFO L168 Benchmark]: Boogie Preprocessor took 65.65 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 245.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:48,482 INFO L168 Benchmark]: RCFGBuilder took 1981.42 ms. Allocated memory was 305.1 MB in the beginning and 354.9 MB in the end (delta: 49.8 MB). Free memory was 245.9 MB in the beginning and 199.7 MB in the end (delta: 46.2 MB). Peak memory consumption was 96.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:48,484 INFO L168 Benchmark]: TraceAbstraction took 14165.36 ms. Allocated memory was 354.9 MB in the beginning and 654.8 MB in the end (delta: 299.9 MB). Free memory was 199.7 MB in the beginning and 164.9 MB in the end (delta: 34.7 MB). Peak memory consumption was 334.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:48,487 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.26 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 822.14 ms. Allocated memory was 248.0 MB in the beginning and 305.1 MB in the end (delta: 57.1 MB). Free memory was 202.4 MB in the beginning and 250.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.29 ms. Allocated memory is still 305.1 MB. Free memory was 250.9 MB in the beginning and 248.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 65.65 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 245.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1981.42 ms. Allocated memory was 305.1 MB in the beginning and 354.9 MB in the end (delta: 49.8 MB). Free memory was 245.9 MB in the beginning and 199.7 MB in the end (delta: 46.2 MB). Peak memory consumption was 96.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 14165.36 ms. Allocated memory was 354.9 MB in the beginning and 654.8 MB in the end (delta: 299.9 MB). Free memory was 199.7 MB in the beginning and 164.9 MB in the end (delta: 34.7 MB). Peak memory consumption was 334.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1466 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 156 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.1s, 115 PlacesBefore, 41 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 6387 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1485; [L826] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1486; [L828] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1487; [L830] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1488; [L832] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 4 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L838] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L839] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L841] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L841] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 96 SDtfs, 97 SDslu, 108 SDs, 0 SdLazy, 617 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=640occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 41279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...