/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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:22:47,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:22:47,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:22:47,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:22:47,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:22:47,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:22:47,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:22:47,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:22:47,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:22:47,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:22:47,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:22:47,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:22:47,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:22:47,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:22:47,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:22:47,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:22:47,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:22:47,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:22:47,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:22:47,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:22:47,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:22:47,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:22:47,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:22:47,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:22:47,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:22:47,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:22:47,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:22:47,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:22:47,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:22:47,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:22:47,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:22:47,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:22:47,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:22:47,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:22:47,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:22:47,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:22:47,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:22:47,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:22:47,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:22:47,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:22:47,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:22:47,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:22:47,955 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:22:47,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:22:47,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:22:47,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:22:47,957 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:22:47,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:22:47,957 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:22:47,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:22:47,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:22:47,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:22:47,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:22:47,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:22:47,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:22:47,958 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:22:47,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:22:47,959 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:22:47,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:22:47,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:22:47,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:22:47,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:22:47,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:22:47,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:22:47,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:22:47,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:22:47,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:22:47,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:22:47,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:22:47,961 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:22:47,961 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:22:47,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:22:48,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:22:48,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:22:48,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:22:48,273 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:22:48,274 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:22:48,275 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-11 18:22:48,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8485ccb1/7d728e8910d44e4eaf72a8822614be60/FLAGca4003d52 [2020-10-11 18:22:48,937 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:22:48,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-11 18:22:48,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8485ccb1/7d728e8910d44e4eaf72a8822614be60/FLAGca4003d52 [2020-10-11 18:22:49,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8485ccb1/7d728e8910d44e4eaf72a8822614be60 [2020-10-11 18:22:49,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:22:49,273 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:22:49,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:22:49,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:22:49,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:22:49,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:49" (1/1) ... [2020-10-11 18:22:49,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e780cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:49, skipping insertion in model container [2020-10-11 18:22:49,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:49" (1/1) ... [2020-10-11 18:22:49,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:22:49,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:22:49,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:22:49,912 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:22:49,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:22:50,041 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:22:50,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50 WrapperNode [2020-10-11 18:22:50,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:22:50,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:22:50,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:22:50,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:22:50,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:22:50,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:22:50,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:22:50,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:22:50,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (1/1) ... [2020-10-11 18:22:50,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:22:50,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:22:50,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:22:50,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:22:50,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (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-11 18:22:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:22:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:22:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:22:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:22:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:22:50,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:22:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:22:50,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:22:50,230 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:22:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:22:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:22:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:22:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:22:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:22:50,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:22:50,234 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:22:52,219 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:22:52,220 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:22:52,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:52 BoogieIcfgContainer [2020-10-11 18:22:52,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:22:52,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:22:52,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:22:52,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:22:52,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:22:49" (1/3) ... [2020-10-11 18:22:52,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f023067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:52, skipping insertion in model container [2020-10-11 18:22:52,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:50" (2/3) ... [2020-10-11 18:22:52,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f023067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:52, skipping insertion in model container [2020-10-11 18:22:52,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:52" (3/3) ... [2020-10-11 18:22:52,231 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2020-10-11 18:22:52,243 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:22:52,251 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:22:52,252 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:22:52,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,286 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,286 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,288 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,288 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,291 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,291 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,292 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,292 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,295 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,306 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,306 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,309 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,310 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,312 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,313 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:52,331 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:22:52,353 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:22:52,353 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:22:52,353 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:22:52,353 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:22:52,353 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:22:52,354 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:22:52,354 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:22:52,354 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:22:52,369 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-11 18:22:52,421 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-11 18:22:52,422 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:52,427 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-11 18:22:52,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow [2020-10-11 18:22:52,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow [2020-10-11 18:22:52,457 INFO L129 PetriNetUnfolder]: 0/70 cut-off events. [2020-10-11 18:22:52,458 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:52,458 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:52,459 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:52,460 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-11 18:22:52,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:52,467 INFO L82 PathProgramCache]: Analyzing trace with hash 680024380, now seen corresponding path program 1 times [2020-10-11 18:22:52,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:52,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245904572] [2020-10-11 18:22:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:52,916 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-11 18:22:52,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245904572] [2020-10-11 18:22:52,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:52,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:22:52,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724456378] [2020-10-11 18:22:52,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:22:52,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:22:52,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:22:53,044 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 111 [2020-10-11 18:22:53,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 107 transitions, 226 flow. Second operand 3 states. [2020-10-11 18:22:53,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:53,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 111 [2020-10-11 18:22:53,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:53,083 INFO L129 PetriNetUnfolder]: 0/104 cut-off events. [2020-10-11 18:22:53,084 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:53,084 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 104 events. 0/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 4/106 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:22:53,086 INFO L132 encePairwiseOnDemand]: 106/111 looper letters, 0 selfloop transitions, 2 changer transitions 13/104 dead transitions. [2020-10-11 18:22:53,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 104 transitions, 224 flow [2020-10-11 18:22:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:22:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:22:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2020-10-11 18:22:53,103 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.975975975975976 [2020-10-11 18:22:53,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2020-10-11 18:22:53,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2020-10-11 18:22:53,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:53,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2020-10-11 18:22:53,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:22:53,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:22:53,121 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:22:53,124 INFO L185 Difference]: Start difference. First operand has 118 places, 107 transitions, 226 flow. Second operand 3 states and 325 transitions. [2020-10-11 18:22:53,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 104 transitions, 224 flow [2020-10-11 18:22:53,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 104 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:22:53,133 INFO L241 Difference]: Finished difference. Result has 115 places, 91 transitions, 194 flow [2020-10-11 18:22:53,136 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=115, PETRI_TRANSITIONS=91} [2020-10-11 18:22:53,137 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2020-10-11 18:22:53,138 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 91 transitions, 194 flow [2020-10-11 18:22:53,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:22:53,138 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:53,138 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:53,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:22:53,139 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-11 18:22:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1652369391, now seen corresponding path program 1 times [2020-10-11 18:22:53,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:53,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904761951] [2020-10-11 18:22:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:53,497 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-11 18:22:53,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904761951] [2020-10-11 18:22:53,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:53,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:22:53,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861465450] [2020-10-11 18:22:53,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:22:53,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:22:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:22:54,095 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2020-10-11 18:22:54,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 91 transitions, 194 flow. Second operand 10 states. [2020-10-11 18:22:54,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:54,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2020-10-11 18:22:54,097 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:54,543 INFO L129 PetriNetUnfolder]: 108/377 cut-off events. [2020-10-11 18:22:54,544 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2020-10-11 18:22:54,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 377 events. 108/377 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1799 event pairs, 47 based on Foata normal form. 9/376 useless extension candidates. Maximal degree in co-relation 575. Up to 125 conditions per place. [2020-10-11 18:22:54,549 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 12 selfloop transitions, 10 changer transitions 34/132 dead transitions. [2020-10-11 18:22:54,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 132 transitions, 402 flow [2020-10-11 18:22:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:22:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:22:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1454 transitions. [2020-10-11 18:22:54,557 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8732732732732733 [2020-10-11 18:22:54,557 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1454 transitions. [2020-10-11 18:22:54,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1454 transitions. [2020-10-11 18:22:54,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:54,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1454 transitions. [2020-10-11 18:22:54,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:22:54,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:22:54,567 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:22:54,567 INFO L185 Difference]: Start difference. First operand has 115 places, 91 transitions, 194 flow. Second operand 15 states and 1454 transitions. [2020-10-11 18:22:54,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 132 transitions, 402 flow [2020-10-11 18:22:54,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 132 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:22:54,573 INFO L241 Difference]: Finished difference. Result has 125 places, 97 transitions, 274 flow [2020-10-11 18:22:54,574 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=274, PETRI_PLACES=125, PETRI_TRANSITIONS=97} [2020-10-11 18:22:54,574 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 7 predicate places. [2020-10-11 18:22:54,575 INFO L481 AbstractCegarLoop]: Abstraction has has 125 places, 97 transitions, 274 flow [2020-10-11 18:22:54,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:22:54,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:54,575 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:54,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:22:54,576 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-11 18:22:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1778517393, now seen corresponding path program 1 times [2020-10-11 18:22:54,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:54,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258899886] [2020-10-11 18:22:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:54,816 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-11 18:22:54,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258899886] [2020-10-11 18:22:54,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:54,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:22:54,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376798163] [2020-10-11 18:22:54,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:22:54,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:22:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:22:55,519 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:22:55,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 97 transitions, 274 flow. Second operand 10 states. [2020-10-11 18:22:55,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:55,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:22:55,520 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:56,334 INFO L129 PetriNetUnfolder]: 429/1110 cut-off events. [2020-10-11 18:22:56,334 INFO L130 PetriNetUnfolder]: For 2081/2189 co-relation queries the response was YES. [2020-10-11 18:22:56,343 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 1110 events. 429/1110 cut-off events. For 2081/2189 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7536 event pairs, 100 based on Foata normal form. 33/1120 useless extension candidates. Maximal degree in co-relation 3034. Up to 268 conditions per place. [2020-10-11 18:22:56,351 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 34 selfloop transitions, 15 changer transitions 64/187 dead transitions. [2020-10-11 18:22:56,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 187 transitions, 961 flow [2020-10-11 18:22:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-11 18:22:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-11 18:22:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1851 transitions. [2020-10-11 18:22:56,358 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8776671408250356 [2020-10-11 18:22:56,358 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1851 transitions. [2020-10-11 18:22:56,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1851 transitions. [2020-10-11 18:22:56,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:56,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1851 transitions. [2020-10-11 18:22:56,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 20 states. [2020-10-11 18:22:56,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 20 states. [2020-10-11 18:22:56,368 INFO L81 ComplementDD]: Finished complementDD. Result 20 states. [2020-10-11 18:22:56,368 INFO L185 Difference]: Start difference. First operand has 125 places, 97 transitions, 274 flow. Second operand 19 states and 1851 transitions. [2020-10-11 18:22:56,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 187 transitions, 961 flow [2020-10-11 18:22:56,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 187 transitions, 929 flow, removed 14 selfloop flow, removed 5 redundant places. [2020-10-11 18:22:56,380 INFO L241 Difference]: Finished difference. Result has 145 places, 107 transitions, 401 flow [2020-10-11 18:22:56,381 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=401, PETRI_PLACES=145, PETRI_TRANSITIONS=107} [2020-10-11 18:22:56,381 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2020-10-11 18:22:56,381 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 107 transitions, 401 flow [2020-10-11 18:22:56,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:22:56,381 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:56,382 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:56,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:22:56,382 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-11 18:22:56,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:56,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1702136028, now seen corresponding path program 1 times [2020-10-11 18:22:56,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:56,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739781542] [2020-10-11 18:22:56,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:56,556 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-11 18:22:56,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739781542] [2020-10-11 18:22:56,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:56,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:56,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167342818] [2020-10-11 18:22:56,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:56,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:56,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:56,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:56,729 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 111 [2020-10-11 18:22:56,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 107 transitions, 401 flow. Second operand 6 states. [2020-10-11 18:22:56,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:56,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 111 [2020-10-11 18:22:56,730 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:56,952 INFO L129 PetriNetUnfolder]: 72/437 cut-off events. [2020-10-11 18:22:56,952 INFO L130 PetriNetUnfolder]: For 2403/2413 co-relation queries the response was YES. [2020-10-11 18:22:56,958 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 437 events. 72/437 cut-off events. For 2403/2413 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2543 event pairs, 24 based on Foata normal form. 14/443 useless extension candidates. Maximal degree in co-relation 1399. Up to 86 conditions per place. [2020-10-11 18:22:56,961 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2020-10-11 18:22:56,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 118 transitions, 528 flow [2020-10-11 18:22:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 929 transitions. [2020-10-11 18:22:56,965 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.92992992992993 [2020-10-11 18:22:56,965 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 929 transitions. [2020-10-11 18:22:56,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 929 transitions. [2020-10-11 18:22:56,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:56,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 929 transitions. [2020-10-11 18:22:56,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:56,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:56,971 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:56,971 INFO L185 Difference]: Start difference. First operand has 145 places, 107 transitions, 401 flow. Second operand 9 states and 929 transitions. [2020-10-11 18:22:56,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 118 transitions, 528 flow [2020-10-11 18:22:56,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 118 transitions, 456 flow, removed 35 selfloop flow, removed 13 redundant places. [2020-10-11 18:22:56,980 INFO L241 Difference]: Finished difference. Result has 131 places, 116 transitions, 454 flow [2020-10-11 18:22:56,980 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2020-10-11 18:22:56,981 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2020-10-11 18:22:56,981 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 454 flow [2020-10-11 18:22:56,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:56,981 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:56,981 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:56,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:22:56,982 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-11 18:22:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1415220145, now seen corresponding path program 1 times [2020-10-11 18:22:56,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:56,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296681819] [2020-10-11 18:22:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:57,124 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-11 18:22:57,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296681819] [2020-10-11 18:22:57,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:57,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:57,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593080766] [2020-10-11 18:22:57,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:57,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:57,222 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:22:57,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 454 flow. Second operand 6 states. [2020-10-11 18:22:57,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:57,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:22:57,223 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:57,596 INFO L129 PetriNetUnfolder]: 454/1305 cut-off events. [2020-10-11 18:22:57,596 INFO L130 PetriNetUnfolder]: For 3579/3605 co-relation queries the response was YES. [2020-10-11 18:22:57,609 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 1305 events. 454/1305 cut-off events. For 3579/3605 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10422 event pairs, 158 based on Foata normal form. 16/1268 useless extension candidates. Maximal degree in co-relation 3942. Up to 378 conditions per place. [2020-10-11 18:22:57,617 INFO L132 encePairwiseOnDemand]: 104/111 looper letters, 23 selfloop transitions, 25 changer transitions 0/148 dead transitions. [2020-10-11 18:22:57,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 148 transitions, 734 flow [2020-10-11 18:22:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 932 transitions. [2020-10-11 18:22:57,622 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9329329329329329 [2020-10-11 18:22:57,622 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 932 transitions. [2020-10-11 18:22:57,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 932 transitions. [2020-10-11 18:22:57,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:57,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 932 transitions. [2020-10-11 18:22:57,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:57,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:57,630 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:57,630 INFO L185 Difference]: Start difference. First operand has 131 places, 116 transitions, 454 flow. Second operand 9 states and 932 transitions. [2020-10-11 18:22:57,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 148 transitions, 734 flow [2020-10-11 18:22:57,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 148 transitions, 696 flow, removed 19 selfloop flow, removed 1 redundant places. [2020-10-11 18:22:57,647 INFO L241 Difference]: Finished difference. Result has 143 places, 140 transitions, 708 flow [2020-10-11 18:22:57,648 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=708, PETRI_PLACES=143, PETRI_TRANSITIONS=140} [2020-10-11 18:22:57,648 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2020-10-11 18:22:57,648 INFO L481 AbstractCegarLoop]: Abstraction has has 143 places, 140 transitions, 708 flow [2020-10-11 18:22:57,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:57,648 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:57,649 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:57,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:22:57,649 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-11 18:22:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:57,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2065626192, now seen corresponding path program 1 times [2020-10-11 18:22:57,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:57,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780717045] [2020-10-11 18:22:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:58,025 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-11 18:22:58,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780717045] [2020-10-11 18:22:58,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:58,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:22:58,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600145111] [2020-10-11 18:22:58,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:22:58,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:22:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:22:58,817 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2020-10-11 18:22:58,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 140 transitions, 708 flow. Second operand 10 states. [2020-10-11 18:22:58,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:58,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2020-10-11 18:22:58,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:59,624 INFO L129 PetriNetUnfolder]: 980/2567 cut-off events. [2020-10-11 18:22:59,625 INFO L130 PetriNetUnfolder]: For 9041/9205 co-relation queries the response was YES. [2020-10-11 18:22:59,647 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8787 conditions, 2567 events. 980/2567 cut-off events. For 9041/9205 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 22404 event pairs, 343 based on Foata normal form. 32/2526 useless extension candidates. Maximal degree in co-relation 8709. Up to 783 conditions per place. [2020-10-11 18:22:59,656 INFO L132 encePairwiseOnDemand]: 100/111 looper letters, 14 selfloop transitions, 13 changer transitions 89/200 dead transitions. [2020-10-11 18:22:59,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 200 transitions, 1450 flow [2020-10-11 18:22:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:22:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:22:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1254 transitions. [2020-10-11 18:22:59,661 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8690228690228691 [2020-10-11 18:22:59,661 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1254 transitions. [2020-10-11 18:22:59,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1254 transitions. [2020-10-11 18:22:59,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:59,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1254 transitions. [2020-10-11 18:22:59,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:22:59,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:22:59,669 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:22:59,669 INFO L185 Difference]: Start difference. First operand has 143 places, 140 transitions, 708 flow. Second operand 13 states and 1254 transitions. [2020-10-11 18:22:59,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 200 transitions, 1450 flow [2020-10-11 18:22:59,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 200 transitions, 1438 flow, removed 6 selfloop flow, removed 0 redundant places. [2020-10-11 18:22:59,711 INFO L241 Difference]: Finished difference. Result has 162 places, 110 transitions, 481 flow [2020-10-11 18:22:59,712 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=481, PETRI_PLACES=162, PETRI_TRANSITIONS=110} [2020-10-11 18:22:59,712 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 44 predicate places. [2020-10-11 18:22:59,712 INFO L481 AbstractCegarLoop]: Abstraction has has 162 places, 110 transitions, 481 flow [2020-10-11 18:22:59,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:22:59,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:59,713 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:59,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:22:59,713 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-11 18:22:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash 471507918, now seen corresponding path program 1 times [2020-10-11 18:22:59,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:59,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321397079] [2020-10-11 18:22:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:59,983 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-11 18:22:59,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321397079] [2020-10-11 18:22:59,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:59,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:22:59,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541449831] [2020-10-11 18:22:59,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:22:59,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:22:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:23:00,726 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 111 [2020-10-11 18:23:00,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 110 transitions, 481 flow. Second operand 10 states. [2020-10-11 18:23:00,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:00,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 111 [2020-10-11 18:23:00,731 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:01,169 INFO L129 PetriNetUnfolder]: 241/908 cut-off events. [2020-10-11 18:23:01,169 INFO L130 PetriNetUnfolder]: For 5655/5784 co-relation queries the response was YES. [2020-10-11 18:23:01,180 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3416 conditions, 908 events. 241/908 cut-off events. For 5655/5784 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6488 event pairs, 42 based on Foata normal form. 24/897 useless extension candidates. Maximal degree in co-relation 3327. Up to 236 conditions per place. [2020-10-11 18:23:01,187 INFO L132 encePairwiseOnDemand]: 102/111 looper letters, 25 selfloop transitions, 8 changer transitions 19/137 dead transitions. [2020-10-11 18:23:01,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 137 transitions, 865 flow [2020-10-11 18:23:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:23:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:23:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1088 transitions. [2020-10-11 18:23:01,193 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8910728910728911 [2020-10-11 18:23:01,193 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1088 transitions. [2020-10-11 18:23:01,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1088 transitions. [2020-10-11 18:23:01,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:01,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1088 transitions. [2020-10-11 18:23:01,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:23:01,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:23:01,200 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:23:01,200 INFO L185 Difference]: Start difference. First operand has 162 places, 110 transitions, 481 flow. Second operand 11 states and 1088 transitions. [2020-10-11 18:23:01,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 137 transitions, 865 flow [2020-10-11 18:23:01,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 137 transitions, 730 flow, removed 55 selfloop flow, removed 18 redundant places. [2020-10-11 18:23:01,213 INFO L241 Difference]: Finished difference. Result has 143 places, 112 transitions, 484 flow [2020-10-11 18:23:01,213 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=484, PETRI_PLACES=143, PETRI_TRANSITIONS=112} [2020-10-11 18:23:01,213 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2020-10-11 18:23:01,214 INFO L481 AbstractCegarLoop]: Abstraction has has 143 places, 112 transitions, 484 flow [2020-10-11 18:23:01,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:23:01,214 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:01,214 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:01,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:23:01,214 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-11 18:23:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash -20221463, now seen corresponding path program 1 times [2020-10-11 18:23:01,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:01,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714793265] [2020-10-11 18:23:01,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:01,641 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-11 18:23:01,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714793265] [2020-10-11 18:23:01,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:01,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:23:01,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162224529] [2020-10-11 18:23:01,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:23:01,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:01,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:23:01,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:23:03,478 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2020-10-11 18:23:03,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 112 transitions, 484 flow. Second operand 13 states. [2020-10-11 18:23:03,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:03,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2020-10-11 18:23:03,480 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:04,000 INFO L129 PetriNetUnfolder]: 199/747 cut-off events. [2020-10-11 18:23:04,000 INFO L130 PetriNetUnfolder]: For 5502/5705 co-relation queries the response was YES. [2020-10-11 18:23:04,007 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3116 conditions, 747 events. 199/747 cut-off events. For 5502/5705 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4811 event pairs, 46 based on Foata normal form. 22/735 useless extension candidates. Maximal degree in co-relation 3032. Up to 298 conditions per place. [2020-10-11 18:23:04,014 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 26 selfloop transitions, 13 changer transitions 7/128 dead transitions. [2020-10-11 18:23:04,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 128 transitions, 776 flow [2020-10-11 18:23:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:23:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:23:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1035 transitions. [2020-10-11 18:23:04,019 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8476658476658476 [2020-10-11 18:23:04,019 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1035 transitions. [2020-10-11 18:23:04,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1035 transitions. [2020-10-11 18:23:04,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:04,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1035 transitions. [2020-10-11 18:23:04,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:23:04,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:23:04,026 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:23:04,026 INFO L185 Difference]: Start difference. First operand has 143 places, 112 transitions, 484 flow. Second operand 11 states and 1035 transitions. [2020-10-11 18:23:04,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 128 transitions, 776 flow [2020-10-11 18:23:04,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 128 transitions, 696 flow, removed 33 selfloop flow, removed 9 redundant places. [2020-10-11 18:23:04,037 INFO L241 Difference]: Finished difference. Result has 143 places, 117 transitions, 545 flow [2020-10-11 18:23:04,037 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=545, PETRI_PLACES=143, PETRI_TRANSITIONS=117} [2020-10-11 18:23:04,038 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2020-10-11 18:23:04,038 INFO L481 AbstractCegarLoop]: Abstraction has has 143 places, 117 transitions, 545 flow [2020-10-11 18:23:04,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:23:04,038 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:04,038 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:04,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:23:04,039 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-11 18:23:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1770285355, now seen corresponding path program 2 times [2020-10-11 18:23:04,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:04,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353106958] [2020-10-11 18:23:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:04,345 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-11 18:23:04,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353106958] [2020-10-11 18:23:04,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:04,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:23:04,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540290703] [2020-10-11 18:23:04,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:23:04,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:04,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:23:04,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:23:05,699 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2020-10-11 18:23:05,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 117 transitions, 545 flow. Second operand 13 states. [2020-10-11 18:23:05,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:05,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2020-10-11 18:23:05,701 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:06,153 INFO L129 PetriNetUnfolder]: 202/747 cut-off events. [2020-10-11 18:23:06,153 INFO L130 PetriNetUnfolder]: For 4492/4900 co-relation queries the response was YES. [2020-10-11 18:23:06,159 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 747 events. 202/747 cut-off events. For 4492/4900 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4805 event pairs, 29 based on Foata normal form. 32/745 useless extension candidates. Maximal degree in co-relation 2975. Up to 298 conditions per place. [2020-10-11 18:23:06,165 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 27 selfloop transitions, 14 changer transitions 10/133 dead transitions. [2020-10-11 18:23:06,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 133 transitions, 825 flow [2020-10-11 18:23:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:23:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:23:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1312 transitions. [2020-10-11 18:23:06,170 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8442728442728443 [2020-10-11 18:23:06,170 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1312 transitions. [2020-10-11 18:23:06,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1312 transitions. [2020-10-11 18:23:06,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:06,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1312 transitions. [2020-10-11 18:23:06,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:23:06,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:23:06,177 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:23:06,178 INFO L185 Difference]: Start difference. First operand has 143 places, 117 transitions, 545 flow. Second operand 14 states and 1312 transitions. [2020-10-11 18:23:06,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 133 transitions, 825 flow [2020-10-11 18:23:06,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 133 transitions, 764 flow, removed 24 selfloop flow, removed 7 redundant places. [2020-10-11 18:23:06,189 INFO L241 Difference]: Finished difference. Result has 153 places, 119 transitions, 585 flow [2020-10-11 18:23:06,190 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=585, PETRI_PLACES=153, PETRI_TRANSITIONS=119} [2020-10-11 18:23:06,190 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 35 predicate places. [2020-10-11 18:23:06,190 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 119 transitions, 585 flow [2020-10-11 18:23:06,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:23:06,190 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:06,191 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:06,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:23:06,191 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-11 18:23:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2049405231, now seen corresponding path program 3 times [2020-10-11 18:23:06,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:06,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319639109] [2020-10-11 18:23:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:06,603 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-11 18:23:06,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319639109] [2020-10-11 18:23:06,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:06,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:23:06,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986724622] [2020-10-11 18:23:06,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:23:06,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:06,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:23:06,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:23:08,239 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:23:08,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 119 transitions, 585 flow. Second operand 13 states. [2020-10-11 18:23:08,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:08,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:23:08,241 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:08,798 INFO L129 PetriNetUnfolder]: 203/807 cut-off events. [2020-10-11 18:23:08,799 INFO L130 PetriNetUnfolder]: For 7042/7357 co-relation queries the response was YES. [2020-10-11 18:23:08,807 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 807 events. 203/807 cut-off events. For 7042/7357 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5580 event pairs, 12 based on Foata normal form. 63/837 useless extension candidates. Maximal degree in co-relation 3364. Up to 259 conditions per place. [2020-10-11 18:23:08,821 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 28 selfloop transitions, 19 changer transitions 10/140 dead transitions. [2020-10-11 18:23:08,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 140 transitions, 979 flow [2020-10-11 18:23:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:23:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:23:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1328 transitions. [2020-10-11 18:23:08,828 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8545688545688546 [2020-10-11 18:23:08,828 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1328 transitions. [2020-10-11 18:23:08,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1328 transitions. [2020-10-11 18:23:08,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:08,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1328 transitions. [2020-10-11 18:23:08,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:23:08,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:23:08,840 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:23:08,840 INFO L185 Difference]: Start difference. First operand has 153 places, 119 transitions, 585 flow. Second operand 14 states and 1328 transitions. [2020-10-11 18:23:08,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 140 transitions, 979 flow [2020-10-11 18:23:08,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 140 transitions, 844 flow, removed 55 selfloop flow, removed 12 redundant places. [2020-10-11 18:23:08,859 INFO L241 Difference]: Finished difference. Result has 155 places, 123 transitions, 642 flow [2020-10-11 18:23:08,862 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=642, PETRI_PLACES=155, PETRI_TRANSITIONS=123} [2020-10-11 18:23:08,863 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2020-10-11 18:23:08,863 INFO L481 AbstractCegarLoop]: Abstraction has has 155 places, 123 transitions, 642 flow [2020-10-11 18:23:08,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:23:08,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:08,864 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:08,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:23:08,865 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-11 18:23:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:08,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1579382555, now seen corresponding path program 4 times [2020-10-11 18:23:08,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:08,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705930710] [2020-10-11 18:23:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:09,315 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-11 18:23:09,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705930710] [2020-10-11 18:23:09,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:09,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:23:09,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777133855] [2020-10-11 18:23:09,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:23:09,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:23:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:23:11,538 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2020-10-11 18:23:11,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 123 transitions, 642 flow. Second operand 13 states. [2020-10-11 18:23:11,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:11,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2020-10-11 18:23:11,540 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:12,067 INFO L129 PetriNetUnfolder]: 208/834 cut-off events. [2020-10-11 18:23:12,068 INFO L130 PetriNetUnfolder]: For 8466/8799 co-relation queries the response was YES. [2020-10-11 18:23:12,074 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 834 events. 208/834 cut-off events. For 8466/8799 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5732 event pairs, 35 based on Foata normal form. 41/843 useless extension candidates. Maximal degree in co-relation 3652. Up to 322 conditions per place. [2020-10-11 18:23:12,080 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 31 selfloop transitions, 18 changer transitions 10/141 dead transitions. [2020-10-11 18:23:12,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 141 transitions, 1018 flow [2020-10-11 18:23:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:23:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:23:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1311 transitions. [2020-10-11 18:23:12,083 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8436293436293436 [2020-10-11 18:23:12,084 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1311 transitions. [2020-10-11 18:23:12,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1311 transitions. [2020-10-11 18:23:12,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:12,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1311 transitions. [2020-10-11 18:23:12,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:23:12,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:23:12,089 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:23:12,089 INFO L185 Difference]: Start difference. First operand has 155 places, 123 transitions, 642 flow. Second operand 14 states and 1311 transitions. [2020-10-11 18:23:12,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 141 transitions, 1018 flow [2020-10-11 18:23:12,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 141 transitions, 941 flow, removed 32 selfloop flow, removed 11 redundant places. [2020-10-11 18:23:12,104 INFO L241 Difference]: Finished difference. Result has 158 places, 127 transitions, 737 flow [2020-10-11 18:23:12,105 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=737, PETRI_PLACES=158, PETRI_TRANSITIONS=127} [2020-10-11 18:23:12,105 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2020-10-11 18:23:12,105 INFO L481 AbstractCegarLoop]: Abstraction has has 158 places, 127 transitions, 737 flow [2020-10-11 18:23:12,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:23:12,105 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:12,105 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:12,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:23:12,106 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-11 18:23:12,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash -290127947, now seen corresponding path program 5 times [2020-10-11 18:23:12,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:12,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920290983] [2020-10-11 18:23:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:12,387 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-11 18:23:12,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920290983] [2020-10-11 18:23:12,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:12,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:23:12,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52111845] [2020-10-11 18:23:12,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:23:12,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:23:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:23:14,224 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2020-10-11 18:23:14,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 127 transitions, 737 flow. Second operand 12 states. [2020-10-11 18:23:14,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:14,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2020-10-11 18:23:14,226 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:14,630 INFO L129 PetriNetUnfolder]: 176/930 cut-off events. [2020-10-11 18:23:14,631 INFO L130 PetriNetUnfolder]: For 7353/7729 co-relation queries the response was YES. [2020-10-11 18:23:14,637 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 930 events. 176/930 cut-off events. For 7353/7729 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7245 event pairs, 15 based on Foata normal form. 79/976 useless extension candidates. Maximal degree in co-relation 3587. Up to 213 conditions per place. [2020-10-11 18:23:14,642 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 36 selfloop transitions, 14 changer transitions 10/144 dead transitions. [2020-10-11 18:23:14,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 144 transitions, 1088 flow [2020-10-11 18:23:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:23:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:23:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1246 transitions. [2020-10-11 18:23:14,645 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8634788634788635 [2020-10-11 18:23:14,645 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1246 transitions. [2020-10-11 18:23:14,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1246 transitions. [2020-10-11 18:23:14,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:14,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1246 transitions. [2020-10-11 18:23:14,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:23:14,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:23:14,650 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:23:14,650 INFO L185 Difference]: Start difference. First operand has 158 places, 127 transitions, 737 flow. Second operand 13 states and 1246 transitions. [2020-10-11 18:23:14,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 144 transitions, 1088 flow [2020-10-11 18:23:14,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 144 transitions, 959 flow, removed 56 selfloop flow, removed 10 redundant places. [2020-10-11 18:23:14,670 INFO L241 Difference]: Finished difference. Result has 161 places, 127 transitions, 713 flow [2020-10-11 18:23:14,671 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=713, PETRI_PLACES=161, PETRI_TRANSITIONS=127} [2020-10-11 18:23:14,671 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2020-10-11 18:23:14,671 INFO L481 AbstractCegarLoop]: Abstraction has has 161 places, 127 transitions, 713 flow [2020-10-11 18:23:14,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:23:14,672 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:14,672 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:14,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:23:14,672 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-11 18:23:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 316233011, now seen corresponding path program 1 times [2020-10-11 18:23:14,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:14,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447485231] [2020-10-11 18:23:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:14,805 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-11 18:23:14,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447485231] [2020-10-11 18:23:14,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:14,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:23:14,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279613794] [2020-10-11 18:23:14,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:23:14,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:14,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:23:14,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:23:14,960 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:14,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 127 transitions, 713 flow. Second operand 6 states. [2020-10-11 18:23:14,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:14,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:14,961 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:15,730 INFO L129 PetriNetUnfolder]: 2336/5276 cut-off events. [2020-10-11 18:23:15,730 INFO L130 PetriNetUnfolder]: For 11780/12035 co-relation queries the response was YES. [2020-10-11 18:23:15,773 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13120 conditions, 5276 events. 2336/5276 cut-off events. For 11780/12035 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 50454 event pairs, 360 based on Foata normal form. 194/4741 useless extension candidates. Maximal degree in co-relation 13032. Up to 1744 conditions per place. [2020-10-11 18:23:15,804 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 23 selfloop transitions, 19 changer transitions 0/158 dead transitions. [2020-10-11 18:23:15,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 859 flow [2020-10-11 18:23:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:23:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:23:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions. [2020-10-11 18:23:15,812 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9179179179179179 [2020-10-11 18:23:15,812 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 917 transitions. [2020-10-11 18:23:15,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions. [2020-10-11 18:23:15,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:15,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions. [2020-10-11 18:23:15,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:23:15,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:23:15,816 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:23:15,816 INFO L185 Difference]: Start difference. First operand has 161 places, 127 transitions, 713 flow. Second operand 9 states and 917 transitions. [2020-10-11 18:23:15,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 158 transitions, 859 flow [2020-10-11 18:23:15,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 158 transitions, 805 flow, removed 21 selfloop flow, removed 10 redundant places. [2020-10-11 18:23:15,855 INFO L241 Difference]: Finished difference. Result has 158 places, 144 transitions, 793 flow [2020-10-11 18:23:15,855 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=158, PETRI_TRANSITIONS=144} [2020-10-11 18:23:15,855 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2020-10-11 18:23:15,855 INFO L481 AbstractCegarLoop]: Abstraction has has 158 places, 144 transitions, 793 flow [2020-10-11 18:23:15,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:23:15,856 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:15,856 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:15,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:23:15,856 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1329118769, now seen corresponding path program 1 times [2020-10-11 18:23:15,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:15,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198122170] [2020-10-11 18:23:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:15,966 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-11 18:23:15,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198122170] [2020-10-11 18:23:15,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:15,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:23:15,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499348495] [2020-10-11 18:23:15,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:23:15,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:15,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:23:15,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:23:16,145 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:16,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 144 transitions, 793 flow. Second operand 7 states. [2020-10-11 18:23:16,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:16,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:16,147 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:16,939 INFO L129 PetriNetUnfolder]: 2248/5116 cut-off events. [2020-10-11 18:23:16,939 INFO L130 PetriNetUnfolder]: For 17205/28418 co-relation queries the response was YES. [2020-10-11 18:23:16,985 INFO L80 FinitePrefix]: Finished finitePrefix Result has 19145 conditions, 5116 events. 2248/5116 cut-off events. For 17205/28418 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 48897 event pairs, 53 based on Foata normal form. 597/5047 useless extension candidates. Maximal degree in co-relation 19059. Up to 2394 conditions per place. [2020-10-11 18:23:17,019 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 25 selfloop transitions, 37 changer transitions 0/176 dead transitions. [2020-10-11 18:23:17,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 176 transitions, 1128 flow [2020-10-11 18:23:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:23:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:23:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1224 transitions. [2020-10-11 18:23:17,023 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2020-10-11 18:23:17,023 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1224 transitions. [2020-10-11 18:23:17,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1224 transitions. [2020-10-11 18:23:17,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:17,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1224 transitions. [2020-10-11 18:23:17,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:23:17,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:23:17,028 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:23:17,028 INFO L185 Difference]: Start difference. First operand has 158 places, 144 transitions, 793 flow. Second operand 12 states and 1224 transitions. [2020-10-11 18:23:17,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 176 transitions, 1128 flow [2020-10-11 18:23:17,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 176 transitions, 1124 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-11 18:23:17,264 INFO L241 Difference]: Finished difference. Result has 173 places, 161 transitions, 1051 flow [2020-10-11 18:23:17,265 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1051, PETRI_PLACES=173, PETRI_TRANSITIONS=161} [2020-10-11 18:23:17,265 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 55 predicate places. [2020-10-11 18:23:17,265 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 161 transitions, 1051 flow [2020-10-11 18:23:17,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:23:17,266 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:17,266 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:23:17,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:23:17,266 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1557486764, now seen corresponding path program 1 times [2020-10-11 18:23:17,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:17,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492273950] [2020-10-11 18:23:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:17,368 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-11 18:23:17,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492273950] [2020-10-11 18:23:17,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:17,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:23:17,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529263301] [2020-10-11 18:23:17,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:23:17,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:17,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:23:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:23:17,542 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:23:17,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 161 transitions, 1051 flow. Second operand 6 states. [2020-10-11 18:23:17,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:17,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:23:17,543 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:18,295 INFO L129 PetriNetUnfolder]: 1704/5546 cut-off events. [2020-10-11 18:23:18,295 INFO L130 PetriNetUnfolder]: For 27312/40486 co-relation queries the response was YES. [2020-10-11 18:23:18,356 INFO L80 FinitePrefix]: Finished finitePrefix Result has 22638 conditions, 5546 events. 1704/5546 cut-off events. For 27312/40486 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 62266 event pairs, 201 based on Foata normal form. 225/5104 useless extension candidates. Maximal degree in co-relation 22545. Up to 2115 conditions per place. [2020-10-11 18:23:18,380 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 14 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2020-10-11 18:23:18,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 175 transitions, 1195 flow [2020-10-11 18:23:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:23:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:23:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2020-10-11 18:23:18,383 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9269269269269269 [2020-10-11 18:23:18,383 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2020-10-11 18:23:18,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2020-10-11 18:23:18,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:18,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2020-10-11 18:23:18,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:23:18,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:23:18,387 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:23:18,387 INFO L185 Difference]: Start difference. First operand has 173 places, 161 transitions, 1051 flow. Second operand 9 states and 926 transitions. [2020-10-11 18:23:18,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 175 transitions, 1195 flow [2020-10-11 18:23:18,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 175 transitions, 1092 flow, removed 42 selfloop flow, removed 4 redundant places. [2020-10-11 18:23:18,585 INFO L241 Difference]: Finished difference. Result has 184 places, 169 transitions, 1071 flow [2020-10-11 18:23:18,586 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1071, PETRI_PLACES=184, PETRI_TRANSITIONS=169} [2020-10-11 18:23:18,586 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 66 predicate places. [2020-10-11 18:23:18,586 INFO L481 AbstractCegarLoop]: Abstraction has has 184 places, 169 transitions, 1071 flow [2020-10-11 18:23:18,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:23:18,587 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:18,587 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:23:18,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:23:18,587 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:18,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1548061796, now seen corresponding path program 1 times [2020-10-11 18:23:18,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:18,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114445417] [2020-10-11 18:23:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:18,712 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-11 18:23:18,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114445417] [2020-10-11 18:23:18,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:18,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:23:18,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233041587] [2020-10-11 18:23:18,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:23:18,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:23:18,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:23:18,945 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:18,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 169 transitions, 1071 flow. Second operand 8 states. [2020-10-11 18:23:18,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:18,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:18,946 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:19,408 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-10-11 18:23:20,204 INFO L129 PetriNetUnfolder]: 3237/6863 cut-off events. [2020-10-11 18:23:20,204 INFO L130 PetriNetUnfolder]: For 53742/76988 co-relation queries the response was YES. [2020-10-11 18:23:20,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 32853 conditions, 6863 events. 3237/6863 cut-off events. For 53742/76988 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 67588 event pairs, 6 based on Foata normal form. 1031/6901 useless extension candidates. Maximal degree in co-relation 32754. Up to 2900 conditions per place. [2020-10-11 18:23:20,300 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 19 selfloop transitions, 57 changer transitions 16/199 dead transitions. [2020-10-11 18:23:20,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 199 transitions, 1564 flow [2020-10-11 18:23:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:23:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:23:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1531 transitions. [2020-10-11 18:23:20,303 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9195195195195195 [2020-10-11 18:23:20,303 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1531 transitions. [2020-10-11 18:23:20,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1531 transitions. [2020-10-11 18:23:20,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:20,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1531 transitions. [2020-10-11 18:23:20,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:23:20,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:23:20,308 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:23:20,309 INFO L185 Difference]: Start difference. First operand has 184 places, 169 transitions, 1071 flow. Second operand 15 states and 1531 transitions. [2020-10-11 18:23:20,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 199 transitions, 1564 flow [2020-10-11 18:23:20,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 199 transitions, 1517 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:23:20,524 INFO L241 Difference]: Finished difference. Result has 197 places, 179 transitions, 1321 flow [2020-10-11 18:23:20,524 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1321, PETRI_PLACES=197, PETRI_TRANSITIONS=179} [2020-10-11 18:23:20,525 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 79 predicate places. [2020-10-11 18:23:20,525 INFO L481 AbstractCegarLoop]: Abstraction has has 197 places, 179 transitions, 1321 flow [2020-10-11 18:23:20,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:23:20,525 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:20,525 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:20,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:23:20,526 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1229820269, now seen corresponding path program 1 times [2020-10-11 18:23:20,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:20,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014490065] [2020-10-11 18:23:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:20,669 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-11 18:23:20,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014490065] [2020-10-11 18:23:20,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:20,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:23:20,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079102839] [2020-10-11 18:23:20,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:23:20,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:20,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:23:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:23:20,947 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:20,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 179 transitions, 1321 flow. Second operand 9 states. [2020-10-11 18:23:20,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:20,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:20,948 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:22,351 INFO L129 PetriNetUnfolder]: 2878/6346 cut-off events. [2020-10-11 18:23:22,351 INFO L130 PetriNetUnfolder]: For 62052/100541 co-relation queries the response was YES. [2020-10-11 18:23:22,419 INFO L80 FinitePrefix]: Finished finitePrefix Result has 34049 conditions, 6346 events. 2878/6346 cut-off events. For 62052/100541 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 64064 event pairs, 0 based on Foata normal form. 1112/6469 useless extension candidates. Maximal degree in co-relation 33995. Up to 2573 conditions per place. [2020-10-11 18:23:22,438 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 12 selfloop transitions, 63 changer transitions 21/197 dead transitions. [2020-10-11 18:23:22,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 197 transitions, 1690 flow [2020-10-11 18:23:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:23:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:23:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1822 transitions. [2020-10-11 18:23:22,440 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9119119119119119 [2020-10-11 18:23:22,440 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1822 transitions. [2020-10-11 18:23:22,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1822 transitions. [2020-10-11 18:23:22,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:22,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1822 transitions. [2020-10-11 18:23:22,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:23:22,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:23:22,446 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:23:22,446 INFO L185 Difference]: Start difference. First operand has 197 places, 179 transitions, 1321 flow. Second operand 18 states and 1822 transitions. [2020-10-11 18:23:22,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 197 transitions, 1690 flow [2020-10-11 18:23:23,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 197 transitions, 1219 flow, removed 182 selfloop flow, removed 30 redundant places. [2020-10-11 18:23:23,689 INFO L241 Difference]: Finished difference. Result has 184 places, 172 transitions, 1034 flow [2020-10-11 18:23:23,689 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1034, PETRI_PLACES=184, PETRI_TRANSITIONS=172} [2020-10-11 18:23:23,690 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 66 predicate places. [2020-10-11 18:23:23,690 INFO L481 AbstractCegarLoop]: Abstraction has has 184 places, 172 transitions, 1034 flow [2020-10-11 18:23:23,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:23:23,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:23,690 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:23,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:23:23,691 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash -853707397, now seen corresponding path program 1 times [2020-10-11 18:23:23,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:23,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146468206] [2020-10-11 18:23:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:23,840 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-11 18:23:23,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146468206] [2020-10-11 18:23:23,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:23,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:23:23,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072090628] [2020-10-11 18:23:23,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:23:23,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:23:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:23:24,095 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 111 [2020-10-11 18:23:24,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 172 transitions, 1034 flow. Second operand 7 states. [2020-10-11 18:23:24,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:24,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 111 [2020-10-11 18:23:24,096 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:25,927 INFO L129 PetriNetUnfolder]: 4024/10455 cut-off events. [2020-10-11 18:23:25,927 INFO L130 PetriNetUnfolder]: For 25553/29843 co-relation queries the response was YES. [2020-10-11 18:23:26,050 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33715 conditions, 10455 events. 4024/10455 cut-off events. For 25553/29843 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 127329 event pairs, 0 based on Foata normal form. 8/9183 useless extension candidates. Maximal degree in co-relation 33628. Up to 1320 conditions per place. [2020-10-11 18:23:26,058 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 1 changer transitions 22/177 dead transitions. [2020-10-11 18:23:26,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 177 transitions, 1080 flow [2020-10-11 18:23:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:23:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:23:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 709 transitions. [2020-10-11 18:23:26,059 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9124839124839125 [2020-10-11 18:23:26,059 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 709 transitions. [2020-10-11 18:23:26,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 709 transitions. [2020-10-11 18:23:26,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:26,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 709 transitions. [2020-10-11 18:23:26,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:23:26,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:23:26,061 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:23:26,061 INFO L185 Difference]: Start difference. First operand has 184 places, 172 transitions, 1034 flow. Second operand 7 states and 709 transitions. [2020-10-11 18:23:26,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 177 transitions, 1080 flow [2020-10-11 18:23:27,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 177 transitions, 951 flow, removed 8 selfloop flow, removed 17 redundant places. [2020-10-11 18:23:27,410 INFO L241 Difference]: Finished difference. Result has 176 places, 155 transitions, 797 flow [2020-10-11 18:23:27,410 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=797, PETRI_PLACES=176, PETRI_TRANSITIONS=155} [2020-10-11 18:23:27,411 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2020-10-11 18:23:27,411 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 155 transitions, 797 flow [2020-10-11 18:23:27,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:23:27,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:27,411 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:23:27,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:23:27,412 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2017643301, now seen corresponding path program 2 times [2020-10-11 18:23:27,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:27,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267392409] [2020-10-11 18:23:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:23:27,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:23:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:23:27,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:23:27,535 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:23:27,535 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:23:27,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:23:27,584 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-11 18:23:27,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,586 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-11 18:23:27,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,586 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-11 18:23:27,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,586 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-11 18:23:27,587 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,587 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-11 18:23:27,587 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,587 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-11 18:23:27,587 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,588 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-11 18:23:27,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,588 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-11 18:23:27,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,588 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-11 18:23:27,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,589 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-11 18:23:27,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,589 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-11 18:23:27,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,590 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-11 18:23:27,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,591 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-11 18:23:27,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,591 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-11 18:23:27,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,591 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-11 18:23:27,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,592 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-11 18:23:27,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,592 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-11 18:23:27,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,592 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-11 18:23:27,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,593 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-11 18:23:27,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,593 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-11 18:23:27,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,593 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-11 18:23:27,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,594 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-11 18:23:27,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,594 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-11 18:23:27,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,594 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-11 18:23:27,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,595 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-11 18:23:27,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,595 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-11 18:23:27,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,595 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-11 18:23:27,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,596 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-11 18:23:27,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:27,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:23:27 BasicIcfg [2020-10-11 18:23:27,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:23:27,729 INFO L168 Benchmark]: Toolchain (without parser) took 38455.98 ms. Allocated memory was 252.7 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 207.2 MB in the beginning and 524.6 MB in the end (delta: -317.4 MB). Peak memory consumption was 735.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:27,730 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:23:27,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.05 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 207.2 MB in the beginning and 266.0 MB in the end (delta: -58.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:27,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.64 ms. Allocated memory is still 317.7 MB. Free memory was 266.0 MB in the beginning and 263.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:27,739 INFO L168 Benchmark]: Boogie Preprocessor took 39.44 ms. Allocated memory is still 317.7 MB. Free memory was 263.5 MB in the beginning and 261.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:27,740 INFO L168 Benchmark]: RCFGBuilder took 2059.34 ms. Allocated memory was 317.7 MB in the beginning and 360.7 MB in the end (delta: 43.0 MB). Free memory was 261.0 MB in the beginning and 205.8 MB in the end (delta: 55.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:27,740 INFO L168 Benchmark]: TraceAbstraction took 35503.47 ms. Allocated memory was 360.7 MB in the beginning and 1.3 GB in the end (delta: 944.8 MB). Free memory was 202.5 MB in the beginning and 524.6 MB in the end (delta: -322.1 MB). Peak memory consumption was 622.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:27,749 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.23 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 768.05 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 207.2 MB in the beginning and 266.0 MB in the end (delta: -58.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 80.64 ms. Allocated memory is still 317.7 MB. Free memory was 266.0 MB in the beginning and 263.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.44 ms. Allocated memory is still 317.7 MB. Free memory was 263.5 MB in the beginning and 261.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2059.34 ms. Allocated memory was 317.7 MB in the beginning and 360.7 MB in the end (delta: 43.0 MB). Free memory was 261.0 MB in the beginning and 205.8 MB in the end (delta: 55.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 35503.47 ms. Allocated memory was 360.7 MB in the beginning and 1.3 GB in the end (delta: 944.8 MB). Free memory was 202.5 MB in the beginning and 524.6 MB in the end (delta: -322.1 MB). Peak memory consumption was 622.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L703] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L707] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L708] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L709] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L711] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L716] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L717] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L718] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L719] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L720] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L833] 0 pthread_t t1269; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L834] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L835] 0 pthread_t t1270; VAL [__unbuffered_cnt=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] [L836] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L837] 0 pthread_t t1271; VAL [__unbuffered_cnt=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] [L838] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L839] 0 pthread_t t1272; VAL [__unbuffered_cnt=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] [L840] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L789] 4 z$w_buff1 = z$w_buff0 [L790] 4 z$w_buff0 = 2 [L791] 4 z$w_buff1_used = z$w_buff0_used [L792] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L794] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L795] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L796] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L797] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L798] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L799] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 b = 1 VAL [__unbuffered_cnt=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 3 y = 2 VAL [__unbuffered_cnt=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=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z = 1 VAL [__unbuffered_cnt=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=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L775] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L778] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L779] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L811] 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) [L811] 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) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 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 [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __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=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __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=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 z$flush_delayed = weak$$choice2 [L856] 0 z$mem_tmp = z [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L862] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L865] 0 z = z$flush_delayed ? z$mem_tmp : z [L866] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 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: 35.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 661 SDtfs, 982 SDslu, 3292 SDs, 0 SdLazy, 2955 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1321occurred in iteration=16, 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.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1266 ConstructedInterpolants, 0 QuantifiedInterpolants, 525148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...