/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:50:00,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:50:00,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:50:00,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:50:00,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:50:00,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:50:00,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:50:00,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:50:00,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:50:00,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:50:00,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:50:00,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:50:00,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:50:00,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:50:00,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:50:00,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:50:00,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:50:00,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:50:00,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:50:00,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:50:00,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:50:00,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:50:00,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:50:00,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:50:00,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:50:00,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:50:00,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:50:00,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:50:00,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:50:00,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:50:00,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:50:00,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:50:00,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:50:00,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:50:00,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:50:00,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:50:00,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:50:00,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:50:00,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:50:00,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:50:00,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:50:00,917 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-SemanticLooper.epf [2020-10-16 04:50:00,955 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:50:00,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:50:00,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:50:00,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:50:00,958 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:50:00,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:50:00,958 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:50:00,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:50:00,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:50:00,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:50:00,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:50:00,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:50:00,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:50:00,961 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:50:00,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:50:00,961 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:50:00,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:50:00,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:50:00,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:50:00,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:50:00,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:50:00,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:50:00,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:50:00,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:50:00,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:50:00,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:50:00,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:50:00,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:50:00,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:50:01,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:50:01,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:50:01,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:50:01,312 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:50:01,312 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:50:01,313 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2020-10-16 04:50:01,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fc3806b/2983803b3d86493ea8d082fbf488fa7a/FLAG24c69b7a6 [2020-10-16 04:50:01,904 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:50:01,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_tso.opt.i [2020-10-16 04:50:01,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fc3806b/2983803b3d86493ea8d082fbf488fa7a/FLAG24c69b7a6 [2020-10-16 04:50:02,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11fc3806b/2983803b3d86493ea8d082fbf488fa7a [2020-10-16 04:50:02,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:50:02,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:50:02,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:50:02,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:50:02,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:50:02,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:50:02" (1/1) ... [2020-10-16 04:50:02,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e5a5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:02, skipping insertion in model container [2020-10-16 04:50:02,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:50:02" (1/1) ... [2020-10-16 04:50:02,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:50:02,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:50:02,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:50:02,951 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:50:03,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:50:03,085 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:50:03,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03 WrapperNode [2020-10-16 04:50:03,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:50:03,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:50:03,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:50:03,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:50:03,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:50:03,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:50:03,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:50:03,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:50:03,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (1/1) ... [2020-10-16 04:50:03,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:50:03,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:50:03,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:50:03,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:50:03,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (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 04:50:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:50:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:50:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:50:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:50:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:50:03,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:50:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:50:03,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:50:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:50:03,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:50:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:50:03,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:50:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:50:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:50:03,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:50:03,278 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 04:50:05,097 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:50:05,098 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:50:05,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:50:05 BoogieIcfgContainer [2020-10-16 04:50:05,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:50:05,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:50:05,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:50:05,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:50:05,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:50:02" (1/3) ... [2020-10-16 04:50:05,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c44bf6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:50:05, skipping insertion in model container [2020-10-16 04:50:05,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:03" (2/3) ... [2020-10-16 04:50:05,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c44bf6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:50:05, skipping insertion in model container [2020-10-16 04:50:05,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:50:05" (3/3) ... [2020-10-16 04:50:05,109 INFO L111 eAbstractionObserver]: Analyzing ICFG mix039_tso.opt.i [2020-10-16 04:50:05,120 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:50:05,128 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:50:05,129 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:50:05,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,166 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,167 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,169 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,169 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,180 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,181 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,186 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,191 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,199 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,200 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,202 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:05,223 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:50:05,244 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:50:05,244 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:50:05,244 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:50:05,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:50:05,245 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:50:05,245 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:50:05,245 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:50:05,245 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:50:05,259 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:50:05,310 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:50:05,310 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:05,315 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 04:50:05,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:50:05,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2020-10-16 04:50:05,325 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:50:05,329 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:50:05,331 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:50:05,332 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2020-10-16 04:50:05,358 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:50:05,358 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:05,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 04:50:05,363 INFO L117 LiptonReduction]: Number of co-enabled transitions 2432 [2020-10-16 04:50:05,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:05,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:05,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:05,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:05,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:05,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:05,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:05,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:05,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:05,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:05,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:05,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:05,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:05,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:05,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:05,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:06,221 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:50:06,335 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:50:06,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:50:06,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:50:06,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:06,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:06,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:06,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:06,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:06,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:06,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:50:06,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:06,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:06,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:06,708 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 04:50:06,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:06,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:06,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:06,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:06,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:06,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:06,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:06,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:06,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:06,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:06,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:06,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:06,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:06,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:06,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:06,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:06,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:06,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:06,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:06,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:06,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:06,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:50:06,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:06,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:06,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:06,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:06,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:50:06,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:50:06,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:50:07,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:50:07,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:07,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:07,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:07,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:07,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:07,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:50:07,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:50:07,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:07,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:07,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:07,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:07,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:07,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:50:07,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:07,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:07,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:50:07,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:50:07,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:09,392 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 04:50:09,536 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 04:50:09,740 INFO L132 LiptonReduction]: Checked pairs total: 5749 [2020-10-16 04:50:09,741 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 04:50:09,744 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4421 [2020-10-16 04:50:09,757 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 04:50:09,757 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:09,758 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:09,759 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:09,759 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 04:50:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1657424566, now seen corresponding path program 1 times [2020-10-16 04:50:09,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:09,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939606677] [2020-10-16 04:50:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:10,082 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 04:50:10,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939606677] [2020-10-16 04:50:10,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:10,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:50:10,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050891933] [2020-10-16 04:50:10,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:10,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:10,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:10,120 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 203 [2020-10-16 04:50:10,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states. [2020-10-16 04:50:10,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:10,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 203 [2020-10-16 04:50:10,124 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:10,187 INFO L129 PetriNetUnfolder]: 9/52 cut-off events. [2020-10-16 04:50:10,187 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:10,188 INFO L80 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 52 events. 9/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 1 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 76. Up to 17 conditions per place. [2020-10-16 04:50:10,189 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 5 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2020-10-16 04:50:10,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 28 transitions, 82 flow [2020-10-16 04:50:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2020-10-16 04:50:10,210 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8949096880131363 [2020-10-16 04:50:10,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2020-10-16 04:50:10,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2020-10-16 04:50:10,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:10,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2020-10-16 04:50:10,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:10,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:10,230 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:10,233 INFO L185 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 545 transitions. [2020-10-16 04:50:10,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 28 transitions, 82 flow [2020-10-16 04:50:10,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 78 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:50:10,240 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 64 flow [2020-10-16 04:50:10,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2020-10-16 04:50:10,244 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2020-10-16 04:50:10,244 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2020-10-16 04:50:10,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:10,244 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:10,245 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:10,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:50:10,245 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 04:50:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:10,246 INFO L82 PathProgramCache]: Analyzing trace with hash -647820271, now seen corresponding path program 1 times [2020-10-16 04:50:10,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:10,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500686568] [2020-10-16 04:50:10,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:10,370 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 04:50:10,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500686568] [2020-10-16 04:50:10,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:10,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:50:10,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160390358] [2020-10-16 04:50:10,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:10,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:10,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:10,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:10,376 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 203 [2020-10-16 04:50:10,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states. [2020-10-16 04:50:10,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:10,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 203 [2020-10-16 04:50:10,377 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:10,392 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2020-10-16 04:50:10,392 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:10,393 INFO L80 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 38. Up to 5 conditions per place. [2020-10-16 04:50:10,393 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 1 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2020-10-16 04:50:10,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 76 flow [2020-10-16 04:50:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2020-10-16 04:50:10,396 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9113300492610837 [2020-10-16 04:50:10,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2020-10-16 04:50:10,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2020-10-16 04:50:10,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:10,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2020-10-16 04:50:10,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:10,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:10,400 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:10,400 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states and 555 transitions. [2020-10-16 04:50:10,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 76 flow [2020-10-16 04:50:10,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:10,402 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 66 flow [2020-10-16 04:50:10,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2020-10-16 04:50:10,402 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2020-10-16 04:50:10,403 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 66 flow [2020-10-16 04:50:10,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:10,403 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:10,403 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:10,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:50:10,403 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 04:50:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash 204869870, now seen corresponding path program 1 times [2020-10-16 04:50:10,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:10,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629887655] [2020-10-16 04:50:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:10,468 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 04:50:10,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629887655] [2020-10-16 04:50:10,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:10,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:50:10,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053628797] [2020-10-16 04:50:10,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:10,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:10,472 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 203 [2020-10-16 04:50:10,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 66 flow. Second operand 3 states. [2020-10-16 04:50:10,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:10,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 203 [2020-10-16 04:50:10,473 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:10,490 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2020-10-16 04:50:10,490 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 04:50:10,491 INFO L80 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 35 events. 3/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2020-10-16 04:50:10,491 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2020-10-16 04:50:10,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 82 flow [2020-10-16 04:50:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2020-10-16 04:50:10,494 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.90311986863711 [2020-10-16 04:50:10,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2020-10-16 04:50:10,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2020-10-16 04:50:10,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:10,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2020-10-16 04:50:10,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:10,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:10,497 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:10,498 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 66 flow. Second operand 3 states and 550 transitions. [2020-10-16 04:50:10,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 82 flow [2020-10-16 04:50:10,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:10,499 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 81 flow [2020-10-16 04:50:10,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2020-10-16 04:50:10,500 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2020-10-16 04:50:10,500 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 81 flow [2020-10-16 04:50:10,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:10,500 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:10,500 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:10,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:50:10,501 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 04:50:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2055998264, now seen corresponding path program 1 times [2020-10-16 04:50:10,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:10,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879163925] [2020-10-16 04:50:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:10,624 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 04:50:10,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879163925] [2020-10-16 04:50:10,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:10,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:50:10,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164580122] [2020-10-16 04:50:10,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:50:10,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:50:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:50:10,628 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 203 [2020-10-16 04:50:10,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 81 flow. Second operand 4 states. [2020-10-16 04:50:10,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:10,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 203 [2020-10-16 04:50:10,629 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:10,731 INFO L129 PetriNetUnfolder]: 141/274 cut-off events. [2020-10-16 04:50:10,732 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-16 04:50:10,735 INFO L80 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 274 events. 141/274 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1359 event pairs, 74 based on Foata normal form. 20/259 useless extension candidates. Maximal degree in co-relation 560. Up to 163 conditions per place. [2020-10-16 04:50:10,739 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 9 selfloop transitions, 9 changer transitions 2/40 dead transitions. [2020-10-16 04:50:10,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 147 flow [2020-10-16 04:50:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:50:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:50:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2020-10-16 04:50:10,744 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.864039408866995 [2020-10-16 04:50:10,744 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2020-10-16 04:50:10,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2020-10-16 04:50:10,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:10,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2020-10-16 04:50:10,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:50:10,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:50:10,748 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:50:10,749 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 81 flow. Second operand 5 states and 877 transitions. [2020-10-16 04:50:10,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 147 flow [2020-10-16 04:50:10,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:50:10,751 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 147 flow [2020-10-16 04:50:10,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2020-10-16 04:50:10,751 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2020-10-16 04:50:10,752 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 147 flow [2020-10-16 04:50:10,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:50:10,752 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:10,752 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:10,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:50:10,752 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 04:50:10,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2081896902, now seen corresponding path program 1 times [2020-10-16 04:50:10,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:10,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70884297] [2020-10-16 04:50:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:10,832 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 04:50:10,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70884297] [2020-10-16 04:50:10,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:10,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:50:10,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330546152] [2020-10-16 04:50:10,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:10,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:10,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:10,836 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 203 [2020-10-16 04:50:10,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 147 flow. Second operand 3 states. [2020-10-16 04:50:10,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:10,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 203 [2020-10-16 04:50:10,837 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:10,891 INFO L129 PetriNetUnfolder]: 177/341 cut-off events. [2020-10-16 04:50:10,891 INFO L130 PetriNetUnfolder]: For 315/463 co-relation queries the response was YES. [2020-10-16 04:50:10,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 341 events. 177/341 cut-off events. For 315/463 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 1848 event pairs, 95 based on Foata normal form. 21/321 useless extension candidates. Maximal degree in co-relation 989. Up to 261 conditions per place. [2020-10-16 04:50:10,895 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 3 selfloop transitions, 3 changer transitions 4/35 dead transitions. [2020-10-16 04:50:10,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 159 flow [2020-10-16 04:50:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2020-10-16 04:50:10,898 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9014778325123153 [2020-10-16 04:50:10,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2020-10-16 04:50:10,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2020-10-16 04:50:10,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:10,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2020-10-16 04:50:10,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:10,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:10,901 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:10,901 INFO L185 Difference]: Start difference. First operand has 44 places, 35 transitions, 147 flow. Second operand 3 states and 549 transitions. [2020-10-16 04:50:10,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 159 flow [2020-10-16 04:50:10,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:50:10,905 INFO L241 Difference]: Finished difference. Result has 46 places, 31 transitions, 129 flow [2020-10-16 04:50:10,905 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2020-10-16 04:50:10,905 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2020-10-16 04:50:10,905 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 129 flow [2020-10-16 04:50:10,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:10,906 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:10,906 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:10,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:50:10,906 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 04:50:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1726214480, now seen corresponding path program 1 times [2020-10-16 04:50:10,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:10,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702859869] [2020-10-16 04:50:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:11,039 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 04:50:11,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702859869] [2020-10-16 04:50:11,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:11,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:50:11,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550851173] [2020-10-16 04:50:11,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:50:11,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:11,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:50:11,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:50:11,042 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 203 [2020-10-16 04:50:11,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 129 flow. Second operand 5 states. [2020-10-16 04:50:11,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:11,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 203 [2020-10-16 04:50:11,044 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:11,151 INFO L129 PetriNetUnfolder]: 133/273 cut-off events. [2020-10-16 04:50:11,151 INFO L130 PetriNetUnfolder]: For 271/512 co-relation queries the response was YES. [2020-10-16 04:50:11,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 273 events. 133/273 cut-off events. For 271/512 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1291 event pairs, 29 based on Foata normal form. 41/288 useless extension candidates. Maximal degree in co-relation 1005. Up to 213 conditions per place. [2020-10-16 04:50:11,154 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 9 changer transitions 9/44 dead transitions. [2020-10-16 04:50:11,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 253 flow [2020-10-16 04:50:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:50:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:50:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1052 transitions. [2020-10-16 04:50:11,158 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8637110016420362 [2020-10-16 04:50:11,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1052 transitions. [2020-10-16 04:50:11,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1052 transitions. [2020-10-16 04:50:11,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:11,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1052 transitions. [2020-10-16 04:50:11,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:50:11,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:50:11,164 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:50:11,164 INFO L185 Difference]: Start difference. First operand has 46 places, 31 transitions, 129 flow. Second operand 6 states and 1052 transitions. [2020-10-16 04:50:11,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 253 flow [2020-10-16 04:50:11,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 246 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:11,168 INFO L241 Difference]: Finished difference. Result has 50 places, 35 transitions, 194 flow [2020-10-16 04:50:11,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2020-10-16 04:50:11,168 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2020-10-16 04:50:11,168 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 194 flow [2020-10-16 04:50:11,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:50:11,169 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:11,169 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 04:50:11,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:50:11,169 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 04:50:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:11,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1413304935, now seen corresponding path program 1 times [2020-10-16 04:50:11,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:11,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424173606] [2020-10-16 04:50:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:11,293 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 04:50:11,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424173606] [2020-10-16 04:50:11,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:11,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:50:11,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246833386] [2020-10-16 04:50:11,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:50:11,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:11,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:50:11,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:50:11,297 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 203 [2020-10-16 04:50:11,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 194 flow. Second operand 6 states. [2020-10-16 04:50:11,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:11,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 203 [2020-10-16 04:50:11,299 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:11,398 INFO L129 PetriNetUnfolder]: 71/168 cut-off events. [2020-10-16 04:50:11,398 INFO L130 PetriNetUnfolder]: For 406/671 co-relation queries the response was YES. [2020-10-16 04:50:11,399 INFO L80 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 168 events. 71/168 cut-off events. For 406/671 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 671 event pairs, 4 based on Foata normal form. 47/201 useless extension candidates. Maximal degree in co-relation 835. Up to 131 conditions per place. [2020-10-16 04:50:11,400 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 13 changer transitions 9/48 dead transitions. [2020-10-16 04:50:11,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 376 flow [2020-10-16 04:50:11,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:50:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:50:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1227 transitions. [2020-10-16 04:50:11,405 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8634764250527798 [2020-10-16 04:50:11,405 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1227 transitions. [2020-10-16 04:50:11,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1227 transitions. [2020-10-16 04:50:11,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:11,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1227 transitions. [2020-10-16 04:50:11,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:50:11,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:50:11,415 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:50:11,415 INFO L185 Difference]: Start difference. First operand has 50 places, 35 transitions, 194 flow. Second operand 7 states and 1227 transitions. [2020-10-16 04:50:11,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 376 flow [2020-10-16 04:50:11,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 314 flow, removed 26 selfloop flow, removed 4 redundant places. [2020-10-16 04:50:11,422 INFO L241 Difference]: Finished difference. Result has 53 places, 39 transitions, 244 flow [2020-10-16 04:50:11,423 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2020-10-16 04:50:11,423 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2020-10-16 04:50:11,423 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 244 flow [2020-10-16 04:50:11,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:50:11,423 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:11,423 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 04:50:11,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:50:11,426 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 04:50:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:11,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1650000543, now seen corresponding path program 1 times [2020-10-16 04:50:11,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:11,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104145079] [2020-10-16 04:50:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:11,506 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 04:50:11,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104145079] [2020-10-16 04:50:11,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:11,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:50:11,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863334061] [2020-10-16 04:50:11,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:50:11,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:50:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:50:11,510 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 203 [2020-10-16 04:50:11,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 244 flow. Second operand 4 states. [2020-10-16 04:50:11,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:11,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 203 [2020-10-16 04:50:11,511 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:11,572 INFO L129 PetriNetUnfolder]: 98/228 cut-off events. [2020-10-16 04:50:11,573 INFO L130 PetriNetUnfolder]: For 698/864 co-relation queries the response was YES. [2020-10-16 04:50:11,574 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 228 events. 98/228 cut-off events. For 698/864 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1008 event pairs, 8 based on Foata normal form. 14/212 useless extension candidates. Maximal degree in co-relation 1008. Up to 161 conditions per place. [2020-10-16 04:50:11,575 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 4 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2020-10-16 04:50:11,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 266 flow [2020-10-16 04:50:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:50:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:50:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 715 transitions. [2020-10-16 04:50:11,578 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8805418719211823 [2020-10-16 04:50:11,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 715 transitions. [2020-10-16 04:50:11,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 715 transitions. [2020-10-16 04:50:11,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:11,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 715 transitions. [2020-10-16 04:50:11,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:50:11,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:50:11,583 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:50:11,583 INFO L185 Difference]: Start difference. First operand has 53 places, 39 transitions, 244 flow. Second operand 4 states and 715 transitions. [2020-10-16 04:50:11,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 266 flow [2020-10-16 04:50:11,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 212 flow, removed 18 selfloop flow, removed 5 redundant places. [2020-10-16 04:50:11,591 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 203 flow [2020-10-16 04:50:11,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2020-10-16 04:50:11,592 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2020-10-16 04:50:11,592 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 203 flow [2020-10-16 04:50:11,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:50:11,592 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:11,593 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 04:50:11,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:50:11,593 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 04:50:11,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2083150561, now seen corresponding path program 2 times [2020-10-16 04:50:11,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:11,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236798336] [2020-10-16 04:50:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:11,786 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 04:50:11,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236798336] [2020-10-16 04:50:11,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:11,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:50:11,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487769967] [2020-10-16 04:50:11,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:50:11,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:11,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:50:11,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:50:11,790 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 203 [2020-10-16 04:50:11,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 203 flow. Second operand 7 states. [2020-10-16 04:50:11,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:11,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 203 [2020-10-16 04:50:11,791 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:11,910 INFO L129 PetriNetUnfolder]: 77/184 cut-off events. [2020-10-16 04:50:11,910 INFO L130 PetriNetUnfolder]: For 340/632 co-relation queries the response was YES. [2020-10-16 04:50:11,912 INFO L80 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 184 events. 77/184 cut-off events. For 340/632 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 763 event pairs, 0 based on Foata normal form. 65/219 useless extension candidates. Maximal degree in co-relation 709. Up to 101 conditions per place. [2020-10-16 04:50:11,913 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 2 selfloop transitions, 17 changer transitions 6/45 dead transitions. [2020-10-16 04:50:11,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 299 flow [2020-10-16 04:50:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:50:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:50:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1394 transitions. [2020-10-16 04:50:11,920 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8583743842364532 [2020-10-16 04:50:11,921 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1394 transitions. [2020-10-16 04:50:11,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1394 transitions. [2020-10-16 04:50:11,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:11,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1394 transitions. [2020-10-16 04:50:11,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:50:11,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:50:11,928 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:50:11,928 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 203 flow. Second operand 8 states and 1394 transitions. [2020-10-16 04:50:11,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 299 flow [2020-10-16 04:50:11,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 276 flow, removed 10 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:11,934 INFO L241 Difference]: Finished difference. Result has 59 places, 39 transitions, 230 flow [2020-10-16 04:50:11,935 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=230, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2020-10-16 04:50:11,935 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2020-10-16 04:50:11,935 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 230 flow [2020-10-16 04:50:11,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:50:11,935 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:11,936 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] [2020-10-16 04:50:11,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:50:11,936 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 04:50:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:11,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1414397290, now seen corresponding path program 1 times [2020-10-16 04:50:11,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:11,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221212278] [2020-10-16 04:50:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:12,007 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 04:50:12,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221212278] [2020-10-16 04:50:12,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:12,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:50:12,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493709424] [2020-10-16 04:50:12,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:50:12,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:12,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:50:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:50:12,011 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 203 [2020-10-16 04:50:12,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 230 flow. Second operand 4 states. [2020-10-16 04:50:12,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:12,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 203 [2020-10-16 04:50:12,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:12,056 INFO L129 PetriNetUnfolder]: 82/194 cut-off events. [2020-10-16 04:50:12,056 INFO L130 PetriNetUnfolder]: For 405/528 co-relation queries the response was YES. [2020-10-16 04:50:12,058 INFO L80 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 194 events. 82/194 cut-off events. For 405/528 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 827 event pairs, 0 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 680. Up to 81 conditions per place. [2020-10-16 04:50:12,059 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 3 selfloop transitions, 1 changer transitions 1/40 dead transitions. [2020-10-16 04:50:12,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 40 transitions, 242 flow [2020-10-16 04:50:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:50:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:50:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 726 transitions. [2020-10-16 04:50:12,062 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8940886699507389 [2020-10-16 04:50:12,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 726 transitions. [2020-10-16 04:50:12,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 726 transitions. [2020-10-16 04:50:12,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:12,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 726 transitions. [2020-10-16 04:50:12,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:50:12,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:50:12,066 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:50:12,066 INFO L185 Difference]: Start difference. First operand has 59 places, 39 transitions, 230 flow. Second operand 4 states and 726 transitions. [2020-10-16 04:50:12,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 40 transitions, 242 flow [2020-10-16 04:50:12,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 184 flow, removed 16 selfloop flow, removed 8 redundant places. [2020-10-16 04:50:12,071 INFO L241 Difference]: Finished difference. Result has 53 places, 39 transitions, 179 flow [2020-10-16 04:50:12,072 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2020-10-16 04:50:12,072 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2020-10-16 04:50:12,072 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 179 flow [2020-10-16 04:50:12,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:50:12,073 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:12,073 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] [2020-10-16 04:50:12,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:50:12,073 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 04:50:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:12,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1993533514, now seen corresponding path program 2 times [2020-10-16 04:50:12,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:12,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176575816] [2020-10-16 04:50:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:12,445 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 04:50:12,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176575816] [2020-10-16 04:50:12,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:12,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:50:12,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189645159] [2020-10-16 04:50:12,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:50:12,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:12,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:50:12,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:50:12,449 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 203 [2020-10-16 04:50:12,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 179 flow. Second operand 11 states. [2020-10-16 04:50:12,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:12,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 203 [2020-10-16 04:50:12,451 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:13,047 INFO L129 PetriNetUnfolder]: 279/592 cut-off events. [2020-10-16 04:50:13,047 INFO L130 PetriNetUnfolder]: For 710/778 co-relation queries the response was YES. [2020-10-16 04:50:13,050 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 592 events. 279/592 cut-off events. For 710/778 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3426 event pairs, 38 based on Foata normal form. 28/581 useless extension candidates. Maximal degree in co-relation 1929. Up to 364 conditions per place. [2020-10-16 04:50:13,052 INFO L132 encePairwiseOnDemand]: 194/203 looper letters, 19 selfloop transitions, 20 changer transitions 31/86 dead transitions. [2020-10-16 04:50:13,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 549 flow [2020-10-16 04:50:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 04:50:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 04:50:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1936 transitions. [2020-10-16 04:50:13,059 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7336112163698371 [2020-10-16 04:50:13,059 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1936 transitions. [2020-10-16 04:50:13,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1936 transitions. [2020-10-16 04:50:13,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:13,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1936 transitions. [2020-10-16 04:50:13,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 04:50:13,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 04:50:13,069 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 04:50:13,069 INFO L185 Difference]: Start difference. First operand has 53 places, 39 transitions, 179 flow. Second operand 13 states and 1936 transitions. [2020-10-16 04:50:13,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 549 flow [2020-10-16 04:50:13,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 546 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:13,079 INFO L241 Difference]: Finished difference. Result has 72 places, 53 transitions, 367 flow [2020-10-16 04:50:13,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=367, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2020-10-16 04:50:13,080 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2020-10-16 04:50:13,080 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 367 flow [2020-10-16 04:50:13,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:50:13,080 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:13,080 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] [2020-10-16 04:50:13,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:50:13,081 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 04:50:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:13,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1541267652, now seen corresponding path program 3 times [2020-10-16 04:50:13,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:13,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822534081] [2020-10-16 04:50:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:13,236 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 04:50:13,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822534081] [2020-10-16 04:50:13,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:13,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:50:13,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239737633] [2020-10-16 04:50:13,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:50:13,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:50:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:50:13,239 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 203 [2020-10-16 04:50:13,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 367 flow. Second operand 5 states. [2020-10-16 04:50:13,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:13,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 203 [2020-10-16 04:50:13,240 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:13,379 INFO L129 PetriNetUnfolder]: 188/451 cut-off events. [2020-10-16 04:50:13,379 INFO L130 PetriNetUnfolder]: For 2404/2541 co-relation queries the response was YES. [2020-10-16 04:50:13,382 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2127 conditions, 451 events. 188/451 cut-off events. For 2404/2541 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2804 event pairs, 14 based on Foata normal form. 15/422 useless extension candidates. Maximal degree in co-relation 2101. Up to 163 conditions per place. [2020-10-16 04:50:13,383 INFO L132 encePairwiseOnDemand]: 198/203 looper letters, 4 selfloop transitions, 4 changer transitions 15/58 dead transitions. [2020-10-16 04:50:13,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 58 transitions, 427 flow [2020-10-16 04:50:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:50:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:50:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 954 transitions. [2020-10-16 04:50:13,387 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7832512315270936 [2020-10-16 04:50:13,387 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 954 transitions. [2020-10-16 04:50:13,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 954 transitions. [2020-10-16 04:50:13,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:13,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 954 transitions. [2020-10-16 04:50:13,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:50:13,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:50:13,392 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:50:13,393 INFO L185 Difference]: Start difference. First operand has 72 places, 53 transitions, 367 flow. Second operand 6 states and 954 transitions. [2020-10-16 04:50:13,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 58 transitions, 427 flow [2020-10-16 04:50:13,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 388 flow, removed 16 selfloop flow, removed 7 redundant places. [2020-10-16 04:50:13,406 INFO L241 Difference]: Finished difference. Result has 68 places, 43 transitions, 270 flow [2020-10-16 04:50:13,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2020-10-16 04:50:13,407 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2020-10-16 04:50:13,407 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 270 flow [2020-10-16 04:50:13,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:50:13,407 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:13,407 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] [2020-10-16 04:50:13,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:50:13,408 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 04:50:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1665266056, now seen corresponding path program 4 times [2020-10-16 04:50:13,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:13,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648391120] [2020-10-16 04:50:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:50:13,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:50:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:50:13,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:50:13,527 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:50:13,527 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:50:13,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:50:13,529 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:50:13,547 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L2-->L863: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In1599779409 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In1599779409 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In1599779409 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In1599779409 256) 0))) (let ((.cse1 (or .cse8 .cse9)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out1599779409 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1599779409|) (= ~z$r_buff0_thd0~0_In1599779409 ~z$r_buff0_thd0~0_Out1599779409) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1599779409 0)) (or (and .cse0 (or (and .cse1 (= ~z~0_In1599779409 ~z~0_Out1599779409)) (and .cse2 (= ~z$w_buff1~0_In1599779409 ~z~0_Out1599779409) .cse3))) (and (= ~z~0_Out1599779409 ~z$w_buff0~0_In1599779409) .cse4 .cse5)) (or (and .cse1 (= ~z$w_buff1_used~0_In1599779409 ~z$w_buff1_used~0_Out1599779409)) (and (= 0 ~z$w_buff1_used~0_Out1599779409) .cse2 .cse3)) (or (and (= ~z$w_buff0_used~0_Out1599779409 0) .cse4 .cse5) (and .cse0 (= ~z$w_buff0_used~0_In1599779409 ~z$w_buff0_used~0_Out1599779409))) (= ~z$r_buff1_thd0~0_Out1599779409 ~z$r_buff1_thd0~0_In1599779409)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1599779409|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1599779409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1599779409, ~z$w_buff0~0=~z$w_buff0~0_In1599779409, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1599779409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1599779409, ~z$w_buff1~0=~z$w_buff1~0_In1599779409, ~z~0=~z~0_In1599779409} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1599779409, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1599779409|, ~z$w_buff0~0=~z$w_buff0~0_In1599779409, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1599779409, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1599779409|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1599779409|, ~z$w_buff1~0=~z$w_buff1~0_In1599779409, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1599779409|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1599779409|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1599779409|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1599779409, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1599779409|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1599779409, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1599779409, ~z~0=~z~0_Out1599779409} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2020-10-16 04:50:13,554 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 04:50:13,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,557 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 04:50:13,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,557 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 04:50:13,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,558 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 04:50:13,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,558 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 04:50:13,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,558 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 04:50:13,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,559 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 04:50:13,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,559 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 04:50:13,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,559 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 04:50:13,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,560 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 04:50:13,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,560 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 04:50:13,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,561 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 04:50:13,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,562 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 04:50:13,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,562 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 04:50:13,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,563 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 04:50:13,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,563 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 04:50:13,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,563 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 04:50:13,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:13,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:50:13 BasicIcfg [2020-10-16 04:50:13,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:50:13,635 INFO L168 Benchmark]: Toolchain (without parser) took 11360.99 ms. Allocated memory was 245.4 MB in the beginning and 527.4 MB in the end (delta: 282.1 MB). Free memory was 197.2 MB in the beginning and 274.7 MB in the end (delta: -77.6 MB). Peak memory consumption was 204.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:13,636 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 245.4 MB. Free memory is still 219.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:50:13,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.27 ms. Allocated memory was 245.4 MB in the beginning and 297.3 MB in the end (delta: 51.9 MB). Free memory was 197.2 MB in the beginning and 248.0 MB in the end (delta: -50.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:13,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.03 ms. Allocated memory is still 297.3 MB. Free memory was 248.0 MB in the beginning and 243.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:13,638 INFO L168 Benchmark]: Boogie Preprocessor took 49.36 ms. Allocated memory is still 297.3 MB. Free memory is still 243.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:50:13,639 INFO L168 Benchmark]: RCFGBuilder took 1903.65 ms. Allocated memory was 297.3 MB in the beginning and 351.3 MB in the end (delta: 54.0 MB). Free memory was 243.0 MB in the beginning and 225.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:13,639 INFO L168 Benchmark]: TraceAbstraction took 8530.43 ms. Allocated memory was 351.3 MB in the beginning and 527.4 MB in the end (delta: 176.2 MB). Free memory was 225.4 MB in the beginning and 274.7 MB in the end (delta: -49.3 MB). Peak memory consumption was 126.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:13,643 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.37 ms. Allocated memory is still 245.4 MB. Free memory is still 219.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 810.27 ms. Allocated memory was 245.4 MB in the beginning and 297.3 MB in the end (delta: 51.9 MB). Free memory was 197.2 MB in the beginning and 248.0 MB in the end (delta: -50.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.03 ms. Allocated memory is still 297.3 MB. Free memory was 248.0 MB in the beginning and 243.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 49.36 ms. Allocated memory is still 297.3 MB. Free memory is still 243.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1903.65 ms. Allocated memory was 297.3 MB in the beginning and 351.3 MB in the end (delta: 54.0 MB). Free memory was 243.0 MB in the beginning and 225.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8530.43 ms. Allocated memory was 351.3 MB in the beginning and 527.4 MB in the end (delta: 176.2 MB). Free memory was 225.4 MB in the beginning and 274.7 MB in the end (delta: -49.3 MB). Peak memory consumption was 126.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1545 VarBasedMoverChecksPositive, 76 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 173 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.4s, 119 PlacesBefore, 40 PlacesAfterwards, 108 TransitionsBefore, 27 TransitionsAfterwards, 2432 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5749 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_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L845] 0 pthread_t t1053; [L846] FCALL, FORK 0 pthread_create(&t1053, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L847] 0 pthread_t t1054; [L848] FCALL, FORK 0 pthread_create(&t1054, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L849] 0 pthread_t t1055; [L850] FCALL, FORK 0 pthread_create(&t1055, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L851] 0 pthread_t t1056; [L852] FCALL, FORK 0 pthread_create(&t1056, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L801] 4 z$w_buff1 = z$w_buff0 [L802] 4 z$w_buff0 = 1 [L803] 4 z$w_buff1_used = z$w_buff0_used [L804] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 a = 1 [L817] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0 [L781] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = z [L788] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L788] 3 z = z$flush_delayed ? z$mem_tmp : z [L789] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L823] 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) [L823] 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) [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 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 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L827] 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 [L830] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 4 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 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: 8.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 49 SDtfs, 31 SDslu, 50 SDs, 0 SdLazy, 565 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=11, 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.0s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 18517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...