/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/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:32:30,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:32:30,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:32:30,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:32:30,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:32:30,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:32:30,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:32:30,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:32:30,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:32:30,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:32:30,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:32:30,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:32:30,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:32:30,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:32:30,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:32:30,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:32:30,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:32:30,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:32:30,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:32:30,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:32:30,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:32:30,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:32:30,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:32:30,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:32:30,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:32:30,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:32:30,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:32:30,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:32:30,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:32:30,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:32:30,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:32:30,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:32:30,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:32:30,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:32:30,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:32:30,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:32:30,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:32:30,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:32:30,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:32:30,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:32:30,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:32:30,886 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:32:30,927 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:32:30,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:32:30,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:32:30,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:32:30,929 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:32:30,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:32:30,929 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:32:30,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:32:30,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:32:30,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:32:30,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:32:30,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:32:30,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:32:30,931 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:32:30,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:32:30,931 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:32:30,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:32:30,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:32:30,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:32:30,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:32:30,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:32:30,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:32:30,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:32:30,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:32:30,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:32:30,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:32:30,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:32:30,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:32:30,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:32:31,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:32:31,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:32:31,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:32:31,300 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:32:31,301 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:32:31,302 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-16 01:32:31,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524eedfb6/9b314d61cb5140f0ba829aac1274c1f1/FLAG7e1f7c3af [2020-10-16 01:32:31,919 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:32:31,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-16 01:32:31,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524eedfb6/9b314d61cb5140f0ba829aac1274c1f1/FLAG7e1f7c3af [2020-10-16 01:32:32,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524eedfb6/9b314d61cb5140f0ba829aac1274c1f1 [2020-10-16 01:32:32,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:32:32,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:32:32,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:32,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:32:32,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:32:32,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:32" (1/1) ... [2020-10-16 01:32:32,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508da3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:32, skipping insertion in model container [2020-10-16 01:32:32,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:32" (1/1) ... [2020-10-16 01:32:32,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:32:32,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:32:32,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:32,928 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:32:33,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:33,106 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:32:33,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33 WrapperNode [2020-10-16 01:32:33,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:33,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:33,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:32:33,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:32:33,117 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:32:33" (1/1) ... [2020-10-16 01:32:33,140 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:32:33" (1/1) ... [2020-10-16 01:32:33,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:33,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:32:33,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:32:33,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:32:33,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (1/1) ... [2020-10-16 01:32:33,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (1/1) ... [2020-10-16 01:32:33,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (1/1) ... [2020-10-16 01:32:33,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (1/1) ... [2020-10-16 01:32:33,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (1/1) ... [2020-10-16 01:32:33,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (1/1) ... [2020-10-16 01:32:33,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (1/1) ... [2020-10-16 01:32:33,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:32:33,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:32:33,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:32:33,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:32:33,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (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:32:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:32:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:32:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:32:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:32:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:32:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:32:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:32:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:32:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:32:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:32:33,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:32:33,322 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:32:36,776 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:32:36,777 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:32:36,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:36 BoogieIcfgContainer [2020-10-16 01:32:36,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:32:36,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:32:36,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:32:36,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:32:36,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:32:32" (1/3) ... [2020-10-16 01:32:36,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6575fe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:36, skipping insertion in model container [2020-10-16 01:32:36,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:33" (2/3) ... [2020-10-16 01:32:36,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6575fe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:36, skipping insertion in model container [2020-10-16 01:32:36,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:36" (3/3) ... [2020-10-16 01:32:36,790 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2020-10-16 01:32:36,805 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:32:36,814 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:32:36,815 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:32:36,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,869 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,869 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,886 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,888 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,941 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,943 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:36,963 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:32:36,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:32:36,984 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:32:36,984 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:32:36,985 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:32:36,985 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:32:36,985 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:32:36,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:32:36,985 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:32:36,999 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 01:32:37,039 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 01:32:37,039 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:37,044 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 01:32:37,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 01:32:37,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:37,053 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:32:37,056 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:37,059 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:37,059 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:37,079 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 01:32:37,079 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:37,080 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 01:32:37,082 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 01:32:37,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:37,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:37,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:37,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:37,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:37,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:37,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:37,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:37,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:37,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:37,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:37,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:37,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:37,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:37,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:37,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:37,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:37,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:37,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:32:37,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:38,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:38,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:38,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:38,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:38,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:38,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:38,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:38,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:38,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:38,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:38,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:38,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:38,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:38,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:38,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:38,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:38,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:38,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:38,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:38,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:38,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:38,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:38,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:38,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,706 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:32:38,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:38,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:38,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:38,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:38,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:38,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:38,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:38,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:38,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:38,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:39,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:39,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:39,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:32:39,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:39,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:39,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:39,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:39,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:39,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:39,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:39,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:39,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:39,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:39,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:39,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:39,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:39,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:39,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:40,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:40,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,244 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:32:40,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:40,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:40,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:40,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:40,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:32:40,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:40,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:40,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:40,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:40,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:40,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:40,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:40,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:40,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:40,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:40,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:40,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:40,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:40,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:40,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:40,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:40,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:40,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:40,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:40,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:40,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:40,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:40,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:41,363 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:32:41,473 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 01:32:41,478 INFO L132 LiptonReduction]: Checked pairs total: 2967 [2020-10-16 01:32:41,478 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 01:32:41,481 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4430 [2020-10-16 01:32:41,488 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 01:32:41,488 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:41,488 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:41,490 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:32:41,490 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-16 01:32:41,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:41,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292455034] [2020-10-16 01:32:41,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:41,730 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:32:41,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292455034] [2020-10-16 01:32:41,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:41,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:41,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045590054] [2020-10-16 01:32:41,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:41,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:41,770 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2020-10-16 01:32:41,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states. [2020-10-16 01:32:41,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:41,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2020-10-16 01:32:41,777 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:41,956 INFO L129 PetriNetUnfolder]: 57/144 cut-off events. [2020-10-16 01:32:41,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:41,957 INFO L80 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 144 events. 57/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 603 event pairs, 6 based on Foata normal form. 16/155 useless extension candidates. Maximal degree in co-relation 248. Up to 88 conditions per place. [2020-10-16 01:32:41,960 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 12 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 01:32:41,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 82 flow [2020-10-16 01:32:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2020-10-16 01:32:41,978 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8232662192393736 [2020-10-16 01:32:41,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2020-10-16 01:32:41,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2020-10-16 01:32:41,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:41,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2020-10-16 01:32:41,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:41,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:41,997 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:41,999 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 368 transitions. [2020-10-16 01:32:42,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 82 flow [2020-10-16 01:32:42,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:42,005 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2020-10-16 01:32:42,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2020-10-16 01:32:42,009 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 01:32:42,009 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2020-10-16 01:32:42,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:42,009 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:42,009 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:42,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:32:42,010 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-16 01:32:42,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:42,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699533782] [2020-10-16 01:32:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:42,164 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:32:42,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699533782] [2020-10-16 01:32:42,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:42,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:42,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435159030] [2020-10-16 01:32:42,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:42,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:42,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:42,169 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 149 [2020-10-16 01:32:42,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand 4 states. [2020-10-16 01:32:42,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:42,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 149 [2020-10-16 01:32:42,170 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:42,224 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2020-10-16 01:32:42,225 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:42,225 INFO L80 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 40. Up to 5 conditions per place. [2020-10-16 01:32:42,226 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 2 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2020-10-16 01:32:42,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 72 flow [2020-10-16 01:32:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2020-10-16 01:32:42,231 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8335570469798658 [2020-10-16 01:32:42,231 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2020-10-16 01:32:42,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2020-10-16 01:32:42,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:42,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2020-10-16 01:32:42,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:42,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:42,236 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:42,236 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 5 states and 621 transitions. [2020-10-16 01:32:42,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 72 flow [2020-10-16 01:32:42,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:42,238 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 52 flow [2020-10-16 01:32:42,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2020-10-16 01:32:42,242 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 01:32:42,242 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 52 flow [2020-10-16 01:32:42,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:42,242 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:42,242 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:42,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:32:42,242 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:42,243 INFO L82 PathProgramCache]: Analyzing trace with hash -413925051, now seen corresponding path program 1 times [2020-10-16 01:32:42,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:42,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922905406] [2020-10-16 01:32:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:42,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922905406] [2020-10-16 01:32:42,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:42,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:42,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459071583] [2020-10-16 01:32:42,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:42,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:42,381 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2020-10-16 01:32:42,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 52 flow. Second operand 4 states. [2020-10-16 01:32:42,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:42,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2020-10-16 01:32:42,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:42,438 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2020-10-16 01:32:42,438 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 01:32:42,439 INFO L80 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 22 events. 0/22 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 2/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 01:32:42,439 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 2 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 01:32:42,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 20 transitions, 70 flow [2020-10-16 01:32:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2020-10-16 01:32:42,442 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8093959731543624 [2020-10-16 01:32:42,442 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2020-10-16 01:32:42,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2020-10-16 01:32:42,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:42,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2020-10-16 01:32:42,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:42,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:42,446 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:42,446 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 52 flow. Second operand 5 states and 603 transitions. [2020-10-16 01:32:42,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 20 transitions, 70 flow [2020-10-16 01:32:42,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 62 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:42,448 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 56 flow [2020-10-16 01:32:42,448 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2020-10-16 01:32:42,448 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 01:32:42,448 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 56 flow [2020-10-16 01:32:42,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:42,449 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:42,449 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:42,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:32:42,449 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1421855306, now seen corresponding path program 1 times [2020-10-16 01:32:42,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:42,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344593638] [2020-10-16 01:32:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:42,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344593638] [2020-10-16 01:32:42,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:42,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:42,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800691959] [2020-10-16 01:32:42,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:42,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:42,921 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 01:32:42,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 56 flow. Second operand 9 states. [2020-10-16 01:32:42,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:42,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 01:32:42,929 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:43,373 INFO L129 PetriNetUnfolder]: 68/167 cut-off events. [2020-10-16 01:32:43,373 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2020-10-16 01:32:43,374 INFO L80 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 167 events. 68/167 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 712 event pairs, 15 based on Foata normal form. 7/173 useless extension candidates. Maximal degree in co-relation 358. Up to 92 conditions per place. [2020-10-16 01:32:43,376 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 15 selfloop transitions, 12 changer transitions 6/40 dead transitions. [2020-10-16 01:32:43,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 176 flow [2020-10-16 01:32:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 731 transitions. [2020-10-16 01:32:43,383 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.613255033557047 [2020-10-16 01:32:43,383 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 731 transitions. [2020-10-16 01:32:43,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 731 transitions. [2020-10-16 01:32:43,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:43,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 731 transitions. [2020-10-16 01:32:43,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:43,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:43,389 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:43,389 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 56 flow. Second operand 8 states and 731 transitions. [2020-10-16 01:32:43,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 176 flow [2020-10-16 01:32:43,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 164 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:43,391 INFO L241 Difference]: Finished difference. Result has 37 places, 28 transitions, 135 flow [2020-10-16 01:32:43,392 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=135, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2020-10-16 01:32:43,392 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2020-10-16 01:32:43,392 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 135 flow [2020-10-16 01:32:43,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:43,392 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:43,392 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:43,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:32:43,392 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1326879286, now seen corresponding path program 2 times [2020-10-16 01:32:43,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:43,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203576133] [2020-10-16 01:32:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:43,713 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:32:43,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203576133] [2020-10-16 01:32:43,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:43,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:43,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531466429] [2020-10-16 01:32:43,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:43,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:43,721 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 149 [2020-10-16 01:32:43,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 135 flow. Second operand 8 states. [2020-10-16 01:32:43,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:43,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 149 [2020-10-16 01:32:43,723 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:44,038 INFO L129 PetriNetUnfolder]: 70/170 cut-off events. [2020-10-16 01:32:44,038 INFO L130 PetriNetUnfolder]: For 146/154 co-relation queries the response was YES. [2020-10-16 01:32:44,040 INFO L80 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 170 events. 70/170 cut-off events. For 146/154 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 724 event pairs, 15 based on Foata normal form. 10/179 useless extension candidates. Maximal degree in co-relation 534. Up to 94 conditions per place. [2020-10-16 01:32:44,041 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 16 selfloop transitions, 14 changer transitions 6/43 dead transitions. [2020-10-16 01:32:44,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 287 flow [2020-10-16 01:32:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 747 transitions. [2020-10-16 01:32:44,045 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6266778523489933 [2020-10-16 01:32:44,045 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 747 transitions. [2020-10-16 01:32:44,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 747 transitions. [2020-10-16 01:32:44,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:44,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 747 transitions. [2020-10-16 01:32:44,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:44,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:44,049 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:44,049 INFO L185 Difference]: Start difference. First operand has 37 places, 28 transitions, 135 flow. Second operand 8 states and 747 transitions. [2020-10-16 01:32:44,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 287 flow [2020-10-16 01:32:44,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 285 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:44,053 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 209 flow [2020-10-16 01:32:44,053 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2020-10-16 01:32:44,053 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2020-10-16 01:32:44,053 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 209 flow [2020-10-16 01:32:44,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:44,053 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:44,054 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:44,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:32:44,054 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1194927690, now seen corresponding path program 3 times [2020-10-16 01:32:44,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:44,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479871980] [2020-10-16 01:32:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:44,252 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:32:44,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479871980] [2020-10-16 01:32:44,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:44,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:44,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235273169] [2020-10-16 01:32:44,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:44,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:44,257 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 149 [2020-10-16 01:32:44,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 209 flow. Second operand 8 states. [2020-10-16 01:32:44,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:44,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 149 [2020-10-16 01:32:44,258 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:44,620 INFO L129 PetriNetUnfolder]: 84/192 cut-off events. [2020-10-16 01:32:44,620 INFO L130 PetriNetUnfolder]: For 443/453 co-relation queries the response was YES. [2020-10-16 01:32:44,622 INFO L80 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 192 events. 84/192 cut-off events. For 443/453 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 785 event pairs, 8 based on Foata normal form. 13/204 useless extension candidates. Maximal degree in co-relation 763. Up to 125 conditions per place. [2020-10-16 01:32:44,624 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 20 selfloop transitions, 27 changer transitions 4/58 dead transitions. [2020-10-16 01:32:44,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 491 flow [2020-10-16 01:32:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:32:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:32:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 842 transitions. [2020-10-16 01:32:44,628 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.627889634601044 [2020-10-16 01:32:44,629 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 842 transitions. [2020-10-16 01:32:44,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 842 transitions. [2020-10-16 01:32:44,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:44,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 842 transitions. [2020-10-16 01:32:44,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:32:44,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:32:44,634 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:32:44,634 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 209 flow. Second operand 9 states and 842 transitions. [2020-10-16 01:32:44,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 491 flow [2020-10-16 01:32:44,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 433 flow, removed 16 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:44,641 INFO L241 Difference]: Finished difference. Result has 51 places, 50 transitions, 388 flow [2020-10-16 01:32:44,641 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=388, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2020-10-16 01:32:44,641 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2020-10-16 01:32:44,641 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 388 flow [2020-10-16 01:32:44,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:44,642 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:44,642 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:44,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:32:44,642 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash -389068512, now seen corresponding path program 4 times [2020-10-16 01:32:44,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:44,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808438793] [2020-10-16 01:32:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:44,833 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:32:44,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808438793] [2020-10-16 01:32:44,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:44,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:44,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754690620] [2020-10-16 01:32:44,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:44,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:44,838 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 149 [2020-10-16 01:32:44,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 388 flow. Second operand 8 states. [2020-10-16 01:32:44,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:44,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 149 [2020-10-16 01:32:44,839 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:45,274 INFO L129 PetriNetUnfolder]: 228/423 cut-off events. [2020-10-16 01:32:45,274 INFO L130 PetriNetUnfolder]: For 1439/1441 co-relation queries the response was YES. [2020-10-16 01:32:45,276 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 423 events. 228/423 cut-off events. For 1439/1441 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1750 event pairs, 35 based on Foata normal form. 15/435 useless extension candidates. Maximal degree in co-relation 1837. Up to 275 conditions per place. [2020-10-16 01:32:45,280 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 40 selfloop transitions, 27 changer transitions 10/81 dead transitions. [2020-10-16 01:32:45,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 753 flow [2020-10-16 01:32:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:32:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:32:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 732 transitions. [2020-10-16 01:32:45,284 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5458612975391499 [2020-10-16 01:32:45,284 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 732 transitions. [2020-10-16 01:32:45,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 732 transitions. [2020-10-16 01:32:45,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:45,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 732 transitions. [2020-10-16 01:32:45,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:32:45,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:32:45,289 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:32:45,289 INFO L185 Difference]: Start difference. First operand has 51 places, 50 transitions, 388 flow. Second operand 9 states and 732 transitions. [2020-10-16 01:32:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 753 flow [2020-10-16 01:32:45,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 708 flow, removed 20 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:45,299 INFO L241 Difference]: Finished difference. Result has 61 places, 59 transitions, 539 flow [2020-10-16 01:32:45,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=539, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2020-10-16 01:32:45,300 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 34 predicate places. [2020-10-16 01:32:45,300 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 539 flow [2020-10-16 01:32:45,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:45,300 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:45,300 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:45,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:32:45,301 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:45,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2037029707, now seen corresponding path program 1 times [2020-10-16 01:32:45,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:45,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636277526] [2020-10-16 01:32:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:45,538 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:32:45,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636277526] [2020-10-16 01:32:45,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:45,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:45,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020647455] [2020-10-16 01:32:45,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:45,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:45,542 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 01:32:45,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 539 flow. Second operand 7 states. [2020-10-16 01:32:45,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:45,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 01:32:45,543 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:45,972 INFO L129 PetriNetUnfolder]: 91/211 cut-off events. [2020-10-16 01:32:45,972 INFO L130 PetriNetUnfolder]: For 1050/1062 co-relation queries the response was YES. [2020-10-16 01:32:45,973 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 211 events. 91/211 cut-off events. For 1050/1062 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 959 event pairs, 3 based on Foata normal form. 8/218 useless extension candidates. Maximal degree in co-relation 1157. Up to 88 conditions per place. [2020-10-16 01:32:45,976 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 25 selfloop transitions, 41 changer transitions 5/79 dead transitions. [2020-10-16 01:32:45,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 890 flow [2020-10-16 01:32:45,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:32:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:32:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 812 transitions. [2020-10-16 01:32:45,983 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6055182699478001 [2020-10-16 01:32:45,984 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 812 transitions. [2020-10-16 01:32:45,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 812 transitions. [2020-10-16 01:32:45,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:45,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 812 transitions. [2020-10-16 01:32:45,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:32:45,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:32:45,989 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:32:45,989 INFO L185 Difference]: Start difference. First operand has 61 places, 59 transitions, 539 flow. Second operand 9 states and 812 transitions. [2020-10-16 01:32:45,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 890 flow [2020-10-16 01:32:45,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 79 transitions, 848 flow, removed 15 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:45,999 INFO L241 Difference]: Finished difference. Result has 66 places, 66 transitions, 701 flow [2020-10-16 01:32:46,000 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=701, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2020-10-16 01:32:46,000 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 39 predicate places. [2020-10-16 01:32:46,000 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 701 flow [2020-10-16 01:32:46,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:46,000 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:46,001 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:46,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:32:46,001 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:46,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:46,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1138626498, now seen corresponding path program 1 times [2020-10-16 01:32:46,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:46,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662204236] [2020-10-16 01:32:46,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:46,418 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:32:46,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662204236] [2020-10-16 01:32:46,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:46,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:46,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426991295] [2020-10-16 01:32:46,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:46,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:46,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:46,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:46,422 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 149 [2020-10-16 01:32:46,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 701 flow. Second operand 8 states. [2020-10-16 01:32:46,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:46,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 149 [2020-10-16 01:32:46,423 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:46,783 INFO L129 PetriNetUnfolder]: 90/209 cut-off events. [2020-10-16 01:32:46,783 INFO L130 PetriNetUnfolder]: For 1298/1310 co-relation queries the response was YES. [2020-10-16 01:32:46,785 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 209 events. 90/209 cut-off events. For 1298/1310 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 943 event pairs, 5 based on Foata normal form. 8/217 useless extension candidates. Maximal degree in co-relation 1277. Up to 142 conditions per place. [2020-10-16 01:32:46,787 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 49 selfloop transitions, 18 changer transitions 3/78 dead transitions. [2020-10-16 01:32:46,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 983 flow [2020-10-16 01:32:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 749 transitions. [2020-10-16 01:32:46,791 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6283557046979866 [2020-10-16 01:32:46,791 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 749 transitions. [2020-10-16 01:32:46,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 749 transitions. [2020-10-16 01:32:46,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:46,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 749 transitions. [2020-10-16 01:32:46,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:46,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:46,796 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:46,796 INFO L185 Difference]: Start difference. First operand has 66 places, 66 transitions, 701 flow. Second operand 8 states and 749 transitions. [2020-10-16 01:32:46,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 983 flow [2020-10-16 01:32:46,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 942 flow, removed 20 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:46,806 INFO L241 Difference]: Finished difference. Result has 70 places, 69 transitions, 773 flow [2020-10-16 01:32:46,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=773, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2020-10-16 01:32:46,806 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 43 predicate places. [2020-10-16 01:32:46,806 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 773 flow [2020-10-16 01:32:46,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:46,807 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:46,807 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:46,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:32:46,807 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:46,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1645282806, now seen corresponding path program 2 times [2020-10-16 01:32:46,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:46,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963301162] [2020-10-16 01:32:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:47,120 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:32:47,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963301162] [2020-10-16 01:32:47,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:47,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:47,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009301137] [2020-10-16 01:32:47,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:47,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:47,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:47,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:47,124 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 01:32:47,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 773 flow. Second operand 7 states. [2020-10-16 01:32:47,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:47,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 01:32:47,125 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:47,701 INFO L129 PetriNetUnfolder]: 88/206 cut-off events. [2020-10-16 01:32:47,701 INFO L130 PetriNetUnfolder]: For 1436/1457 co-relation queries the response was YES. [2020-10-16 01:32:47,702 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 206 events. 88/206 cut-off events. For 1436/1457 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 940 event pairs, 1 based on Foata normal form. 13/219 useless extension candidates. Maximal degree in co-relation 1251. Up to 104 conditions per place. [2020-10-16 01:32:47,705 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 40 selfloop transitions, 33 changer transitions 3/84 dead transitions. [2020-10-16 01:32:47,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 1098 flow [2020-10-16 01:32:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:32:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:32:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 895 transitions. [2020-10-16 01:32:47,711 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6006711409395973 [2020-10-16 01:32:47,711 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 895 transitions. [2020-10-16 01:32:47,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 895 transitions. [2020-10-16 01:32:47,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:47,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 895 transitions. [2020-10-16 01:32:47,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:32:47,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:32:47,716 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:32:47,717 INFO L185 Difference]: Start difference. First operand has 70 places, 69 transitions, 773 flow. Second operand 10 states and 895 transitions. [2020-10-16 01:32:47,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 1098 flow [2020-10-16 01:32:47,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 1026 flow, removed 14 selfloop flow, removed 7 redundant places. [2020-10-16 01:32:47,727 INFO L241 Difference]: Finished difference. Result has 75 places, 74 transitions, 879 flow [2020-10-16 01:32:47,727 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=879, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2020-10-16 01:32:47,727 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2020-10-16 01:32:47,727 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 879 flow [2020-10-16 01:32:47,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:47,728 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:47,728 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:47,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:32:47,728 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:47,729 INFO L82 PathProgramCache]: Analyzing trace with hash -747998279, now seen corresponding path program 1 times [2020-10-16 01:32:47,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:47,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981305638] [2020-10-16 01:32:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:47,837 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:32:47,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981305638] [2020-10-16 01:32:47,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:47,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:47,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139672862] [2020-10-16 01:32:47,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:47,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:47,841 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 149 [2020-10-16 01:32:47,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 879 flow. Second operand 5 states. [2020-10-16 01:32:47,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:47,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 149 [2020-10-16 01:32:47,842 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:48,087 INFO L129 PetriNetUnfolder]: 109/265 cut-off events. [2020-10-16 01:32:48,087 INFO L130 PetriNetUnfolder]: For 2067/2095 co-relation queries the response was YES. [2020-10-16 01:32:48,089 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 265 events. 109/265 cut-off events. For 2067/2095 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1346 event pairs, 11 based on Foata normal form. 13/278 useless extension candidates. Maximal degree in co-relation 1662. Up to 122 conditions per place. [2020-10-16 01:32:48,092 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 46 selfloop transitions, 16 changer transitions 26/102 dead transitions. [2020-10-16 01:32:48,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 1392 flow [2020-10-16 01:32:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2020-10-16 01:32:48,096 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.676510067114094 [2020-10-16 01:32:48,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2020-10-16 01:32:48,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2020-10-16 01:32:48,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:48,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2020-10-16 01:32:48,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:48,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:48,143 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:48,143 INFO L185 Difference]: Start difference. First operand has 75 places, 74 transitions, 879 flow. Second operand 5 states and 504 transitions. [2020-10-16 01:32:48,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 1392 flow [2020-10-16 01:32:48,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 1350 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 01:32:48,156 INFO L241 Difference]: Finished difference. Result has 75 places, 76 transitions, 906 flow [2020-10-16 01:32:48,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=906, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2020-10-16 01:32:48,157 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2020-10-16 01:32:48,157 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 906 flow [2020-10-16 01:32:48,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:48,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:48,158 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:48,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:32:48,159 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:48,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2070840229, now seen corresponding path program 2 times [2020-10-16 01:32:48,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:48,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049218781] [2020-10-16 01:32:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:48,354 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:32:48,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049218781] [2020-10-16 01:32:48,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:48,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:48,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756590717] [2020-10-16 01:32:48,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:48,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:48,357 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 01:32:48,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 906 flow. Second operand 6 states. [2020-10-16 01:32:48,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:48,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 01:32:48,358 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:48,669 INFO L129 PetriNetUnfolder]: 73/202 cut-off events. [2020-10-16 01:32:48,669 INFO L130 PetriNetUnfolder]: For 1639/1652 co-relation queries the response was YES. [2020-10-16 01:32:48,671 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 202 events. 73/202 cut-off events. For 1639/1652 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1001 event pairs, 4 based on Foata normal form. 4/206 useless extension candidates. Maximal degree in co-relation 1280. Up to 104 conditions per place. [2020-10-16 01:32:48,673 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 43 selfloop transitions, 31 changer transitions 8/90 dead transitions. [2020-10-16 01:32:48,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 90 transitions, 1232 flow [2020-10-16 01:32:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 634 transitions. [2020-10-16 01:32:48,677 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6078619367209971 [2020-10-16 01:32:48,677 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 634 transitions. [2020-10-16 01:32:48,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 634 transitions. [2020-10-16 01:32:48,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:48,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 634 transitions. [2020-10-16 01:32:48,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:48,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:48,683 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:48,683 INFO L185 Difference]: Start difference. First operand has 75 places, 76 transitions, 906 flow. Second operand 7 states and 634 transitions. [2020-10-16 01:32:48,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 90 transitions, 1232 flow [2020-10-16 01:32:48,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 90 transitions, 1196 flow, removed 9 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:48,700 INFO L241 Difference]: Finished difference. Result has 79 places, 80 transitions, 1011 flow [2020-10-16 01:32:48,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1011, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2020-10-16 01:32:48,701 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 52 predicate places. [2020-10-16 01:32:48,701 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 1011 flow [2020-10-16 01:32:48,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:48,701 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:48,701 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:48,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:32:48,702 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1097561863, now seen corresponding path program 3 times [2020-10-16 01:32:48,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:48,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538610784] [2020-10-16 01:32:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:48,952 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:32:48,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538610784] [2020-10-16 01:32:48,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:48,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:48,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040537330] [2020-10-16 01:32:48,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:48,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:48,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:48,958 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 01:32:48,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 1011 flow. Second operand 8 states. [2020-10-16 01:32:48,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:48,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 01:32:48,959 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:49,376 INFO L129 PetriNetUnfolder]: 71/206 cut-off events. [2020-10-16 01:32:49,376 INFO L130 PetriNetUnfolder]: For 1811/1824 co-relation queries the response was YES. [2020-10-16 01:32:49,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 206 events. 71/206 cut-off events. For 1811/1824 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1065 event pairs, 0 based on Foata normal form. 10/216 useless extension candidates. Maximal degree in co-relation 1380. Up to 94 conditions per place. [2020-10-16 01:32:49,379 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 49 selfloop transitions, 37 changer transitions 11/105 dead transitions. [2020-10-16 01:32:49,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 105 transitions, 1533 flow [2020-10-16 01:32:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 01:32:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 01:32:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions. [2020-10-16 01:32:49,384 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6034675615212528 [2020-10-16 01:32:49,384 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions. [2020-10-16 01:32:49,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions. [2020-10-16 01:32:49,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:49,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions. [2020-10-16 01:32:49,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 01:32:49,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 01:32:49,390 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 01:32:49,391 INFO L185 Difference]: Start difference. First operand has 79 places, 80 transitions, 1011 flow. Second operand 12 states and 1079 transitions. [2020-10-16 01:32:49,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 105 transitions, 1533 flow [2020-10-16 01:32:49,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 1454 flow, removed 8 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:49,404 INFO L241 Difference]: Finished difference. Result has 90 places, 90 transitions, 1202 flow [2020-10-16 01:32:49,405 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1202, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2020-10-16 01:32:49,405 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 63 predicate places. [2020-10-16 01:32:49,405 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 1202 flow [2020-10-16 01:32:49,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:49,405 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:49,406 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:49,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:32:49,406 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1057606849, now seen corresponding path program 1 times [2020-10-16 01:32:49,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:49,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767935917] [2020-10-16 01:32:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:49,664 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:32:49,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767935917] [2020-10-16 01:32:49,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:49,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:49,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897844603] [2020-10-16 01:32:49,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:49,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:49,667 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 01:32:49,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 1202 flow. Second operand 9 states. [2020-10-16 01:32:49,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:49,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 01:32:49,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:50,053 INFO L129 PetriNetUnfolder]: 69/208 cut-off events. [2020-10-16 01:32:50,053 INFO L130 PetriNetUnfolder]: For 2165/2175 co-relation queries the response was YES. [2020-10-16 01:32:50,055 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 208 events. 69/208 cut-off events. For 2165/2175 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1083 event pairs, 1 based on Foata normal form. 8/216 useless extension candidates. Maximal degree in co-relation 1466. Up to 114 conditions per place. [2020-10-16 01:32:50,057 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 58 selfloop transitions, 18 changer transitions 21/104 dead transitions. [2020-10-16 01:32:50,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 1590 flow [2020-10-16 01:32:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 640 transitions. [2020-10-16 01:32:50,062 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.613614573346117 [2020-10-16 01:32:50,062 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 640 transitions. [2020-10-16 01:32:50,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 640 transitions. [2020-10-16 01:32:50,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:50,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 640 transitions. [2020-10-16 01:32:50,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:50,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:50,070 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:50,070 INFO L185 Difference]: Start difference. First operand has 90 places, 90 transitions, 1202 flow. Second operand 7 states and 640 transitions. [2020-10-16 01:32:50,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 1590 flow [2020-10-16 01:32:50,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 104 transitions, 1518 flow, removed 19 selfloop flow, removed 5 redundant places. [2020-10-16 01:32:50,088 INFO L241 Difference]: Finished difference. Result has 93 places, 82 transitions, 1089 flow [2020-10-16 01:32:50,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1089, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2020-10-16 01:32:50,089 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 66 predicate places. [2020-10-16 01:32:50,089 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 1089 flow [2020-10-16 01:32:50,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:50,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:50,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:50,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:32:50,090 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2061505675, now seen corresponding path program 4 times [2020-10-16 01:32:50,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:50,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712249344] [2020-10-16 01:32:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:50,510 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2020-10-16 01:32:50,571 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:32:50,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712249344] [2020-10-16 01:32:50,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:50,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:50,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427165259] [2020-10-16 01:32:50,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:50,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:50,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:50,574 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 149 [2020-10-16 01:32:50,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 1089 flow. Second operand 8 states. [2020-10-16 01:32:50,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:50,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 149 [2020-10-16 01:32:50,574 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:51,383 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2020-10-16 01:32:51,428 INFO L129 PetriNetUnfolder]: 60/188 cut-off events. [2020-10-16 01:32:51,428 INFO L130 PetriNetUnfolder]: For 2055/2065 co-relation queries the response was YES. [2020-10-16 01:32:51,430 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 188 events. 60/188 cut-off events. For 2055/2065 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 948 event pairs, 0 based on Foata normal form. 6/194 useless extension candidates. Maximal degree in co-relation 1316. Up to 63 conditions per place. [2020-10-16 01:32:51,432 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 29 selfloop transitions, 22 changer transitions 33/91 dead transitions. [2020-10-16 01:32:51,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 91 transitions, 1393 flow [2020-10-16 01:32:51,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:32:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:32:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 867 transitions. [2020-10-16 01:32:51,439 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5818791946308725 [2020-10-16 01:32:51,439 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 867 transitions. [2020-10-16 01:32:51,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 867 transitions. [2020-10-16 01:32:51,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:51,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 867 transitions. [2020-10-16 01:32:51,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:32:51,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:32:51,445 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:32:51,445 INFO L185 Difference]: Start difference. First operand has 93 places, 82 transitions, 1089 flow. Second operand 10 states and 867 transitions. [2020-10-16 01:32:51,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 91 transitions, 1393 flow [2020-10-16 01:32:51,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 1328 flow, removed 3 selfloop flow, removed 7 redundant places. [2020-10-16 01:32:51,463 INFO L241 Difference]: Finished difference. Result has 94 places, 55 transitions, 725 flow [2020-10-16 01:32:51,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=725, PETRI_PLACES=94, PETRI_TRANSITIONS=55} [2020-10-16 01:32:51,464 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 67 predicate places. [2020-10-16 01:32:51,464 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 55 transitions, 725 flow [2020-10-16 01:32:51,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:51,465 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:51,465 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:51,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:32:51,465 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1782221107, now seen corresponding path program 2 times [2020-10-16 01:32:51,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:51,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613455516] [2020-10-16 01:32:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:51,883 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:32:51,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613455516] [2020-10-16 01:32:51,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:51,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:51,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626578560] [2020-10-16 01:32:51,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:51,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:51,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:51,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:51,889 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 01:32:51,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 55 transitions, 725 flow. Second operand 9 states. [2020-10-16 01:32:51,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:51,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 01:32:51,890 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:52,145 INFO L129 PetriNetUnfolder]: 44/142 cut-off events. [2020-10-16 01:32:52,146 INFO L130 PetriNetUnfolder]: For 1606/1623 co-relation queries the response was YES. [2020-10-16 01:32:52,147 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 142 events. 44/142 cut-off events. For 1606/1623 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 642 event pairs, 0 based on Foata normal form. 17/159 useless extension candidates. Maximal degree in co-relation 1023. Up to 70 conditions per place. [2020-10-16 01:32:52,149 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 35 selfloop transitions, 6 changer transitions 22/70 dead transitions. [2020-10-16 01:32:52,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 70 transitions, 1071 flow [2020-10-16 01:32:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 725 transitions. [2020-10-16 01:32:52,152 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6082214765100671 [2020-10-16 01:32:52,152 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 725 transitions. [2020-10-16 01:32:52,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 725 transitions. [2020-10-16 01:32:52,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:52,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 725 transitions. [2020-10-16 01:32:52,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:52,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:52,158 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:52,158 INFO L185 Difference]: Start difference. First operand has 94 places, 55 transitions, 725 flow. Second operand 8 states and 725 transitions. [2020-10-16 01:32:52,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 70 transitions, 1071 flow [2020-10-16 01:32:52,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 886 flow, removed 39 selfloop flow, removed 18 redundant places. [2020-10-16 01:32:52,170 INFO L241 Difference]: Finished difference. Result has 76 places, 48 transitions, 522 flow [2020-10-16 01:32:52,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=522, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2020-10-16 01:32:52,171 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 49 predicate places. [2020-10-16 01:32:52,171 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 522 flow [2020-10-16 01:32:52,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:52,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:52,171 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:52,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:32:52,171 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash -849096105, now seen corresponding path program 5 times [2020-10-16 01:32:52,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:52,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546576517] [2020-10-16 01:32:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:52,379 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:32:52,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546576517] [2020-10-16 01:32:52,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:52,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:32:52,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695614377] [2020-10-16 01:32:52,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:32:52,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:52,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:32:52,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:32:52,383 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 149 [2020-10-16 01:32:52,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 522 flow. Second operand 10 states. [2020-10-16 01:32:52,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:52,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 149 [2020-10-16 01:32:52,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:52,708 INFO L129 PetriNetUnfolder]: 107/230 cut-off events. [2020-10-16 01:32:52,708 INFO L130 PetriNetUnfolder]: For 1316/1317 co-relation queries the response was YES. [2020-10-16 01:32:52,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 230 events. 107/230 cut-off events. For 1316/1317 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 843 event pairs, 44 based on Foata normal form. 9/239 useless extension candidates. Maximal degree in co-relation 1218. Up to 176 conditions per place. [2020-10-16 01:32:52,711 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 38 selfloop transitions, 3 changer transitions 20/65 dead transitions. [2020-10-16 01:32:52,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 65 transitions, 791 flow [2020-10-16 01:32:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 544 transitions. [2020-10-16 01:32:52,713 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5215723873441994 [2020-10-16 01:32:52,713 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 544 transitions. [2020-10-16 01:32:52,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 544 transitions. [2020-10-16 01:32:52,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:52,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 544 transitions. [2020-10-16 01:32:52,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:52,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:52,716 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:52,716 INFO L185 Difference]: Start difference. First operand has 76 places, 48 transitions, 522 flow. Second operand 7 states and 544 transitions. [2020-10-16 01:32:52,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 65 transitions, 791 flow [2020-10-16 01:32:52,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 727 flow, removed 13 selfloop flow, removed 9 redundant places. [2020-10-16 01:32:52,723 INFO L241 Difference]: Finished difference. Result has 70 places, 44 transitions, 440 flow [2020-10-16 01:32:52,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2020-10-16 01:32:52,724 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 43 predicate places. [2020-10-16 01:32:52,724 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 440 flow [2020-10-16 01:32:52,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:32:52,724 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:52,724 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:52,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:32:52,725 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:52,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:52,725 INFO L82 PathProgramCache]: Analyzing trace with hash -225675651, now seen corresponding path program 6 times [2020-10-16 01:32:52,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:52,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659173234] [2020-10-16 01:32:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:52,868 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:32:52,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659173234] [2020-10-16 01:32:52,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:52,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:52,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558235794] [2020-10-16 01:32:52,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:52,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:52,872 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 149 [2020-10-16 01:32:52,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 44 transitions, 440 flow. Second operand 7 states. [2020-10-16 01:32:52,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:52,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 149 [2020-10-16 01:32:52,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:53,323 INFO L129 PetriNetUnfolder]: 30/104 cut-off events. [2020-10-16 01:32:53,323 INFO L130 PetriNetUnfolder]: For 496/496 co-relation queries the response was YES. [2020-10-16 01:32:53,324 INFO L80 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 104 events. 30/104 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 394 event pairs, 0 based on Foata normal form. 3/107 useless extension candidates. Maximal degree in co-relation 586. Up to 46 conditions per place. [2020-10-16 01:32:53,324 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 12 selfloop transitions, 6 changer transitions 30/55 dead transitions. [2020-10-16 01:32:53,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 661 flow [2020-10-16 01:32:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2020-10-16 01:32:53,327 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6442953020134228 [2020-10-16 01:32:53,327 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2020-10-16 01:32:53,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2020-10-16 01:32:53,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:53,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2020-10-16 01:32:53,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:53,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:53,330 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:53,330 INFO L185 Difference]: Start difference. First operand has 70 places, 44 transitions, 440 flow. Second operand 7 states and 672 transitions. [2020-10-16 01:32:53,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 661 flow [2020-10-16 01:32:53,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 627 flow, removed 13 selfloop flow, removed 9 redundant places. [2020-10-16 01:32:53,335 INFO L241 Difference]: Finished difference. Result has 62 places, 25 transitions, 211 flow [2020-10-16 01:32:53,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=62, PETRI_TRANSITIONS=25} [2020-10-16 01:32:53,335 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 35 predicate places. [2020-10-16 01:32:53,335 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 25 transitions, 211 flow [2020-10-16 01:32:53,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:53,335 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:53,336 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:53,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:32:53,336 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash -973685183, now seen corresponding path program 7 times [2020-10-16 01:32:53,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:53,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204400332] [2020-10-16 01:32:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:53,477 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:32:53,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204400332] [2020-10-16 01:32:53,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:53,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:53,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749383603] [2020-10-16 01:32:53,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:53,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:53,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:53,480 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 149 [2020-10-16 01:32:53,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 25 transitions, 211 flow. Second operand 7 states. [2020-10-16 01:32:53,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:53,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 149 [2020-10-16 01:32:53,480 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:53,585 INFO L129 PetriNetUnfolder]: 6/34 cut-off events. [2020-10-16 01:32:53,586 INFO L130 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2020-10-16 01:32:53,586 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 34 events. 6/34 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 49 event pairs, 0 based on Foata normal form. 3/37 useless extension candidates. Maximal degree in co-relation 172. Up to 17 conditions per place. [2020-10-16 01:32:53,586 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2020-10-16 01:32:53,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 26 transitions, 261 flow [2020-10-16 01:32:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2020-10-16 01:32:53,589 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6375838926174496 [2020-10-16 01:32:53,589 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 570 transitions. [2020-10-16 01:32:53,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions. [2020-10-16 01:32:53,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:53,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions. [2020-10-16 01:32:53,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:53,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:53,591 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:53,591 INFO L185 Difference]: Start difference. First operand has 62 places, 25 transitions, 211 flow. Second operand 6 states and 570 transitions. [2020-10-16 01:32:53,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 26 transitions, 261 flow [2020-10-16 01:32:53,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 26 transitions, 173 flow, removed 22 selfloop flow, removed 19 redundant places. [2020-10-16 01:32:53,593 INFO L241 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2020-10-16 01:32:53,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2020-10-16 01:32:53,594 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2020-10-16 01:32:53,594 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2020-10-16 01:32:53,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:53,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:32:53,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:32:53 BasicIcfg [2020-10-16 01:32:53,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:32:53,600 INFO L168 Benchmark]: Toolchain (without parser) took 21386.96 ms. Allocated memory was 248.5 MB in the beginning and 690.0 MB in the end (delta: 441.5 MB). Free memory was 200.9 MB in the beginning and 284.2 MB in the end (delta: -83.3 MB). Peak memory consumption was 358.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:53,601 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 248.5 MB. Free memory is still 222.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:32:53,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 893.52 ms. Allocated memory was 248.5 MB in the beginning and 306.2 MB in the end (delta: 57.7 MB). Free memory was 200.9 MB in the beginning and 254.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 30.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:53,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.51 ms. Allocated memory is still 306.2 MB. Free memory was 254.1 MB in the beginning and 249.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:53,612 INFO L168 Benchmark]: Boogie Preprocessor took 50.56 ms. Allocated memory is still 306.2 MB. Free memory was 249.1 MB in the beginning and 246.6 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:32:53,613 INFO L168 Benchmark]: RCFGBuilder took 3541.39 ms. Allocated memory was 306.2 MB in the beginning and 368.1 MB in the end (delta: 61.9 MB). Free memory was 246.6 MB in the beginning and 167.0 MB in the end (delta: 79.6 MB). Peak memory consumption was 146.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:53,614 INFO L168 Benchmark]: TraceAbstraction took 16817.20 ms. Allocated memory was 368.1 MB in the beginning and 690.0 MB in the end (delta: 321.9 MB). Free memory was 167.0 MB in the beginning and 284.2 MB in the end (delta: -117.2 MB). Peak memory consumption was 204.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:53,620 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.55 ms. Allocated memory is still 248.5 MB. Free memory is still 222.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 893.52 ms. Allocated memory was 248.5 MB in the beginning and 306.2 MB in the end (delta: 57.7 MB). Free memory was 200.9 MB in the beginning and 254.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 30.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 79.51 ms. Allocated memory is still 306.2 MB. Free memory was 254.1 MB in the beginning and 249.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 50.56 ms. Allocated memory is still 306.2 MB. Free memory was 249.1 MB in the beginning and 246.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3541.39 ms. Allocated memory was 306.2 MB in the beginning and 368.1 MB in the end (delta: 61.9 MB). Free memory was 246.6 MB in the beginning and 167.0 MB in the end (delta: 79.6 MB). Peak memory consumption was 146.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 16817.20 ms. Allocated memory was 368.1 MB in the beginning and 690.0 MB in the end (delta: 321.9 MB). Free memory was 167.0 MB in the beginning and 284.2 MB in the end (delta: -117.2 MB). Peak memory consumption was 204.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 616 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.4s, 83 PlacesBefore, 27 PlacesAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 2967 MoverChecksTotal - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 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: SAFE, OverallTime: 16.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 150 SDtfs, 126 SDslu, 208 SDs, 0 SdLazy, 1302 SolverSat, 315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1202occurred 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.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 36264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 correct! Received shutdown request...