/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:40:54,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:40:54,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:40:54,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:40:54,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:40:54,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:40:54,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:40:54,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:40:54,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:40:54,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:40:54,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:40:54,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:40:54,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:40:54,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:40:54,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:40:54,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:40:54,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:40:54,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:40:54,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:40:54,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:40:54,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:40:54,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:40:54,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:40:54,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:40:54,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:40:54,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:40:54,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:40:54,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:40:54,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:40:54,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:40:54,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:40:54,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:40:54,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:40:54,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:40:54,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:40:54,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:40:54,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:40:54,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:40:54,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:40:54,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:40:54,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:40:54,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:40:54,920 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:40:54,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:40:54,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:40:54,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:40:54,922 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:40:54,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:40:54,922 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:40:54,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:40:54,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:40:54,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:40:54,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:40:54,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:40:54,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:40:54,923 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:40:54,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:40:54,924 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:40:54,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:40:54,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:40:54,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:40:54,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:40:54,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:40:54,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:40:54,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:40:54,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:40:54,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:40:54,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:40:54,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:40:54,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:40:54,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:40:55,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:40:55,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:40:55,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:40:55,218 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:40:55,219 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:40:55,220 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2020-10-16 01:40:55,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca1b052e/e6f0a12c26a34f77a39f9437ff2ea264/FLAG9de337b0f [2020-10-16 01:40:55,836 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:40:55,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2020-10-16 01:40:55,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca1b052e/e6f0a12c26a34f77a39f9437ff2ea264/FLAG9de337b0f [2020-10-16 01:40:56,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca1b052e/e6f0a12c26a34f77a39f9437ff2ea264 [2020-10-16 01:40:56,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:40:56,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:40:56,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:40:56,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:40:56,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:40:56,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120f1139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56, skipping insertion in model container [2020-10-16 01:40:56,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:40:56,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:40:56,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:40:56,762 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:40:56,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:40:56,896 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:40:56,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56 WrapperNode [2020-10-16 01:40:56,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:40:56,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:40:56,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:40:56,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:40:56,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:40:56,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:40:56,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:40:56,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:40:56,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:56,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:57,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:57,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... [2020-10-16 01:40:57,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:40:57,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:40:57,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:40:57,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:40:57,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:40:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:40:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:40:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:40:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:40:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:40:57,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:40:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:40:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:40:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:40:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:40:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:40:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:40:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:40:57,084 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:40:59,116 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:40:59,117 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:40:59,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:40:59 BoogieIcfgContainer [2020-10-16 01:40:59,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:40:59,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:40:59,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:40:59,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:40:59,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:40:56" (1/3) ... [2020-10-16 01:40:59,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aab0941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:40:59, skipping insertion in model container [2020-10-16 01:40:59,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:40:56" (2/3) ... [2020-10-16 01:40:59,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aab0941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:40:59, skipping insertion in model container [2020-10-16 01:40:59,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:40:59" (3/3) ... [2020-10-16 01:40:59,129 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2020-10-16 01:40:59,143 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:40:59,152 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:40:59,153 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:40:59,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,187 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,187 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,188 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,193 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,193 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,214 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,214 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:40:59,236 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:40:59,259 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:40:59,259 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:40:59,259 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:40:59,259 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:40:59,260 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:40:59,260 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:40:59,260 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:40:59,260 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:40:59,275 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 01:40:59,321 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 01:40:59,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:40:59,327 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:40:59,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 01:40:59,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:59,338 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:40:59,341 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:59,344 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:59,345 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 95 places, 87 transitions, 183 flow [2020-10-16 01:40:59,368 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 01:40:59,369 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:40:59,369 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:40:59,373 INFO L117 LiptonReduction]: Number of co-enabled transitions 1560 [2020-10-16 01:41:00,210 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:41:00,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:00,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:00,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:00,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:00,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:00,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:00,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:00,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:00,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:00,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:00,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:00,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:00,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:41:00,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:00,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:00,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:00,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:00,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:00,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:00,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:00,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:00,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:00,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:00,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:00,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:00,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:00,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:00,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:00,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:00,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:41:01,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:01,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,445 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:41:01,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:01,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:41:01,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:01,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:41:01,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 01:41:01,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:01,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:41:01,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:01,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:01,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:01,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:01,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:01,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:01,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:01,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:02,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:02,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:41:02,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:02,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:02,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:02,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:02,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:41:02,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:02,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:02,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:02,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:02,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:02,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:02,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:02,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:02,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:02,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:02,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:41:02,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:02,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:02,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:02,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:02,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:02,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:02,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:02,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:02,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:41:02,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:02,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:41:02,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:02,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:02,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:41:02,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:02,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:02,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:03,900 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2020-10-16 01:41:03,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:41:03,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:03,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:03,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:04,811 WARN L193 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-10-16 01:41:05,163 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:41:06,456 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 01:41:06,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:41:06,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:06,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:41:06,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:07,555 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-16 01:41:07,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:41:07,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:07,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:07,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:41:07,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:07,910 INFO L132 LiptonReduction]: Checked pairs total: 3946 [2020-10-16 01:41:07,910 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 01:41:07,913 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8578 [2020-10-16 01:41:07,919 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 01:41:07,919 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:07,919 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:07,920 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:41:07,921 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-16 01:41:07,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:07,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931538304] [2020-10-16 01:41:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:08,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931538304] [2020-10-16 01:41:08,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:08,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:08,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025600629] [2020-10-16 01:41:08,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:08,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:08,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:08,179 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:41:08,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states. [2020-10-16 01:41:08,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:08,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:41:08,183 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:08,308 INFO L129 PetriNetUnfolder]: 69/141 cut-off events. [2020-10-16 01:41:08,308 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:08,309 INFO L80 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 69/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 620 event pairs, 54 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 259. Up to 89 conditions per place. [2020-10-16 01:41:08,312 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 9 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2020-10-16 01:41:08,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 87 flow [2020-10-16 01:41:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2020-10-16 01:41:08,332 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8313492063492064 [2020-10-16 01:41:08,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2020-10-16 01:41:08,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2020-10-16 01:41:08,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:08,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2020-10-16 01:41:08,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:08,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:08,352 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:08,354 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 419 transitions. [2020-10-16 01:41:08,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 87 flow [2020-10-16 01:41:08,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:08,360 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2020-10-16 01:41:08,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2020-10-16 01:41:08,365 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2020-10-16 01:41:08,365 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2020-10-16 01:41:08,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:08,365 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:08,365 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:08,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:41:08,366 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:08,366 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-16 01:41:08,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:08,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134215146] [2020-10-16 01:41:08,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:08,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134215146] [2020-10-16 01:41:08,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:08,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:08,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607946195] [2020-10-16 01:41:08,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:08,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:08,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:08,500 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 168 [2020-10-16 01:41:08,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states. [2020-10-16 01:41:08,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:08,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 168 [2020-10-16 01:41:08,501 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:08,572 INFO L129 PetriNetUnfolder]: 77/162 cut-off events. [2020-10-16 01:41:08,572 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-16 01:41:08,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 162 events. 77/162 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 667 event pairs, 59 based on Foata normal form. 2/158 useless extension candidates. Maximal degree in co-relation 308. Up to 125 conditions per place. [2020-10-16 01:41:08,575 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2020-10-16 01:41:08,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 84 flow [2020-10-16 01:41:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2020-10-16 01:41:08,579 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7876984126984127 [2020-10-16 01:41:08,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2020-10-16 01:41:08,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2020-10-16 01:41:08,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:08,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2020-10-16 01:41:08,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:08,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:08,582 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:08,583 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 397 transitions. [2020-10-16 01:41:08,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 84 flow [2020-10-16 01:41:08,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 24 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:08,584 INFO L241 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2020-10-16 01:41:08,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2020-10-16 01:41:08,585 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2020-10-16 01:41:08,585 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2020-10-16 01:41:08,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:08,585 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:08,586 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:08,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:41:08,586 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1396887955, now seen corresponding path program 1 times [2020-10-16 01:41:08,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:08,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805548230] [2020-10-16 01:41:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:08,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805548230] [2020-10-16 01:41:08,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:08,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:08,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247897164] [2020-10-16 01:41:08,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:08,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:08,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:08,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:08,691 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 168 [2020-10-16 01:41:08,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states. [2020-10-16 01:41:08,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:08,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 168 [2020-10-16 01:41:08,692 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:08,715 INFO L129 PetriNetUnfolder]: 17/69 cut-off events. [2020-10-16 01:41:08,715 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-16 01:41:08,716 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 69 events. 17/69 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 241 event pairs, 5 based on Foata normal form. 3/66 useless extension candidates. Maximal degree in co-relation 120. Up to 29 conditions per place. [2020-10-16 01:41:08,716 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 5 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2020-10-16 01:41:08,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 87 flow [2020-10-16 01:41:08,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2020-10-16 01:41:08,719 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2020-10-16 01:41:08,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2020-10-16 01:41:08,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2020-10-16 01:41:08,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:08,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2020-10-16 01:41:08,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:08,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:08,722 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:08,722 INFO L185 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 435 transitions. [2020-10-16 01:41:08,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 87 flow [2020-10-16 01:41:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:08,724 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 81 flow [2020-10-16 01:41:08,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2020-10-16 01:41:08,724 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2020-10-16 01:41:08,724 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 81 flow [2020-10-16 01:41:08,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:08,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:08,725 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:08,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:41:08,725 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1907850104, now seen corresponding path program 1 times [2020-10-16 01:41:08,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:08,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929845408] [2020-10-16 01:41:08,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:08,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929845408] [2020-10-16 01:41:08,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:08,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:08,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803812701] [2020-10-16 01:41:08,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:08,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:08,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:08,823 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 168 [2020-10-16 01:41:08,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 81 flow. Second operand 5 states. [2020-10-16 01:41:08,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:08,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 168 [2020-10-16 01:41:08,824 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:08,996 INFO L129 PetriNetUnfolder]: 228/452 cut-off events. [2020-10-16 01:41:08,996 INFO L130 PetriNetUnfolder]: For 191/199 co-relation queries the response was YES. [2020-10-16 01:41:08,999 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 452 events. 228/452 cut-off events. For 191/199 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2459 event pairs, 108 based on Foata normal form. 28/464 useless extension candidates. Maximal degree in co-relation 997. Up to 228 conditions per place. [2020-10-16 01:41:09,001 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 14 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2020-10-16 01:41:09,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 127 flow [2020-10-16 01:41:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2020-10-16 01:41:09,005 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7633928571428571 [2020-10-16 01:41:09,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2020-10-16 01:41:09,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2020-10-16 01:41:09,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:09,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2020-10-16 01:41:09,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:09,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:09,008 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:09,008 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 81 flow. Second operand 4 states and 513 transitions. [2020-10-16 01:41:09,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 127 flow [2020-10-16 01:41:09,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:09,011 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 91 flow [2020-10-16 01:41:09,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2020-10-16 01:41:09,011 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2020-10-16 01:41:09,011 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 91 flow [2020-10-16 01:41:09,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:09,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:09,012 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:09,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:41:09,012 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1907851778, now seen corresponding path program 1 times [2020-10-16 01:41:09,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:09,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198740333] [2020-10-16 01:41:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:09,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198740333] [2020-10-16 01:41:09,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:09,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:09,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175466512] [2020-10-16 01:41:09,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:09,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:09,099 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 168 [2020-10-16 01:41:09,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 91 flow. Second operand 3 states. [2020-10-16 01:41:09,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:09,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 168 [2020-10-16 01:41:09,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:09,114 INFO L129 PetriNetUnfolder]: 4/44 cut-off events. [2020-10-16 01:41:09,114 INFO L130 PetriNetUnfolder]: For 78/96 co-relation queries the response was YES. [2020-10-16 01:41:09,115 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 44 events. 4/44 cut-off events. For 78/96 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 2 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 84. Up to 13 conditions per place. [2020-10-16 01:41:09,115 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 01:41:09,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 24 transitions, 97 flow [2020-10-16 01:41:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2020-10-16 01:41:09,118 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2020-10-16 01:41:09,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2020-10-16 01:41:09,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2020-10-16 01:41:09,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:09,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2020-10-16 01:41:09,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:09,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:09,121 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:09,121 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 91 flow. Second operand 3 states and 436 transitions. [2020-10-16 01:41:09,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 24 transitions, 97 flow [2020-10-16 01:41:09,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 24 transitions, 90 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:09,123 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 92 flow [2020-10-16 01:41:09,124 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2020-10-16 01:41:09,124 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2020-10-16 01:41:09,124 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 92 flow [2020-10-16 01:41:09,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:09,124 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:09,124 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:09,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:41:09,125 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2027631784, now seen corresponding path program 1 times [2020-10-16 01:41:09,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:09,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813761706] [2020-10-16 01:41:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:09,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813761706] [2020-10-16 01:41:09,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:09,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:41:09,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332397983] [2020-10-16 01:41:09,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:41:09,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:41:09,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:41:09,174 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 168 [2020-10-16 01:41:09,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 92 flow. Second operand 4 states. [2020-10-16 01:41:09,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:09,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 168 [2020-10-16 01:41:09,175 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:09,210 INFO L129 PetriNetUnfolder]: 7/78 cut-off events. [2020-10-16 01:41:09,211 INFO L130 PetriNetUnfolder]: For 125/167 co-relation queries the response was YES. [2020-10-16 01:41:09,211 INFO L80 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 78 events. 7/78 cut-off events. For 125/167 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 353 event pairs, 2 based on Foata normal form. 7/84 useless extension candidates. Maximal degree in co-relation 161. Up to 19 conditions per place. [2020-10-16 01:41:09,212 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 4 selfloop transitions, 4 changer transitions 2/27 dead transitions. [2020-10-16 01:41:09,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 127 flow [2020-10-16 01:41:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2020-10-16 01:41:09,215 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8377976190476191 [2020-10-16 01:41:09,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2020-10-16 01:41:09,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2020-10-16 01:41:09,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:09,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2020-10-16 01:41:09,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:09,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:09,218 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:09,218 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 92 flow. Second operand 4 states and 563 transitions. [2020-10-16 01:41:09,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 127 flow [2020-10-16 01:41:09,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:09,220 INFO L241 Difference]: Finished difference. Result has 38 places, 24 transitions, 101 flow [2020-10-16 01:41:09,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2020-10-16 01:41:09,221 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2020-10-16 01:41:09,221 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 101 flow [2020-10-16 01:41:09,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:41:09,221 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:09,221 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:09,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:41:09,222 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1796339802, now seen corresponding path program 2 times [2020-10-16 01:41:09,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:09,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603476623] [2020-10-16 01:41:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:09,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603476623] [2020-10-16 01:41:09,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:09,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:09,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445183279] [2020-10-16 01:41:09,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:09,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:09,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:09,307 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 01:41:09,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 101 flow. Second operand 5 states. [2020-10-16 01:41:09,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:09,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 01:41:09,308 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:09,438 INFO L129 PetriNetUnfolder]: 116/254 cut-off events. [2020-10-16 01:41:09,438 INFO L130 PetriNetUnfolder]: For 332/360 co-relation queries the response was YES. [2020-10-16 01:41:09,439 INFO L80 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 254 events. 116/254 cut-off events. For 332/360 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1138 event pairs, 40 based on Foata normal form. 5/247 useless extension candidates. Maximal degree in co-relation 625. Up to 191 conditions per place. [2020-10-16 01:41:09,440 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2020-10-16 01:41:09,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 147 flow [2020-10-16 01:41:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2020-10-16 01:41:09,443 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7455357142857143 [2020-10-16 01:41:09,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2020-10-16 01:41:09,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2020-10-16 01:41:09,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:09,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2020-10-16 01:41:09,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:09,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:09,447 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:09,447 INFO L185 Difference]: Start difference. First operand has 38 places, 24 transitions, 101 flow. Second operand 4 states and 501 transitions. [2020-10-16 01:41:09,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 147 flow [2020-10-16 01:41:09,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 137 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:09,450 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 123 flow [2020-10-16 01:41:09,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2020-10-16 01:41:09,451 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2020-10-16 01:41:09,451 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 123 flow [2020-10-16 01:41:09,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:09,451 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:09,451 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:09,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:41:09,451 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1798362118, now seen corresponding path program 1 times [2020-10-16 01:41:09,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:09,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922595428] [2020-10-16 01:41:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:09,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922595428] [2020-10-16 01:41:09,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:09,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:09,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918191359] [2020-10-16 01:41:09,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:09,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:09,527 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 168 [2020-10-16 01:41:09,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 123 flow. Second operand 5 states. [2020-10-16 01:41:09,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:09,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 168 [2020-10-16 01:41:09,528 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:09,639 INFO L129 PetriNetUnfolder]: 113/256 cut-off events. [2020-10-16 01:41:09,639 INFO L130 PetriNetUnfolder]: For 371/430 co-relation queries the response was YES. [2020-10-16 01:41:09,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 256 events. 113/256 cut-off events. For 371/430 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1219 event pairs, 48 based on Foata normal form. 11/255 useless extension candidates. Maximal degree in co-relation 721. Up to 172 conditions per place. [2020-10-16 01:41:09,642 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 12 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2020-10-16 01:41:09,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 183 flow [2020-10-16 01:41:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2020-10-16 01:41:09,645 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7886904761904762 [2020-10-16 01:41:09,645 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2020-10-16 01:41:09,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2020-10-16 01:41:09,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:09,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2020-10-16 01:41:09,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:09,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:09,649 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:09,649 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 123 flow. Second operand 4 states and 530 transitions. [2020-10-16 01:41:09,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 183 flow [2020-10-16 01:41:09,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:09,652 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 163 flow [2020-10-16 01:41:09,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2020-10-16 01:41:09,652 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2020-10-16 01:41:09,653 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 163 flow [2020-10-16 01:41:09,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:09,653 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:09,653 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:09,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:41:09,653 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1890810296, now seen corresponding path program 1 times [2020-10-16 01:41:09,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:09,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090824173] [2020-10-16 01:41:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:09,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090824173] [2020-10-16 01:41:09,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:09,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:09,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738271321] [2020-10-16 01:41:09,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:09,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:09,787 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 01:41:09,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 163 flow. Second operand 6 states. [2020-10-16 01:41:09,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:09,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 01:41:09,788 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:09,957 INFO L129 PetriNetUnfolder]: 109/242 cut-off events. [2020-10-16 01:41:09,957 INFO L130 PetriNetUnfolder]: For 463/526 co-relation queries the response was YES. [2020-10-16 01:41:09,958 INFO L80 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 242 events. 109/242 cut-off events. For 463/526 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1100 event pairs, 33 based on Foata normal form. 12/245 useless extension candidates. Maximal degree in co-relation 826. Up to 174 conditions per place. [2020-10-16 01:41:09,960 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 15 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2020-10-16 01:41:09,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 231 flow [2020-10-16 01:41:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2020-10-16 01:41:09,963 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7098214285714286 [2020-10-16 01:41:09,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2020-10-16 01:41:09,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2020-10-16 01:41:09,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:09,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2020-10-16 01:41:09,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:09,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:09,967 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:09,967 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 163 flow. Second operand 4 states and 477 transitions. [2020-10-16 01:41:09,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 231 flow [2020-10-16 01:41:09,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 223 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:09,970 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 190 flow [2020-10-16 01:41:09,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2020-10-16 01:41:09,971 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2020-10-16 01:41:09,971 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 190 flow [2020-10-16 01:41:09,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:09,971 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:09,971 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:09,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:41:09,972 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1458751252, now seen corresponding path program 1 times [2020-10-16 01:41:09,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:09,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792369133] [2020-10-16 01:41:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:10,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792369133] [2020-10-16 01:41:10,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:10,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:10,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624832928] [2020-10-16 01:41:10,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:10,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:10,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:10,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:10,067 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 01:41:10,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 190 flow. Second operand 5 states. [2020-10-16 01:41:10,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:10,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 01:41:10,067 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:10,237 INFO L129 PetriNetUnfolder]: 121/286 cut-off events. [2020-10-16 01:41:10,237 INFO L130 PetriNetUnfolder]: For 765/868 co-relation queries the response was YES. [2020-10-16 01:41:10,239 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 286 events. 121/286 cut-off events. For 765/868 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1479 event pairs, 28 based on Foata normal form. 14/290 useless extension candidates. Maximal degree in co-relation 1001. Up to 150 conditions per place. [2020-10-16 01:41:10,241 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 17 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2020-10-16 01:41:10,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 290 flow [2020-10-16 01:41:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:41:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:41:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2020-10-16 01:41:10,246 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2020-10-16 01:41:10,246 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2020-10-16 01:41:10,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2020-10-16 01:41:10,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:10,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2020-10-16 01:41:10,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:41:10,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:41:10,251 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:41:10,251 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 190 flow. Second operand 6 states and 752 transitions. [2020-10-16 01:41:10,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 290 flow [2020-10-16 01:41:10,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 279 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:10,255 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 233 flow [2020-10-16 01:41:10,255 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2020-10-16 01:41:10,255 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2020-10-16 01:41:10,256 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 233 flow [2020-10-16 01:41:10,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:10,256 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:10,256 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:10,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:41:10,256 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1508656409, now seen corresponding path program 1 times [2020-10-16 01:41:10,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:10,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537125379] [2020-10-16 01:41:10,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:10,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537125379] [2020-10-16 01:41:10,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:10,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:10,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378610156] [2020-10-16 01:41:10,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:41:10,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:10,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:41:10,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:41:10,330 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 01:41:10,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 233 flow. Second operand 4 states. [2020-10-16 01:41:10,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:10,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 01:41:10,331 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:10,477 INFO L129 PetriNetUnfolder]: 197/472 cut-off events. [2020-10-16 01:41:10,478 INFO L130 PetriNetUnfolder]: For 1192/1362 co-relation queries the response was YES. [2020-10-16 01:41:10,481 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 472 events. 197/472 cut-off events. For 1192/1362 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2916 event pairs, 72 based on Foata normal form. 98/543 useless extension candidates. Maximal degree in co-relation 1491. Up to 224 conditions per place. [2020-10-16 01:41:10,483 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 9 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2020-10-16 01:41:10,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 287 flow [2020-10-16 01:41:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:41:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:41:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2020-10-16 01:41:10,487 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8071428571428572 [2020-10-16 01:41:10,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2020-10-16 01:41:10,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2020-10-16 01:41:10,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:10,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2020-10-16 01:41:10,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:41:10,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:41:10,491 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:41:10,491 INFO L185 Difference]: Start difference. First operand has 49 places, 36 transitions, 233 flow. Second operand 5 states and 678 transitions. [2020-10-16 01:41:10,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 287 flow [2020-10-16 01:41:10,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 275 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:10,496 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 285 flow [2020-10-16 01:41:10,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2020-10-16 01:41:10,497 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2020-10-16 01:41:10,497 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 285 flow [2020-10-16 01:41:10,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:41:10,497 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:10,497 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:10,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:41:10,497 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:10,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2103129864, now seen corresponding path program 1 times [2020-10-16 01:41:10,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:10,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046214964] [2020-10-16 01:41:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:10,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046214964] [2020-10-16 01:41:10,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:10,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:10,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629516246] [2020-10-16 01:41:10,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:10,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:10,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:10,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:10,561 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 01:41:10,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 285 flow. Second operand 6 states. [2020-10-16 01:41:10,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:10,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 01:41:10,562 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:10,884 INFO L129 PetriNetUnfolder]: 468/998 cut-off events. [2020-10-16 01:41:10,884 INFO L130 PetriNetUnfolder]: For 3371/3761 co-relation queries the response was YES. [2020-10-16 01:41:10,891 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 998 events. 468/998 cut-off events. For 3371/3761 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 7081 event pairs, 116 based on Foata normal form. 111/1035 useless extension candidates. Maximal degree in co-relation 3932. Up to 459 conditions per place. [2020-10-16 01:41:10,896 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 28 selfloop transitions, 7 changer transitions 25/80 dead transitions. [2020-10-16 01:41:10,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 639 flow [2020-10-16 01:41:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:41:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:41:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2020-10-16 01:41:10,900 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7465986394557823 [2020-10-16 01:41:10,900 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2020-10-16 01:41:10,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2020-10-16 01:41:10,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:10,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2020-10-16 01:41:10,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:41:10,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:41:10,906 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:41:10,906 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 285 flow. Second operand 7 states and 878 transitions. [2020-10-16 01:41:10,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 639 flow [2020-10-16 01:41:10,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:10,914 INFO L241 Difference]: Finished difference. Result has 61 places, 43 transitions, 302 flow [2020-10-16 01:41:10,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2020-10-16 01:41:10,915 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2020-10-16 01:41:10,915 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 302 flow [2020-10-16 01:41:10,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:10,915 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:10,915 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:10,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:41:10,916 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1584963038, now seen corresponding path program 2 times [2020-10-16 01:41:10,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:10,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216657132] [2020-10-16 01:41:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:10,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216657132] [2020-10-16 01:41:10,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:10,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:10,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951659039] [2020-10-16 01:41:10,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:10,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:10,998 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 01:41:10,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 302 flow. Second operand 5 states. [2020-10-16 01:41:10,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:10,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 01:41:10,999 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:11,120 INFO L129 PetriNetUnfolder]: 110/340 cut-off events. [2020-10-16 01:41:11,120 INFO L130 PetriNetUnfolder]: For 1179/1715 co-relation queries the response was YES. [2020-10-16 01:41:11,123 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 340 events. 110/340 cut-off events. For 1179/1715 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2254 event pairs, 15 based on Foata normal form. 236/557 useless extension candidates. Maximal degree in co-relation 1330. Up to 185 conditions per place. [2020-10-16 01:41:11,124 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 15 changer transitions 3/52 dead transitions. [2020-10-16 01:41:11,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 396 flow [2020-10-16 01:41:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:41:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:41:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2020-10-16 01:41:11,128 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8069727891156463 [2020-10-16 01:41:11,128 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2020-10-16 01:41:11,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2020-10-16 01:41:11,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:11,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2020-10-16 01:41:11,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:41:11,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:41:11,134 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:41:11,134 INFO L185 Difference]: Start difference. First operand has 61 places, 43 transitions, 302 flow. Second operand 7 states and 949 transitions. [2020-10-16 01:41:11,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 396 flow [2020-10-16 01:41:11,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 52 transitions, 380 flow, removed 1 selfloop flow, removed 5 redundant places. [2020-10-16 01:41:11,139 INFO L241 Difference]: Finished difference. Result has 63 places, 49 transitions, 375 flow [2020-10-16 01:41:11,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=375, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2020-10-16 01:41:11,139 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2020-10-16 01:41:11,139 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 375 flow [2020-10-16 01:41:11,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:11,140 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:11,140 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:11,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:41:11,140 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:11,140 INFO L82 PathProgramCache]: Analyzing trace with hash 110269985, now seen corresponding path program 1 times [2020-10-16 01:41:11,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:11,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550446933] [2020-10-16 01:41:11,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:11,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550446933] [2020-10-16 01:41:11,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:11,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:41:11,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722791378] [2020-10-16 01:41:11,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:11,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:11,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:11,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:11,214 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 01:41:11,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 375 flow. Second operand 6 states. [2020-10-16 01:41:11,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:11,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 01:41:11,215 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:11,355 INFO L129 PetriNetUnfolder]: 84/285 cut-off events. [2020-10-16 01:41:11,356 INFO L130 PetriNetUnfolder]: For 1533/2187 co-relation queries the response was YES. [2020-10-16 01:41:11,358 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 285 events. 84/285 cut-off events. For 1533/2187 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 1909 event pairs, 5 based on Foata normal form. 219/487 useless extension candidates. Maximal degree in co-relation 1336. Up to 166 conditions per place. [2020-10-16 01:41:11,359 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 10/53 dead transitions. [2020-10-16 01:41:11,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 53 transitions, 453 flow [2020-10-16 01:41:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:41:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:41:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1214 transitions. [2020-10-16 01:41:11,364 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8029100529100529 [2020-10-16 01:41:11,364 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1214 transitions. [2020-10-16 01:41:11,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1214 transitions. [2020-10-16 01:41:11,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:11,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1214 transitions. [2020-10-16 01:41:11,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:41:11,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:41:11,371 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:41:11,371 INFO L185 Difference]: Start difference. First operand has 63 places, 49 transitions, 375 flow. Second operand 9 states and 1214 transitions. [2020-10-16 01:41:11,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 53 transitions, 453 flow [2020-10-16 01:41:11,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 53 transitions, 390 flow, removed 23 selfloop flow, removed 4 redundant places. [2020-10-16 01:41:11,378 INFO L241 Difference]: Finished difference. Result has 70 places, 43 transitions, 330 flow [2020-10-16 01:41:11,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=330, PETRI_PLACES=70, PETRI_TRANSITIONS=43} [2020-10-16 01:41:11,379 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2020-10-16 01:41:11,379 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 43 transitions, 330 flow [2020-10-16 01:41:11,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:11,379 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:11,379 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] [2020-10-16 01:41:11,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:41:11,380 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1069842120, now seen corresponding path program 1 times [2020-10-16 01:41:11,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:11,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078688291] [2020-10-16 01:41:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:41:11,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078688291] [2020-10-16 01:41:11,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:11,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:41:11,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144347897] [2020-10-16 01:41:11,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:41:11,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:11,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:41:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:41:11,583 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168 [2020-10-16 01:41:11,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 43 transitions, 330 flow. Second operand 8 states. [2020-10-16 01:41:11,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:11,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168 [2020-10-16 01:41:11,584 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:11,757 INFO L129 PetriNetUnfolder]: 44/158 cut-off events. [2020-10-16 01:41:11,757 INFO L130 PetriNetUnfolder]: For 1091/1236 co-relation queries the response was YES. [2020-10-16 01:41:11,758 INFO L80 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 158 events. 44/158 cut-off events. For 1091/1236 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 862 event pairs, 0 based on Foata normal form. 18/166 useless extension candidates. Maximal degree in co-relation 672. Up to 50 conditions per place. [2020-10-16 01:41:11,759 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 7 selfloop transitions, 8 changer transitions 4/46 dead transitions. [2020-10-16 01:41:11,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 46 transitions, 398 flow [2020-10-16 01:41:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:41:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:41:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2020-10-16 01:41:11,763 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7242063492063492 [2020-10-16 01:41:11,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 730 transitions. [2020-10-16 01:41:11,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 730 transitions. [2020-10-16 01:41:11,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:11,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 730 transitions. [2020-10-16 01:41:11,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:41:11,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:41:11,768 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:41:11,769 INFO L185 Difference]: Start difference. First operand has 70 places, 43 transitions, 330 flow. Second operand 6 states and 730 transitions. [2020-10-16 01:41:11,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 46 transitions, 398 flow [2020-10-16 01:41:11,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 311 flow, removed 17 selfloop flow, removed 15 redundant places. [2020-10-16 01:41:11,776 INFO L241 Difference]: Finished difference. Result has 58 places, 40 transitions, 248 flow [2020-10-16 01:41:11,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2020-10-16 01:41:11,777 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2020-10-16 01:41:11,777 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 248 flow [2020-10-16 01:41:11,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:41:11,777 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:11,777 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] [2020-10-16 01:41:11,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:41:11,778 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 575487798, now seen corresponding path program 2 times [2020-10-16 01:41:11,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:11,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273109583] [2020-10-16 01:41:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:41:11,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:41:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:41:11,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:41:11,913 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:41:11,916 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:41:11,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:41:11,918 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:41:11,938 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse9 (= (mod ~y$r_buff1_thd0~0_In692503975 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In692503975 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In692503975 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In692503975 256) 0))) (let ((.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse2 (or .cse6 .cse7))) (and (= ~y$r_buff1_thd0~0_In692503975 ~y$r_buff1_thd0~0_Out692503975) (or (and .cse0 (= ~y$w_buff0_used~0_Out692503975 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_Out692503975 ~y$w_buff0_used~0_In692503975))) (or (and .cse3 (= ~y$w_buff1_used~0_Out692503975 0) .cse4) (and (= ~y$w_buff1_used~0_Out692503975 ~y$w_buff1_used~0_In692503975) .cse5)) (= ~y$r_buff0_thd0~0_In692503975 ~y$r_buff0_thd0~0_Out692503975) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out692503975 0)) (or (and .cse0 .cse1 (= ~y$w_buff0~0_In692503975 ~y~0_Out692503975)) (and (or (and .cse5 (= ~y~0_Out692503975 ~y~0_In692503975)) (and .cse3 (= ~y~0_Out692503975 ~y$w_buff1~0_In692503975) .cse4)) .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out692503975 |ULTIMATE.start_assume_abort_if_not_#in~cond_In692503975|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In692503975|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In692503975, ~y$w_buff1~0=~y$w_buff1~0_In692503975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In692503975, ~y$w_buff0~0=~y$w_buff0~0_In692503975, ~y~0=~y~0_In692503975, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In692503975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In692503975} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out692503975|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out692503975, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out692503975|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out692503975|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out692503975|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out692503975|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out692503975|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In692503975|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out692503975, ~y$w_buff1~0=~y$w_buff1~0_In692503975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out692503975, ~y$w_buff0~0=~y$w_buff0~0_In692503975, ~y~0=~y~0_Out692503975, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out692503975, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out692503975} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 01:41:11,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:11,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:11,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:12,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:41:12 BasicIcfg [2020-10-16 01:41:12,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:41:12,066 INFO L168 Benchmark]: Toolchain (without parser) took 15938.34 ms. Allocated memory was 249.6 MB in the beginning and 578.8 MB in the end (delta: 329.3 MB). Free memory was 204.9 MB in the beginning and 167.2 MB in the end (delta: 37.7 MB). Peak memory consumption was 367.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:12,066 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:41:12,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.08 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.9 MB in the beginning and 260.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:12,069 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.92 ms. Allocated memory is still 308.8 MB. Free memory was 260.9 MB in the beginning and 258.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:12,072 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 ms. Allocated memory is still 308.8 MB. Free memory was 258.4 MB in the beginning and 255.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:12,073 INFO L168 Benchmark]: RCFGBuilder took 2108.84 ms. Allocated memory was 308.8 MB in the beginning and 356.0 MB in the end (delta: 47.2 MB). Free memory was 255.9 MB in the beginning and 189.7 MB in the end (delta: 66.2 MB). Peak memory consumption was 113.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:12,077 INFO L168 Benchmark]: TraceAbstraction took 12941.86 ms. Allocated memory was 356.0 MB in the beginning and 578.8 MB in the end (delta: 222.8 MB). Free memory was 189.7 MB in the beginning and 167.2 MB in the end (delta: 22.6 MB). Peak memory consumption was 245.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:12,086 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.45 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 770.08 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.9 MB in the beginning and 260.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.92 ms. Allocated memory is still 308.8 MB. Free memory was 260.9 MB in the beginning and 258.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.37 ms. Allocated memory is still 308.8 MB. Free memory was 258.4 MB in the beginning and 255.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2108.84 ms. Allocated memory was 308.8 MB in the beginning and 356.0 MB in the end (delta: 47.2 MB). Free memory was 255.9 MB in the beginning and 189.7 MB in the end (delta: 66.2 MB). Peak memory consumption was 113.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12941.86 ms. Allocated memory was 356.0 MB in the beginning and 578.8 MB in the end (delta: 222.8 MB). Free memory was 189.7 MB in the beginning and 167.2 MB in the end (delta: 22.6 MB). Peak memory consumption was 245.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 896 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 95 PlacesBefore, 32 PlacesAfterwards, 87 TransitionsBefore, 22 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 3946 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2183; [L803] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2184; [L805] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 pthread_t t2185; [L807] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 67 SDtfs, 52 SDslu, 23 SDs, 0 SdLazy, 349 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 17367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...