/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:57:38,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:57:38,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:57:38,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:57:38,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:57:38,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:57:38,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:57:38,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:57:38,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:57:38,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:57:38,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:57:38,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:57:38,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:57:38,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:57:38,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:57:38,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:57:38,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:57:38,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:57:38,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:57:38,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:57:38,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:57:38,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:57:38,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:57:38,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:57:38,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:57:38,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:57:38,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:57:38,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:57:38,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:57:38,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:57:38,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:57:38,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:57:38,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:57:38,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:57:38,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:57:38,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:57:38,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:57:38,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:57:38,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:57:38,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:57:38,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:57:38,524 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-11 14:57:38,564 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:57:38,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:57:38,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:57:38,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:57:38,566 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:57:38,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:57:38,567 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:57:38,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:57:38,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:57:38,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:57:38,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:57:38,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:57:38,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:57:38,569 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:57:38,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:57:38,569 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:57:38,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:57:38,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:57:38,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:57:38,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:57:38,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:57:38,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:57:38,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:57:38,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:57:38,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:57:38,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:57:38,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:57:38,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:57:38,572 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:57:38,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:57:38,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:57:38,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:57:38,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:57:38,907 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:57:38,908 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:57:38,908 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-11 14:57:38,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acbf1d05/46b55615ab424945beb5779b621db328/FLAG13ac82fe2 [2020-10-11 14:57:39,538 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:57:39,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-11 14:57:39,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acbf1d05/46b55615ab424945beb5779b621db328/FLAG13ac82fe2 [2020-10-11 14:57:39,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acbf1d05/46b55615ab424945beb5779b621db328 [2020-10-11 14:57:39,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:57:39,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:57:39,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:57:39,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:57:39,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:57:39,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:39" (1/1) ... [2020-10-11 14:57:39,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12692ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:39, skipping insertion in model container [2020-10-11 14:57:39,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:39" (1/1) ... [2020-10-11 14:57:39,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:57:39,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:57:40,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:57:40,327 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:57:40,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:57:40,535 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:57:40,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40 WrapperNode [2020-10-11 14:57:40,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:57:40,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:57:40,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:57:40,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:57:40,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:57:40,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:57:40,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:57:40,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:57:40,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... [2020-10-11 14:57:40,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:57:40,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:57:40,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:57:40,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:57:40,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:57:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:57:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:57:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:57:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:57:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:57:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:57:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:57:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:57:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:57:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:57:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:57:40,767 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 14:57:44,407 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:57:44,408 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:57:44,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:44 BoogieIcfgContainer [2020-10-11 14:57:44,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:57:44,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:57:44,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:57:44,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:57:44,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:57:39" (1/3) ... [2020-10-11 14:57:44,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416534ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:44, skipping insertion in model container [2020-10-11 14:57:44,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:40" (2/3) ... [2020-10-11 14:57:44,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416534ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:44, skipping insertion in model container [2020-10-11 14:57:44,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:44" (3/3) ... [2020-10-11 14:57:44,421 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2020-10-11 14:57:44,439 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:57:44,439 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:57:44,452 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:57:44,453 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:57:44,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,552 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,555 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,558 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:44,579 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 14:57:44,611 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:57:44,611 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:57:44,611 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:57:44,611 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:57:44,612 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:57:44,612 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:57:44,612 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:57:44,612 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:57:44,629 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:57:44,633 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-11 14:57:44,637 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-11 14:57:44,640 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-11 14:57:44,684 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-11 14:57:44,684 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:57:44,689 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-11 14:57:44,692 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-11 14:57:44,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:44,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:44,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:44,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:44,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:44,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:44,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:44,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:44,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:44,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:44,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:44,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:44,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:44,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:44,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:44,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:44,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:44,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:44,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:44,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:44,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:44,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:44,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:44,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:44,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:44,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:44,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:44,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:44,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:44,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:44,969 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-11 14:57:44,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:44,978 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-11 14:57:44,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:45,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:45,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:45,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:45,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,090 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-11 14:57:45,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,094 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-11 14:57:45,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:45,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:45,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:57:45,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:45,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:45,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:45,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:45,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,660 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-11 14:57:45,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,662 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-11 14:57:45,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:45,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:45,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:45,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:45,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:45,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:45,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:45,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:45,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:45,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:45,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:45,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:45,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:46,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:46,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:46,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:46,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:46,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:46,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,083 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-11 14:57:46,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,085 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-11 14:57:46,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,372 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-11 14:57:46,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:46,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:46,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:46,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:46,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:46,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:46,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,562 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-11 14:57:46,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,564 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-11 14:57:46,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,681 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-11 14:57:46,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,683 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-11 14:57:46,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,685 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-11 14:57:46,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,688 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-11 14:57:46,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:46,690 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-11 14:57:46,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:46,692 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-11 14:57:46,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:46,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:46,699 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-11 14:57:46,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:46,701 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-11 14:57:46,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:46,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:46,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,803 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-11 14:57:46,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,805 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-11 14:57:46,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,807 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-11 14:57:46,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,808 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-11 14:57:46,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:46,810 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-11 14:57:46,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:46,812 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-11 14:57:46,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:46,815 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-11 14:57:46,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:46,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:46,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:46,857 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-11 14:57:46,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:46,859 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-11 14:57:46,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:47,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:47,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:47,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-11 14:57:47,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,255 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-11 14:57:47,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,257 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-11 14:57:47,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,258 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-11 14:57:47,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,261 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-11 14:57:47,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:47,263 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-11 14:57:47,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:47,265 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-11 14:57:47,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:47,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:47,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,271 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-11 14:57:47,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:47,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,357 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-11 14:57:47,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,359 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-11 14:57:47,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,360 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-11 14:57:47,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,363 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-11 14:57:47,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:47,365 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-11 14:57:47,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:47,367 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-11 14:57:47,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:47,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:47,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,373 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-11 14:57:47,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,374 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-11 14:57:47,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:47,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:47,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:47,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:47,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:47,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,435 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-11 14:57:47,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,436 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-11 14:57:47,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:47,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:47,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:47,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:47,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:47,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:47,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:47,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:47,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,629 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-11 14:57:47,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,631 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-11 14:57:47,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:47,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:47,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:47,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:47,820 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 14:57:47,947 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 14:57:48,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:48,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:48,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:48,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:57:48,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:48,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:48,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:48,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:48,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:48,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:48,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:48,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:48,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:48,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:48,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:48,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:48,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:48,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:48,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:48,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:48,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:48,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:48,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:48,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:48,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:48,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:48,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:48,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:48,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:48,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:48,384 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-11 14:57:48,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:48,385 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-11 14:57:48,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:49,122 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-11 14:57:49,226 INFO L132 LiptonReduction]: Checked pairs total: 3006 [2020-10-11 14:57:49,227 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-11 14:57:49,234 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-10-11 14:57:49,256 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 266 states. [2020-10-11 14:57:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2020-10-11 14:57:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-11 14:57:49,265 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:49,266 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-11 14:57:49,266 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-11 14:57:49,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:49,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825714553] [2020-10-11 14:57:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:49,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825714553] [2020-10-11 14:57:49,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:49,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:57:49,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491476712] [2020-10-11 14:57:49,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:57:49,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:57:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:57:49,532 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 3 states. [2020-10-11 14:57:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:49,642 INFO L93 Difference]: Finished difference Result 230 states and 564 transitions. [2020-10-11 14:57:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:57:49,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-11 14:57:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:49,658 INFO L225 Difference]: With dead ends: 230 [2020-10-11 14:57:49,658 INFO L226 Difference]: Without dead ends: 194 [2020-10-11 14:57:49,660 INFO L673 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-11 14:57:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-11 14:57:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-11 14:57:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-11 14:57:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 468 transitions. [2020-10-11 14:57:49,722 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 468 transitions. Word has length 5 [2020-10-11 14:57:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:49,723 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 468 transitions. [2020-10-11 14:57:49,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:57:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 468 transitions. [2020-10-11 14:57:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-11 14:57:49,724 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:49,724 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:49,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:57:49,725 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-11 14:57:49,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:49,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400901604] [2020-10-11 14:57:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:49,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400901604] [2020-10-11 14:57:49,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:49,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:57:49,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611345925] [2020-10-11 14:57:49,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:57:49,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:49,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:57:49,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:57:49,903 INFO L87 Difference]: Start difference. First operand 194 states and 468 transitions. Second operand 4 states. [2020-10-11 14:57:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:49,947 INFO L93 Difference]: Finished difference Result 206 states and 472 transitions. [2020-10-11 14:57:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:57:49,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-11 14:57:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:49,950 INFO L225 Difference]: With dead ends: 206 [2020-10-11 14:57:49,950 INFO L226 Difference]: Without dead ends: 170 [2020-10-11 14:57:49,951 INFO L673 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-11 14:57:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-11 14:57:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2020-10-11 14:57:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-11 14:57:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 400 transitions. [2020-10-11 14:57:49,966 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 400 transitions. Word has length 8 [2020-10-11 14:57:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:49,966 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 400 transitions. [2020-10-11 14:57:49,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:57:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 400 transitions. [2020-10-11 14:57:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-11 14:57:49,968 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:49,968 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:49,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:57:49,968 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash -508660431, now seen corresponding path program 1 times [2020-10-11 14:57:49,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:49,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651869390] [2020-10-11 14:57:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:50,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651869390] [2020-10-11 14:57:50,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:50,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:57:50,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301515772] [2020-10-11 14:57:50,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:57:50,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:57:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:57:50,129 INFO L87 Difference]: Start difference. First operand 170 states and 400 transitions. Second operand 5 states. [2020-10-11 14:57:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:50,235 INFO L93 Difference]: Finished difference Result 170 states and 384 transitions. [2020-10-11 14:57:50,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:57:50,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-11 14:57:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:50,237 INFO L225 Difference]: With dead ends: 170 [2020-10-11 14:57:50,237 INFO L226 Difference]: Without dead ends: 146 [2020-10-11 14:57:50,238 INFO L673 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-11 14:57:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-10-11 14:57:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2020-10-11 14:57:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-11 14:57:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 334 transitions. [2020-10-11 14:57:50,248 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 334 transitions. Word has length 10 [2020-10-11 14:57:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:50,248 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 334 transitions. [2020-10-11 14:57:50,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:57:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 334 transitions. [2020-10-11 14:57:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:57:50,250 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:50,250 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:50,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:57:50,251 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:50,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2054367808, now seen corresponding path program 1 times [2020-10-11 14:57:50,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:50,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098582717] [2020-10-11 14:57:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:50,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098582717] [2020-10-11 14:57:50,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:50,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:57:50,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939968714] [2020-10-11 14:57:50,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:57:50,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:57:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:50,582 INFO L87 Difference]: Start difference. First operand 146 states and 334 transitions. Second operand 9 states. [2020-10-11 14:57:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:50,973 INFO L93 Difference]: Finished difference Result 191 states and 434 transitions. [2020-10-11 14:57:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 14:57:50,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-11 14:57:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:50,977 INFO L225 Difference]: With dead ends: 191 [2020-10-11 14:57:50,977 INFO L226 Difference]: Without dead ends: 176 [2020-10-11 14:57:50,978 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-10-11 14:57:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-11 14:57:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2020-10-11 14:57:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-11 14:57:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 392 transitions. [2020-10-11 14:57:50,988 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 392 transitions. Word has length 13 [2020-10-11 14:57:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:50,989 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 392 transitions. [2020-10-11 14:57:50,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:57:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 392 transitions. [2020-10-11 14:57:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:57:50,991 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:50,991 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:50,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:57:50,991 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash -102986176, now seen corresponding path program 2 times [2020-10-11 14:57:50,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:50,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569667919] [2020-10-11 14:57:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:51,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569667919] [2020-10-11 14:57:51,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:51,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:57:51,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104211632] [2020-10-11 14:57:51,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:57:51,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:57:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:51,381 INFO L87 Difference]: Start difference. First operand 170 states and 392 transitions. Second operand 9 states. [2020-10-11 14:57:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:51,756 INFO L93 Difference]: Finished difference Result 212 states and 486 transitions. [2020-10-11 14:57:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 14:57:51,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-11 14:57:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:51,759 INFO L225 Difference]: With dead ends: 212 [2020-10-11 14:57:51,760 INFO L226 Difference]: Without dead ends: 200 [2020-10-11 14:57:51,760 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-11 14:57:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-10-11 14:57:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2020-10-11 14:57:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-11 14:57:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 440 transitions. [2020-10-11 14:57:51,769 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 440 transitions. Word has length 13 [2020-10-11 14:57:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:51,770 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 440 transitions. [2020-10-11 14:57:51,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:57:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 440 transitions. [2020-10-11 14:57:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:57:51,772 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:51,772 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:51,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:57:51,772 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1954183132, now seen corresponding path program 3 times [2020-10-11 14:57:51,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:51,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615140092] [2020-10-11 14:57:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:52,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615140092] [2020-10-11 14:57:52,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:52,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:57:52,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481437202] [2020-10-11 14:57:52,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:57:52,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:57:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:57:52,026 INFO L87 Difference]: Start difference. First operand 188 states and 440 transitions. Second operand 8 states. [2020-10-11 14:57:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:52,415 INFO L93 Difference]: Finished difference Result 284 states and 636 transitions. [2020-10-11 14:57:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:57:52,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-11 14:57:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:52,417 INFO L225 Difference]: With dead ends: 284 [2020-10-11 14:57:52,417 INFO L226 Difference]: Without dead ends: 188 [2020-10-11 14:57:52,418 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-11 14:57:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-10-11 14:57:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 131. [2020-10-11 14:57:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-11 14:57:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 291 transitions. [2020-10-11 14:57:52,427 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 291 transitions. Word has length 13 [2020-10-11 14:57:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:52,427 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 291 transitions. [2020-10-11 14:57:52,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:57:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 291 transitions. [2020-10-11 14:57:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:57:52,430 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:52,430 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:52,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:57:52,431 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:52,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:52,431 INFO L82 PathProgramCache]: Analyzing trace with hash -740690617, now seen corresponding path program 1 times [2020-10-11 14:57:52,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:52,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357496333] [2020-10-11 14:57:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:52,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357496333] [2020-10-11 14:57:52,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:52,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:57:52,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140198934] [2020-10-11 14:57:52,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:57:52,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:57:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:57:52,572 INFO L87 Difference]: Start difference. First operand 131 states and 291 transitions. Second operand 5 states. [2020-10-11 14:57:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:52,706 INFO L93 Difference]: Finished difference Result 209 states and 460 transitions. [2020-10-11 14:57:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:57:52,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-11 14:57:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:52,708 INFO L225 Difference]: With dead ends: 209 [2020-10-11 14:57:52,708 INFO L226 Difference]: Without dead ends: 149 [2020-10-11 14:57:52,708 INFO L673 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-11 14:57:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-11 14:57:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2020-10-11 14:57:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-10-11 14:57:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 321 transitions. [2020-10-11 14:57:52,713 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 321 transitions. Word has length 14 [2020-10-11 14:57:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:52,714 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 321 transitions. [2020-10-11 14:57:52,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:57:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 321 transitions. [2020-10-11 14:57:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:57:52,715 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:52,715 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:52,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:57:52,715 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash -739076137, now seen corresponding path program 2 times [2020-10-11 14:57:52,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:52,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877803764] [2020-10-11 14:57:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:52,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877803764] [2020-10-11 14:57:52,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:52,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:57:52,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202793646] [2020-10-11 14:57:52,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:57:52,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:57:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:57:52,905 INFO L87 Difference]: Start difference. First operand 149 states and 321 transitions. Second operand 6 states. [2020-10-11 14:57:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:53,084 INFO L93 Difference]: Finished difference Result 165 states and 347 transitions. [2020-10-11 14:57:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:57:53,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-11 14:57:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:53,086 INFO L225 Difference]: With dead ends: 165 [2020-10-11 14:57:53,086 INFO L226 Difference]: Without dead ends: 154 [2020-10-11 14:57:53,087 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-11 14:57:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2020-10-11 14:57:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-11 14:57:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 315 transitions. [2020-10-11 14:57:53,092 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 315 transitions. Word has length 14 [2020-10-11 14:57:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:53,092 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 315 transitions. [2020-10-11 14:57:53,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:57:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 315 transitions. [2020-10-11 14:57:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:53,093 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:53,093 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:53,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:57:53,094 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:53,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1436491551, now seen corresponding path program 1 times [2020-10-11 14:57:53,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:53,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347000059] [2020-10-11 14:57:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:53,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347000059] [2020-10-11 14:57:53,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:53,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:57:53,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498429084] [2020-10-11 14:57:53,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:57:53,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:57:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:57:53,289 INFO L87 Difference]: Start difference. First operand 147 states and 315 transitions. Second operand 8 states. [2020-10-11 14:57:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:53,605 INFO L93 Difference]: Finished difference Result 199 states and 413 transitions. [2020-10-11 14:57:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 14:57:53,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-11 14:57:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:53,608 INFO L225 Difference]: With dead ends: 199 [2020-10-11 14:57:53,608 INFO L226 Difference]: Without dead ends: 159 [2020-10-11 14:57:53,609 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-11 14:57:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-10-11 14:57:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2020-10-11 14:57:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-11 14:57:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 314 transitions. [2020-10-11 14:57:53,614 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 314 transitions. Word has length 15 [2020-10-11 14:57:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:53,614 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 314 transitions. [2020-10-11 14:57:53,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:57:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 314 transitions. [2020-10-11 14:57:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:53,615 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:53,615 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:53,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:57:53,615 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -828240157, now seen corresponding path program 2 times [2020-10-11 14:57:53,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:53,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139727914] [2020-10-11 14:57:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:54,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139727914] [2020-10-11 14:57:54,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:54,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 14:57:54,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465839320] [2020-10-11 14:57:54,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 14:57:54,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 14:57:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-11 14:57:54,044 INFO L87 Difference]: Start difference. First operand 147 states and 314 transitions. Second operand 11 states. [2020-10-11 14:57:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:54,694 INFO L93 Difference]: Finished difference Result 193 states and 402 transitions. [2020-10-11 14:57:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 14:57:54,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2020-10-11 14:57:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:54,696 INFO L225 Difference]: With dead ends: 193 [2020-10-11 14:57:54,696 INFO L226 Difference]: Without dead ends: 157 [2020-10-11 14:57:54,696 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-10-11 14:57:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-11 14:57:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2020-10-11 14:57:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-11 14:57:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 337 transitions. [2020-10-11 14:57:54,700 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 337 transitions. Word has length 15 [2020-10-11 14:57:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:54,701 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 337 transitions. [2020-10-11 14:57:54,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 14:57:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 337 transitions. [2020-10-11 14:57:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:54,701 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:54,701 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:54,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 14:57:54,702 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash -828538067, now seen corresponding path program 1 times [2020-10-11 14:57:54,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:54,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230552446] [2020-10-11 14:57:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:55,071 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2020-10-11 14:57:55,230 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2020-10-11 14:57:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:55,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230552446] [2020-10-11 14:57:55,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:55,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:57:55,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396937079] [2020-10-11 14:57:55,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:57:55,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:57:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:57:55,365 INFO L87 Difference]: Start difference. First operand 156 states and 337 transitions. Second operand 10 states. [2020-10-11 14:57:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:55,780 INFO L93 Difference]: Finished difference Result 180 states and 378 transitions. [2020-10-11 14:57:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 14:57:55,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-11 14:57:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:55,782 INFO L225 Difference]: With dead ends: 180 [2020-10-11 14:57:55,783 INFO L226 Difference]: Without dead ends: 174 [2020-10-11 14:57:55,783 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-11 14:57:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-11 14:57:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2020-10-11 14:57:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-11 14:57:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 329 transitions. [2020-10-11 14:57:55,789 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 329 transitions. Word has length 15 [2020-10-11 14:57:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:55,789 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 329 transitions. [2020-10-11 14:57:55,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:57:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 329 transitions. [2020-10-11 14:57:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:55,790 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:55,790 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:55,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 14:57:55,791 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash -826664117, now seen corresponding path program 2 times [2020-10-11 14:57:55,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:55,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907792328] [2020-10-11 14:57:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:56,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907792328] [2020-10-11 14:57:56,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:56,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:57:56,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062421869] [2020-10-11 14:57:56,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:57:56,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:57:56,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:56,019 INFO L87 Difference]: Start difference. First operand 153 states and 329 transitions. Second operand 9 states. [2020-10-11 14:57:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:56,617 INFO L93 Difference]: Finished difference Result 199 states and 414 transitions. [2020-10-11 14:57:56,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 14:57:56,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 14:57:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:56,620 INFO L225 Difference]: With dead ends: 199 [2020-10-11 14:57:56,620 INFO L226 Difference]: Without dead ends: 163 [2020-10-11 14:57:56,620 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-10-11 14:57:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-11 14:57:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2020-10-11 14:57:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-11 14:57:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 315 transitions. [2020-10-11 14:57:56,628 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 315 transitions. Word has length 15 [2020-10-11 14:57:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:56,628 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 315 transitions. [2020-10-11 14:57:56,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:57:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 315 transitions. [2020-10-11 14:57:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:56,629 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:56,629 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:56,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 14:57:56,630 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1060903253, now seen corresponding path program 3 times [2020-10-11 14:57:56,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:56,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483362989] [2020-10-11 14:57:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:57,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483362989] [2020-10-11 14:57:57,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:57,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:57:57,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646227497] [2020-10-11 14:57:57,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:57:57,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:57,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:57:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:57,015 INFO L87 Difference]: Start difference. First operand 150 states and 315 transitions. Second operand 9 states. [2020-10-11 14:57:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:57,278 INFO L93 Difference]: Finished difference Result 177 states and 362 transitions. [2020-10-11 14:57:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:57:57,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 14:57:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:57,282 INFO L225 Difference]: With dead ends: 177 [2020-10-11 14:57:57,282 INFO L226 Difference]: Without dead ends: 160 [2020-10-11 14:57:57,282 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:57:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-11 14:57:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2020-10-11 14:57:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-11 14:57:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 321 transitions. [2020-10-11 14:57:57,290 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 321 transitions. Word has length 15 [2020-10-11 14:57:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:57,290 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 321 transitions. [2020-10-11 14:57:57,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:57:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 321 transitions. [2020-10-11 14:57:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:57,291 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:57,291 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:57,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 14:57:57,292 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:57,292 INFO L82 PathProgramCache]: Analyzing trace with hash 40955563, now seen corresponding path program 4 times [2020-10-11 14:57:57,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:57,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045276147] [2020-10-11 14:57:57,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:57,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045276147] [2020-10-11 14:57:57,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:57,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:57:57,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228480639] [2020-10-11 14:57:57,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:57:57,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:57:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:57,419 INFO L87 Difference]: Start difference. First operand 152 states and 321 transitions. Second operand 9 states. [2020-10-11 14:57:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:57,935 INFO L93 Difference]: Finished difference Result 228 states and 481 transitions. [2020-10-11 14:57:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 14:57:57,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 14:57:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:57,937 INFO L225 Difference]: With dead ends: 228 [2020-10-11 14:57:57,938 INFO L226 Difference]: Without dead ends: 153 [2020-10-11 14:57:57,938 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-10-11 14:57:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-11 14:57:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2020-10-11 14:57:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-11 14:57:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 308 transitions. [2020-10-11 14:57:57,943 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 308 transitions. Word has length 15 [2020-10-11 14:57:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:57,944 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 308 transitions. [2020-10-11 14:57:57,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:57:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 308 transitions. [2020-10-11 14:57:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:57,944 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:57,945 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:57,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 14:57:57,945 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:57,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1484926741, now seen corresponding path program 5 times [2020-10-11 14:57:57,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:57,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967262461] [2020-10-11 14:57:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:58,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967262461] [2020-10-11 14:57:58,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:58,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:57:58,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719766551] [2020-10-11 14:57:58,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:57:58,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:57:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:57:58,245 INFO L87 Difference]: Start difference. First operand 148 states and 308 transitions. Second operand 10 states. [2020-10-11 14:57:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:58,603 INFO L93 Difference]: Finished difference Result 194 states and 397 transitions. [2020-10-11 14:57:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:57:58,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-11 14:57:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:58,605 INFO L225 Difference]: With dead ends: 194 [2020-10-11 14:57:58,605 INFO L226 Difference]: Without dead ends: 100 [2020-10-11 14:57:58,606 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-11 14:57:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-10-11 14:57:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-10-11 14:57:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-11 14:57:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 209 transitions. [2020-10-11 14:57:58,609 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 209 transitions. Word has length 15 [2020-10-11 14:57:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:58,610 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 209 transitions. [2020-10-11 14:57:58,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:57:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 209 transitions. [2020-10-11 14:57:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:58,610 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:58,611 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:58,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 14:57:58,611 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash -842858609, now seen corresponding path program 6 times [2020-10-11 14:57:58,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:58,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470246835] [2020-10-11 14:57:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:58,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470246835] [2020-10-11 14:57:58,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:58,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:57:58,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072615129] [2020-10-11 14:57:58,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:57:58,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:58,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:57:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:57:58,821 INFO L87 Difference]: Start difference. First operand 100 states and 209 transitions. Second operand 8 states. [2020-10-11 14:57:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:59,106 INFO L93 Difference]: Finished difference Result 130 states and 256 transitions. [2020-10-11 14:57:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:57:59,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-11 14:57:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:59,107 INFO L225 Difference]: With dead ends: 130 [2020-10-11 14:57:59,108 INFO L226 Difference]: Without dead ends: 71 [2020-10-11 14:57:59,108 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:57:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-11 14:57:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2020-10-11 14:57:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-11 14:57:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 124 transitions. [2020-10-11 14:57:59,111 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 124 transitions. Word has length 15 [2020-10-11 14:57:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:59,111 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 124 transitions. [2020-10-11 14:57:59,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:57:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 124 transitions. [2020-10-11 14:57:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:59,112 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:59,112 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:59,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 14:57:59,112 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1068280379, now seen corresponding path program 7 times [2020-10-11 14:57:59,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:59,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764397494] [2020-10-11 14:57:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:59,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764397494] [2020-10-11 14:57:59,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:59,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:57:59,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713587050] [2020-10-11 14:57:59,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:57:59,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:59,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:57:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:57:59,333 INFO L87 Difference]: Start difference. First operand 66 states and 124 transitions. Second operand 10 states. [2020-10-11 14:57:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:59,665 INFO L93 Difference]: Finished difference Result 83 states and 151 transitions. [2020-10-11 14:57:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 14:57:59,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-11 14:57:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:59,669 INFO L225 Difference]: With dead ends: 83 [2020-10-11 14:57:59,669 INFO L226 Difference]: Without dead ends: 50 [2020-10-11 14:57:59,669 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-10-11 14:57:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-11 14:57:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-10-11 14:57:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-11 14:57:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 82 transitions. [2020-10-11 14:57:59,672 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 82 transitions. Word has length 15 [2020-10-11 14:57:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:59,672 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 82 transitions. [2020-10-11 14:57:59,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:57:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 82 transitions. [2020-10-11 14:57:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:57:59,673 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:59,673 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:59,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 14:57:59,673 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash 769228501, now seen corresponding path program 8 times [2020-10-11 14:57:59,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:59,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814800515] [2020-10-11 14:57:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:57:59,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814800515] [2020-10-11 14:57:59,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:59,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:57:59,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454260322] [2020-10-11 14:57:59,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:57:59,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:59,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:57:59,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:57:59,919 INFO L87 Difference]: Start difference. First operand 48 states and 82 transitions. Second operand 8 states. [2020-10-11 14:58:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:00,062 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. [2020-10-11 14:58:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:58:00,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-11 14:58:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:00,063 INFO L225 Difference]: With dead ends: 42 [2020-10-11 14:58:00,063 INFO L226 Difference]: Without dead ends: 0 [2020-10-11 14:58:00,063 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:58:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-11 14:58:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-11 14:58:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-11 14:58:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-11 14:58:00,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-10-11 14:58:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:00,065 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-11 14:58:00,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:58:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-11 14:58:00,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-11 14:58:00,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 14:58:00,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:58:00 BasicIcfg [2020-10-11 14:58:00,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:58:00,071 INFO L168 Benchmark]: Toolchain (without parser) took 20326.78 ms. Allocated memory was 256.9 MB in the beginning and 643.8 MB in the end (delta: 386.9 MB). Free memory was 212.7 MB in the beginning and 192.7 MB in the end (delta: 20.0 MB). Peak memory consumption was 406.9 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:00,071 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 256.9 MB. Free memory is still 233.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:58:00,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.48 ms. Allocated memory was 256.9 MB in the beginning and 328.2 MB in the end (delta: 71.3 MB). Free memory was 212.7 MB in the beginning and 275.9 MB in the end (delta: -63.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:00,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.97 ms. Allocated memory is still 328.2 MB. Free memory was 275.9 MB in the beginning and 273.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:00,073 INFO L168 Benchmark]: Boogie Preprocessor took 62.56 ms. Allocated memory is still 328.2 MB. Free memory was 273.4 MB in the beginning and 270.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:00,074 INFO L168 Benchmark]: RCFGBuilder took 3730.01 ms. Allocated memory was 328.2 MB in the beginning and 435.2 MB in the end (delta: 107.0 MB). Free memory was 270.9 MB in the beginning and 392.5 MB in the end (delta: -121.6 MB). Peak memory consumption was 148.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:00,074 INFO L168 Benchmark]: TraceAbstraction took 15656.44 ms. Allocated memory was 435.2 MB in the beginning and 643.8 MB in the end (delta: 208.7 MB). Free memory was 392.5 MB in the beginning and 192.7 MB in the end (delta: 199.8 MB). Peak memory consumption was 408.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:00,077 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.46 ms. Allocated memory is still 256.9 MB. Free memory is still 233.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 790.48 ms. Allocated memory was 256.9 MB in the beginning and 328.2 MB in the end (delta: 71.3 MB). Free memory was 212.7 MB in the beginning and 275.9 MB in the end (delta: -63.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 81.97 ms. Allocated memory is still 328.2 MB. Free memory was 275.9 MB in the beginning and 273.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 62.56 ms. Allocated memory is still 328.2 MB. Free memory was 273.4 MB in the beginning and 270.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3730.01 ms. Allocated memory was 328.2 MB in the beginning and 435.2 MB in the end (delta: 107.0 MB). Free memory was 270.9 MB in the beginning and 392.5 MB in the end (delta: -121.6 MB). Peak memory consumption was 148.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15656.44 ms. Allocated memory was 435.2 MB in the beginning and 643.8 MB in the end (delta: 208.7 MB). Free memory was 392.5 MB in the beginning and 192.7 MB in the end (delta: 199.8 MB). Peak memory consumption was 408.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 616 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 85 PlacesBefore, 29 PlacesAfterwards, 80 TransitionsBefore, 23 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 3006 MoverChecksTotal - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 357 SDtfs, 483 SDslu, 1025 SDs, 0 SdLazy, 1436 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 4.1s 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, 18 MinimizatonAttempts, 149 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 42340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...