/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:45:58,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:45:58,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:45:58,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:45:58,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:45:58,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:45:58,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:45:58,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:45:58,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:45:58,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:45:58,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:45:58,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:45:58,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:45:58,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:45:58,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:45:58,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:45:58,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:45:58,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:45:58,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:45:58,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:45:58,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:45:58,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:45:58,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:45:58,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:45:58,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:45:58,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:45:58,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:45:58,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:45:58,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:45:58,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:45:58,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:45:58,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:45:58,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:45:58,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:45:58,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:45:58,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:45:58,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:45:58,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:45:58,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:45:58,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:45:58,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:45:58,431 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 22:45:58,453 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:45:58,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:45:58,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:45:58,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:45:58,455 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:45:58,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:45:58,456 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:45:58,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:45:58,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:45:58,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:45:58,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:45:58,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:45:58,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:45:58,457 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:45:58,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:45:58,457 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:45:58,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:45:58,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:45:58,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:45:58,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:45:58,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:45:58,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:45:58,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:45:58,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:45:58,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:45:58,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:45:58,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:45:58,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:45:58,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:45:58,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:45:58,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:45:58,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:45:58,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:45:58,778 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:45:58,782 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:45:58,783 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-05 22:45:58,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34c4ba25/d94e7e3692444767858d7d059fa06874/FLAGf6d66f160 [2020-10-05 22:45:59,388 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:45:59,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-05 22:45:59,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34c4ba25/d94e7e3692444767858d7d059fa06874/FLAGf6d66f160 [2020-10-05 22:45:59,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34c4ba25/d94e7e3692444767858d7d059fa06874 [2020-10-05 22:45:59,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:45:59,699 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:45:59,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:45:59,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:45:59,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:45:59,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:45:59" (1/1) ... [2020-10-05 22:45:59,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498bda3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:45:59, skipping insertion in model container [2020-10-05 22:45:59,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:45:59" (1/1) ... [2020-10-05 22:45:59,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:45:59,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:46:00,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:46:00,349 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:46:00,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:46:00,511 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:46:00,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00 WrapperNode [2020-10-05 22:46:00,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:46:00,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:46:00,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:46:00,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:46:00,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:46:00,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:46:00,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:46:00,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:46:00,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (1/1) ... [2020-10-05 22:46:00,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:46:00,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:46:00,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:46:00,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:46:00,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (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-05 22:46:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:46:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:46:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:46:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:46:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:46:00,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:46:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:46:00,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:46:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:46:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:46:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:46:00,788 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:46:04,267 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:46:04,267 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:46:04,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:46:04 BoogieIcfgContainer [2020-10-05 22:46:04,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:46:04,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:46:04,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:46:04,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:46:04,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:45:59" (1/3) ... [2020-10-05 22:46:04,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ca391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:46:04, skipping insertion in model container [2020-10-05 22:46:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:46:00" (2/3) ... [2020-10-05 22:46:04,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ca391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:46:04, skipping insertion in model container [2020-10-05 22:46:04,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:46:04" (3/3) ... [2020-10-05 22:46:04,280 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2020-10-05 22:46:04,292 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:46:04,292 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:46:04,300 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:46:04,301 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:46:04,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,338 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,338 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,408 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,410 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,421 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,423 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:46:04,442 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 22:46:04,465 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:46:04,465 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:46:04,465 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:46:04,465 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:46:04,465 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:46:04,465 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:46:04,466 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:46:04,466 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:46:04,481 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-05 22:46:04,483 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-05 22:46:04,529 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-05 22:46:04,530 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:46:04,534 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-05 22:46:04,537 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-05 22:46:04,558 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-05 22:46:04,558 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:46:04,559 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-05 22:46:04,561 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1088 [2020-10-05 22:46:04,562 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:46:04,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:04,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:04,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:04,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:04,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:04,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:04,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:04,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:04,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:04,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:04,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:04,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:04,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:04,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:04,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:04,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:04,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:04,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:04,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:04,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:04,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:04,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:04,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:04,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:04,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:04,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:04,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:04,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:04,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:04,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:04,860 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-05 22:46:04,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:04,862 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-05 22:46:04,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:04,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:04,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:04,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:04,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:04,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:04,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:04,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:04,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:04,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:04,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:04,968 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-05 22:46:04,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:04,972 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-05 22:46:04,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:05,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:05,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:46:05,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:05,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:05,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:05,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:05,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,621 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-05 22:46:05,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,623 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-05 22:46:05,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:05,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:05,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:05,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:05,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-05 22:46:05,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 22:46:05,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-05 22:46:05,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 22:46:05,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:05,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:05,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:05,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:05,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:05,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:05,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:05,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:05,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:05,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,945 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-05 22:46:05,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:05,947 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-05 22:46:05,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,222 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 22:46:06,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:06,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:06,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:06,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:06,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:06,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:06,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:06,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,405 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-05 22:46:06,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,407 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-05 22:46:06,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:06,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,569 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-05 22:46:06,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,571 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-05 22:46:06,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,572 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-05 22:46:06,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,577 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-05 22:46:06,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:06,583 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-05 22:46:06,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:06,585 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-05 22:46:06,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:06,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:06,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,592 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-05 22:46:06,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,597 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-05 22:46:06,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:06,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:06,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,710 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-05 22:46:06,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,711 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-05 22:46:06,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,713 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-05 22:46:06,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,717 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-05 22:46:06,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:06,719 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-05 22:46:06,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:06,730 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-05 22:46:06,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:06,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:06,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,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-05 22:46:06,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,738 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-05 22:46:06,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-05 22:46:06,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 22:46:06,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:06,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-05 22:46:06,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:06,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-05 22:46:06,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,204 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-05 22:46:07,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,205 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-05 22:46:07,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,207 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-05 22:46:07,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,208 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-05 22:46:07,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:07,213 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, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:07,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:07,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:07,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,223 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, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,225 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, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:07,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,324 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-05 22:46:07,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,326 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-05 22:46:07,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,327 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-05 22:46:07,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,330 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-05 22:46:07,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:07,335 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-05 22:46:07,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:07,338 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-05 22:46:07,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:46:07,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:07,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,344 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-05 22:46:07,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,346 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-05 22:46:07,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:07,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:07,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:07,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:07,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:07,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,458 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-05 22:46:07,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,461 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-05 22:46:07,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:07,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:07,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:07,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:07,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:07,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:07,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:07,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:07,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,707 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-05 22:46:07,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,709 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-05 22:46:07,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:07,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:07,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:07,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:07,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:08,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:08,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:08,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:46:08,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-05 22:46:08,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 22:46:08,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-05 22:46:08,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 22:46:08,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:08,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:46:08,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:46:08,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:08,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:46:08,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:46:08,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:46:08,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:46:08,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:08,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:08,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:46:08,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:08,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:46:08,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:46:08,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:46:08,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,427 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-05 22:46:08,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:08,428 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-05 22:46:08,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:46:09,363 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-05 22:46:09,468 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2928 [2020-10-05 22:46:09,469 INFO L214 etLargeBlockEncoding]: Total number of compositions: 68 [2020-10-05 22:46:09,474 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-10-05 22:46:09,495 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 266 states. [2020-10-05 22:46:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2020-10-05 22:46:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 22:46:09,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:09,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 22:46:09,506 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:09,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:09,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-05 22:46:09,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:09,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001304358] [2020-10-05 22:46:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:09,748 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-05 22:46:09,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001304358] [2020-10-05 22:46:09,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:09,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:46:09,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702435106] [2020-10-05 22:46:09,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:46:09,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:09,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:46:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:46:09,774 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 3 states. [2020-10-05 22:46:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:09,883 INFO L93 Difference]: Finished difference Result 230 states and 564 transitions. [2020-10-05 22:46:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:46:09,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 22:46:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:09,899 INFO L225 Difference]: With dead ends: 230 [2020-10-05 22:46:09,900 INFO L226 Difference]: Without dead ends: 194 [2020-10-05 22:46:09,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:46:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-05 22:46:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-05 22:46:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-05 22:46:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 468 transitions. [2020-10-05 22:46:09,957 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 468 transitions. Word has length 5 [2020-10-05 22:46:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:09,958 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 468 transitions. [2020-10-05 22:46:09,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:46:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 468 transitions. [2020-10-05 22:46:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 22:46:09,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:09,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:09,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:46:09,960 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-05 22:46:09,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:09,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034745708] [2020-10-05 22:46:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:10,186 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-05 22:46:10,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034745708] [2020-10-05 22:46:10,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:10,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:46:10,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150853889] [2020-10-05 22:46:10,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:46:10,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:10,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:46:10,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:46:10,190 INFO L87 Difference]: Start difference. First operand 194 states and 468 transitions. Second operand 4 states. [2020-10-05 22:46:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:10,248 INFO L93 Difference]: Finished difference Result 194 states and 444 transitions. [2020-10-05 22:46:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:46:10,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-05 22:46:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:10,251 INFO L225 Difference]: With dead ends: 194 [2020-10-05 22:46:10,251 INFO L226 Difference]: Without dead ends: 158 [2020-10-05 22:46:10,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:46:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-05 22:46:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-10-05 22:46:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-05 22:46:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 366 transitions. [2020-10-05 22:46:10,267 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 366 transitions. Word has length 8 [2020-10-05 22:46:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:10,268 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 366 transitions. [2020-10-05 22:46:10,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:46:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 366 transitions. [2020-10-05 22:46:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:46:10,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:10,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:10,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:46:10,270 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1593199242, now seen corresponding path program 1 times [2020-10-05 22:46:10,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:10,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32037468] [2020-10-05 22:46:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:10,540 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-05 22:46:10,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32037468] [2020-10-05 22:46:10,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:10,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:46:10,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167241970] [2020-10-05 22:46:10,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:46:10,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:46:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:46:10,542 INFO L87 Difference]: Start difference. First operand 158 states and 366 transitions. Second operand 5 states. [2020-10-05 22:46:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:10,615 INFO L93 Difference]: Finished difference Result 164 states and 367 transitions. [2020-10-05 22:46:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:46:10,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-05 22:46:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:10,618 INFO L225 Difference]: With dead ends: 164 [2020-10-05 22:46:10,618 INFO L226 Difference]: Without dead ends: 146 [2020-10-05 22:46:10,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:46:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-10-05 22:46:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2020-10-05 22:46:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-05 22:46:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 334 transitions. [2020-10-05 22:46:10,629 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 334 transitions. Word has length 11 [2020-10-05 22:46:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:10,629 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 334 transitions. [2020-10-05 22:46:10,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:46:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 334 transitions. [2020-10-05 22:46:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:46:10,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:10,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:10,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:46:10,632 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2054367808, now seen corresponding path program 1 times [2020-10-05 22:46:10,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:10,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723259714] [2020-10-05 22:46:10,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:10,912 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-05 22:46:10,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723259714] [2020-10-05 22:46:10,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:10,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:46:10,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886476490] [2020-10-05 22:46:10,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:46:10,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:10,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:46:10,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:10,916 INFO L87 Difference]: Start difference. First operand 146 states and 334 transitions. Second operand 9 states. [2020-10-05 22:46:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:11,206 INFO L93 Difference]: Finished difference Result 184 states and 415 transitions. [2020-10-05 22:46:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:46:11,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-05 22:46:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:11,209 INFO L225 Difference]: With dead ends: 184 [2020-10-05 22:46:11,210 INFO L226 Difference]: Without dead ends: 170 [2020-10-05 22:46:11,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:46:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-05 22:46:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2020-10-05 22:46:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-05 22:46:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 376 transitions. [2020-10-05 22:46:11,238 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 376 transitions. Word has length 13 [2020-10-05 22:46:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:11,239 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 376 transitions. [2020-10-05 22:46:11,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:46:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 376 transitions. [2020-10-05 22:46:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:46:11,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:11,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:11,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:46:11,241 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash 298631844, now seen corresponding path program 2 times [2020-10-05 22:46:11,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:11,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084955303] [2020-10-05 22:46:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:11,475 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-05 22:46:11,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084955303] [2020-10-05 22:46:11,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:11,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:46:11,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115844131] [2020-10-05 22:46:11,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:46:11,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:46:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:46:11,477 INFO L87 Difference]: Start difference. First operand 164 states and 376 transitions. Second operand 8 states. [2020-10-05 22:46:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:11,796 INFO L93 Difference]: Finished difference Result 188 states and 426 transitions. [2020-10-05 22:46:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:46:11,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-05 22:46:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:11,798 INFO L225 Difference]: With dead ends: 188 [2020-10-05 22:46:11,798 INFO L226 Difference]: Without dead ends: 176 [2020-10-05 22:46:11,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:46:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-05 22:46:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2020-10-05 22:46:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-05 22:46:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 392 transitions. [2020-10-05 22:46:11,807 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 392 transitions. Word has length 13 [2020-10-05 22:46:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:11,807 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 392 transitions. [2020-10-05 22:46:11,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:46:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 392 transitions. [2020-10-05 22:46:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:46:11,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:11,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:11,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:46:11,810 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:11,810 INFO L82 PathProgramCache]: Analyzing trace with hash -102986176, now seen corresponding path program 3 times [2020-10-05 22:46:11,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:11,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704433332] [2020-10-05 22:46:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:12,068 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-05 22:46:12,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704433332] [2020-10-05 22:46:12,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:12,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:46:12,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304607085] [2020-10-05 22:46:12,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:46:12,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:46:12,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:46:12,071 INFO L87 Difference]: Start difference. First operand 170 states and 392 transitions. Second operand 8 states. [2020-10-05 22:46:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:12,383 INFO L93 Difference]: Finished difference Result 221 states and 507 transitions. [2020-10-05 22:46:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:46:12,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-05 22:46:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:12,386 INFO L225 Difference]: With dead ends: 221 [2020-10-05 22:46:12,386 INFO L226 Difference]: Without dead ends: 209 [2020-10-05 22:46:12,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:46:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-05 22:46:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 188. [2020-10-05 22:46:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-05 22:46:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 440 transitions. [2020-10-05 22:46:12,394 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 440 transitions. Word has length 13 [2020-10-05 22:46:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:12,394 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 440 transitions. [2020-10-05 22:46:12,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:46:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 440 transitions. [2020-10-05 22:46:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:46:12,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:12,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:12,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:46:12,397 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1954183132, now seen corresponding path program 4 times [2020-10-05 22:46:12,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:12,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028186179] [2020-10-05 22:46:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:12,585 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-05 22:46:12,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028186179] [2020-10-05 22:46:12,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:12,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:46:12,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967269982] [2020-10-05 22:46:12,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:46:12,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:12,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:46:12,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:46:12,588 INFO L87 Difference]: Start difference. First operand 188 states and 440 transitions. Second operand 8 states. [2020-10-05 22:46:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:12,947 INFO L93 Difference]: Finished difference Result 225 states and 518 transitions. [2020-10-05 22:46:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:46:12,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-05 22:46:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:12,950 INFO L225 Difference]: With dead ends: 225 [2020-10-05 22:46:12,950 INFO L226 Difference]: Without dead ends: 210 [2020-10-05 22:46:12,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:46:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-05 22:46:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 183. [2020-10-05 22:46:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-05 22:46:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 423 transitions. [2020-10-05 22:46:12,961 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 423 transitions. Word has length 13 [2020-10-05 22:46:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:12,961 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 423 transitions. [2020-10-05 22:46:12,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:46:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 423 transitions. [2020-10-05 22:46:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:46:12,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:12,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:12,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:46:12,969 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash -740690617, now seen corresponding path program 1 times [2020-10-05 22:46:12,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:12,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221000146] [2020-10-05 22:46:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:13,257 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-05 22:46:13,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221000146] [2020-10-05 22:46:13,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:13,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:46:13,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277279175] [2020-10-05 22:46:13,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:46:13,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:46:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:13,260 INFO L87 Difference]: Start difference. First operand 183 states and 423 transitions. Second operand 9 states. [2020-10-05 22:46:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:13,874 INFO L93 Difference]: Finished difference Result 346 states and 726 transitions. [2020-10-05 22:46:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-05 22:46:13,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-05 22:46:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:13,881 INFO L225 Difference]: With dead ends: 346 [2020-10-05 22:46:13,881 INFO L226 Difference]: Without dead ends: 266 [2020-10-05 22:46:13,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-10-05 22:46:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-10-05 22:46:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 188. [2020-10-05 22:46:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-05 22:46:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 403 transitions. [2020-10-05 22:46:13,891 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 403 transitions. Word has length 14 [2020-10-05 22:46:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:13,891 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 403 transitions. [2020-10-05 22:46:13,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:46:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 403 transitions. [2020-10-05 22:46:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:46:13,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:13,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:13,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:46:13,892 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash -740958736, now seen corresponding path program 1 times [2020-10-05 22:46:13,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:13,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65459715] [2020-10-05 22:46:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:14,308 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-05 22:46:14,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65459715] [2020-10-05 22:46:14,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:14,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:46:14,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327495401] [2020-10-05 22:46:14,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:46:14,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:46:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:14,310 INFO L87 Difference]: Start difference. First operand 188 states and 403 transitions. Second operand 9 states. [2020-10-05 22:46:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:14,884 INFO L93 Difference]: Finished difference Result 284 states and 597 transitions. [2020-10-05 22:46:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 22:46:14,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-05 22:46:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:14,887 INFO L225 Difference]: With dead ends: 284 [2020-10-05 22:46:14,888 INFO L226 Difference]: Without dead ends: 237 [2020-10-05 22:46:14,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2020-10-05 22:46:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-10-05 22:46:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 143. [2020-10-05 22:46:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-10-05 22:46:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 303 transitions. [2020-10-05 22:46:14,894 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 303 transitions. Word has length 14 [2020-10-05 22:46:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:14,894 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 303 transitions. [2020-10-05 22:46:14,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:46:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 303 transitions. [2020-10-05 22:46:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:46:14,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:14,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:14,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:46:14,896 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -605016637, now seen corresponding path program 2 times [2020-10-05 22:46:14,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:14,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998817368] [2020-10-05 22:46:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:15,001 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-05 22:46:15,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998817368] [2020-10-05 22:46:15,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:15,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:46:15,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047741215] [2020-10-05 22:46:15,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:46:15,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:15,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:46:15,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:46:15,003 INFO L87 Difference]: Start difference. First operand 143 states and 303 transitions. Second operand 5 states. [2020-10-05 22:46:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:15,126 INFO L93 Difference]: Finished difference Result 217 states and 452 transitions. [2020-10-05 22:46:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:46:15,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 22:46:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:15,132 INFO L225 Difference]: With dead ends: 217 [2020-10-05 22:46:15,132 INFO L226 Difference]: Without dead ends: 130 [2020-10-05 22:46:15,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:46:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-05 22:46:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-05 22:46:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-05 22:46:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 258 transitions. [2020-10-05 22:46:15,136 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 258 transitions. Word has length 14 [2020-10-05 22:46:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:15,137 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 258 transitions. [2020-10-05 22:46:15,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:46:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 258 transitions. [2020-10-05 22:46:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:46:15,138 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:15,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:15,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:46:15,138 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash 587547211, now seen corresponding path program 3 times [2020-10-05 22:46:15,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:15,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893747061] [2020-10-05 22:46:15,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:15,516 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-05 22:46:15,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893747061] [2020-10-05 22:46:15,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:15,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:46:15,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752871179] [2020-10-05 22:46:15,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:46:15,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:46:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:46:15,519 INFO L87 Difference]: Start difference. First operand 130 states and 258 transitions. Second operand 10 states. [2020-10-05 22:46:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:16,013 INFO L93 Difference]: Finished difference Result 187 states and 367 transitions. [2020-10-05 22:46:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 22:46:16,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-10-05 22:46:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:16,015 INFO L225 Difference]: With dead ends: 187 [2020-10-05 22:46:16,016 INFO L226 Difference]: Without dead ends: 158 [2020-10-05 22:46:16,016 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-10-05 22:46:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-05 22:46:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2020-10-05 22:46:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-05 22:46:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 249 transitions. [2020-10-05 22:46:16,021 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 249 transitions. Word has length 14 [2020-10-05 22:46:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:16,022 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 249 transitions. [2020-10-05 22:46:16,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:46:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 249 transitions. [2020-10-05 22:46:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:46:16,022 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:16,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:16,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:46:16,023 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1295116191, now seen corresponding path program 4 times [2020-10-05 22:46:16,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:16,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476806092] [2020-10-05 22:46:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:16,161 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-05 22:46:16,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476806092] [2020-10-05 22:46:16,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:16,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:46:16,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641752985] [2020-10-05 22:46:16,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:46:16,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:46:16,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:46:16,164 INFO L87 Difference]: Start difference. First operand 125 states and 249 transitions. Second operand 8 states. [2020-10-05 22:46:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:16,495 INFO L93 Difference]: Finished difference Result 160 states and 311 transitions. [2020-10-05 22:46:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:46:16,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-05 22:46:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:16,497 INFO L225 Difference]: With dead ends: 160 [2020-10-05 22:46:16,498 INFO L226 Difference]: Without dead ends: 142 [2020-10-05 22:46:16,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:46:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-05 22:46:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 120. [2020-10-05 22:46:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-05 22:46:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 237 transitions. [2020-10-05 22:46:16,503 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 237 transitions. Word has length 14 [2020-10-05 22:46:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:16,503 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 237 transitions. [2020-10-05 22:46:16,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:46:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 237 transitions. [2020-10-05 22:46:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:46:16,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:16,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:16,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:46:16,505 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:16,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1060903253, now seen corresponding path program 1 times [2020-10-05 22:46:16,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:16,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382782142] [2020-10-05 22:46:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:16,753 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-05 22:46:16,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382782142] [2020-10-05 22:46:16,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:16,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:46:16,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132494947] [2020-10-05 22:46:16,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:46:16,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:46:16,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:16,755 INFO L87 Difference]: Start difference. First operand 120 states and 237 transitions. Second operand 9 states. [2020-10-05 22:46:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:16,972 INFO L93 Difference]: Finished difference Result 153 states and 296 transitions. [2020-10-05 22:46:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:46:16,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 22:46:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:16,974 INFO L225 Difference]: With dead ends: 153 [2020-10-05 22:46:16,974 INFO L226 Difference]: Without dead ends: 122 [2020-10-05 22:46:16,974 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:46:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-05 22:46:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2020-10-05 22:46:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-05 22:46:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 239 transitions. [2020-10-05 22:46:16,979 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 239 transitions. Word has length 15 [2020-10-05 22:46:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:16,979 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 239 transitions. [2020-10-05 22:46:16,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:46:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 239 transitions. [2020-10-05 22:46:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:46:16,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:16,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:16,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:46:16,981 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1033857493, now seen corresponding path program 1 times [2020-10-05 22:46:16,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:16,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279208347] [2020-10-05 22:46:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:17,533 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-05 22:46:17,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279208347] [2020-10-05 22:46:17,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:17,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:46:17,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150184658] [2020-10-05 22:46:17,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:46:17,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:46:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:46:17,536 INFO L87 Difference]: Start difference. First operand 120 states and 239 transitions. Second operand 10 states. [2020-10-05 22:46:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:17,867 INFO L93 Difference]: Finished difference Result 139 states and 269 transitions. [2020-10-05 22:46:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:46:17,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-05 22:46:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:17,869 INFO L225 Difference]: With dead ends: 139 [2020-10-05 22:46:17,869 INFO L226 Difference]: Without dead ends: 114 [2020-10-05 22:46:17,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:46:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-05 22:46:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2020-10-05 22:46:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-05 22:46:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 209 transitions. [2020-10-05 22:46:17,874 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 209 transitions. Word has length 15 [2020-10-05 22:46:17,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:17,875 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 209 transitions. [2020-10-05 22:46:17,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:46:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 209 transitions. [2020-10-05 22:46:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:46:17,875 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:17,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:17,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:46:17,876 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash 40955563, now seen corresponding path program 2 times [2020-10-05 22:46:17,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:17,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242502958] [2020-10-05 22:46:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:18,085 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-05 22:46:18,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242502958] [2020-10-05 22:46:18,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:18,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:46:18,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945411295] [2020-10-05 22:46:18,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:46:18,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:46:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:46:18,088 INFO L87 Difference]: Start difference. First operand 102 states and 209 transitions. Second operand 7 states. [2020-10-05 22:46:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:18,313 INFO L93 Difference]: Finished difference Result 128 states and 252 transitions. [2020-10-05 22:46:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:46:18,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 22:46:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:18,315 INFO L225 Difference]: With dead ends: 128 [2020-10-05 22:46:18,315 INFO L226 Difference]: Without dead ends: 70 [2020-10-05 22:46:18,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-05 22:46:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-05 22:46:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-05 22:46:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 131 transitions. [2020-10-05 22:46:18,319 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 131 transitions. Word has length 15 [2020-10-05 22:46:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:18,319 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 131 transitions. [2020-10-05 22:46:18,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:46:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 131 transitions. [2020-10-05 22:46:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:46:18,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:18,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:18,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 22:46:18,321 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1653042673, now seen corresponding path program 3 times [2020-10-05 22:46:18,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:18,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244677182] [2020-10-05 22:46:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:18,649 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-05 22:46:18,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244677182] [2020-10-05 22:46:18,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:18,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:46:18,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193014616] [2020-10-05 22:46:18,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:46:18,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:46:18,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:18,651 INFO L87 Difference]: Start difference. First operand 70 states and 131 transitions. Second operand 9 states. [2020-10-05 22:46:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:18,924 INFO L93 Difference]: Finished difference Result 89 states and 165 transitions. [2020-10-05 22:46:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:46:18,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 22:46:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:18,926 INFO L225 Difference]: With dead ends: 89 [2020-10-05 22:46:18,926 INFO L226 Difference]: Without dead ends: 72 [2020-10-05 22:46:18,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:46:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-05 22:46:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-10-05 22:46:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-05 22:46:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 132 transitions. [2020-10-05 22:46:18,930 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 132 transitions. Word has length 15 [2020-10-05 22:46:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:18,930 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 132 transitions. [2020-10-05 22:46:18,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:46:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 132 transitions. [2020-10-05 22:46:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:46:18,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:18,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:18,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 22:46:18,931 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:18,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1510958203, now seen corresponding path program 4 times [2020-10-05 22:46:18,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:18,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328014150] [2020-10-05 22:46:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:19,111 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-05 22:46:19,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328014150] [2020-10-05 22:46:19,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:19,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:46:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622362699] [2020-10-05 22:46:19,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:46:19,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:46:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:46:19,113 INFO L87 Difference]: Start difference. First operand 71 states and 132 transitions. Second operand 8 states. [2020-10-05 22:46:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:19,343 INFO L93 Difference]: Finished difference Result 96 states and 175 transitions. [2020-10-05 22:46:19,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:46:19,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-05 22:46:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:19,345 INFO L225 Difference]: With dead ends: 96 [2020-10-05 22:46:19,345 INFO L226 Difference]: Without dead ends: 71 [2020-10-05 22:46:19,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-05 22:46:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-10-05 22:46:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-05 22:46:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 118 transitions. [2020-10-05 22:46:19,351 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 118 transitions. Word has length 15 [2020-10-05 22:46:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:19,352 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 118 transitions. [2020-10-05 22:46:19,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:46:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 118 transitions. [2020-10-05 22:46:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:46:19,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:19,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:19,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 22:46:19,353 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 65265109, now seen corresponding path program 5 times [2020-10-05 22:46:19,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:19,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388306786] [2020-10-05 22:46:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:19,483 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-05 22:46:19,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388306786] [2020-10-05 22:46:19,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:19,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:46:19,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677915062] [2020-10-05 22:46:19,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:46:19,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:19,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:46:19,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:46:19,489 INFO L87 Difference]: Start difference. First operand 65 states and 118 transitions. Second operand 6 states. [2020-10-05 22:46:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:19,638 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2020-10-05 22:46:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:46:19,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-05 22:46:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:19,639 INFO L225 Difference]: With dead ends: 73 [2020-10-05 22:46:19,639 INFO L226 Difference]: Without dead ends: 45 [2020-10-05 22:46:19,640 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:46:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-05 22:46:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-05 22:46:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-05 22:46:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2020-10-05 22:46:19,644 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 15 [2020-10-05 22:46:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:19,644 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2020-10-05 22:46:19,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:46:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2020-10-05 22:46:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:46:19,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:46:19,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:46:19,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 22:46:19,645 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:46:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:46:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -285431053, now seen corresponding path program 1 times [2020-10-05 22:46:19,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:46:19,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864519722] [2020-10-05 22:46:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:46:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:46:19,850 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-05 22:46:19,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864519722] [2020-10-05 22:46:19,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:46:19,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:46:19,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331605990] [2020-10-05 22:46:19,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:46:19,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:46:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:46:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:46:19,852 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand 9 states. [2020-10-05 22:46:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:46:20,241 INFO L93 Difference]: Finished difference Result 41 states and 69 transitions. [2020-10-05 22:46:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:46:20,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 22:46:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:46:20,242 INFO L225 Difference]: With dead ends: 41 [2020-10-05 22:46:20,242 INFO L226 Difference]: Without dead ends: 0 [2020-10-05 22:46:20,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-05 22:46:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-05 22:46:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-05 22:46:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-05 22:46:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-05 22:46:20,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-10-05 22:46:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:46:20,243 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-05 22:46:20,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:46:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-05 22:46:20,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-05 22:46:20,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 22:46:20,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:46:20 BasicIcfg [2020-10-05 22:46:20,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:46:20,250 INFO L168 Benchmark]: Toolchain (without parser) took 20551.15 ms. Allocated memory was 139.5 MB in the beginning and 583.5 MB in the end (delta: 444.1 MB). Free memory was 101.0 MB in the beginning and 531.7 MB in the end (delta: -430.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:46:20,250 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 22:46:20,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.46 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 154.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:46:20,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.10 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:46:20,252 INFO L168 Benchmark]: Boogie Preprocessor took 90.65 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 147.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:46:20,253 INFO L168 Benchmark]: RCFGBuilder took 3570.77 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 147.7 MB in the beginning and 97.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:46:20,254 INFO L168 Benchmark]: TraceAbstraction took 15976.27 ms. Allocated memory was 249.6 MB in the beginning and 583.5 MB in the end (delta: 334.0 MB). Free memory was 97.9 MB in the beginning and 531.7 MB in the end (delta: -433.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-05 22:46:20,257 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.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.46 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 154.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.10 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.65 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 147.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3570.77 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 147.7 MB in the beginning and 97.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15976.27 ms. Allocated memory was 249.6 MB in the beginning and 583.5 MB in the end (delta: 334.0 MB). Free memory was 97.9 MB in the beginning and 531.7 MB in the end (delta: -433.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 85 ProgramPointsBefore, 29 ProgramPointsAfterwards, 80 TransitionsBefore, 23 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 548 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 2928 CheckedPairsTotal, 68 TotalNumberOfCompositions - 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. VerificationResult: SAFE, OverallTime: 15.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 385 SDtfs, 571 SDslu, 1033 SDs, 0 SdLazy, 1313 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 308 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 39408 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...