java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:59:08,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:59:08,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:59:08,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:59:08,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:59:08,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:59:08,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:59:08,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:59:08,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:59:08,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:59:08,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:59:08,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:59:08,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:59:08,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:59:08,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:59:08,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:59:08,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:59:08,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:59:08,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:59:08,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:59:08,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:59:08,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:59:08,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:59:08,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:59:08,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:59:08,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:59:08,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:59:08,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:59:08,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:59:08,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:59:08,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:59:08,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:59:08,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:59:08,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:59:08,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:59:08,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:59:08,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:59:08,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:59:08,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:59:08,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:59:08,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:59:08,882 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 [2019-10-07 13:59:08,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:59:08,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:59:08,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:59:08,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:59:08,922 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:59:08,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:59:08,924 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:59:08,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:59:08,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:59:08,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:59:08,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:59:08,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:59:08,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:59:08,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:59:08,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:59:08,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:59:08,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:59:08,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:59:08,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:59:08,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:59:08,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:59:08,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:59:08,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:59:08,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:59:08,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:59:08,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:59:08,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:59:08,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:59:08,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:59:09,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:59:09,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:59:09,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:59:09,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:59:09,238 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:59:09,239 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-07 13:59:09,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/330078297/ac7940a7dab84510a00d949e88996d20/FLAGf12b220fa [2019-10-07 13:59:09,948 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:59:09,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-07 13:59:09,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/330078297/ac7940a7dab84510a00d949e88996d20/FLAGf12b220fa [2019-10-07 13:59:10,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/330078297/ac7940a7dab84510a00d949e88996d20 [2019-10-07 13:59:10,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:59:10,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:59:10,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:59:10,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:59:10,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:59:10,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:59:10" (1/1) ... [2019-10-07 13:59:10,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b14516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:10, skipping insertion in model container [2019-10-07 13:59:10,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:59:10" (1/1) ... [2019-10-07 13:59:10,184 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:59:10,267 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:59:11,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:59:11,027 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:59:11,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:59:11,205 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:59:11,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11 WrapperNode [2019-10-07 13:59:11,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:59:11,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:59:11,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:59:11,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:59:11,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (1/1) ... [2019-10-07 13:59:11,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (1/1) ... [2019-10-07 13:59:11,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (1/1) ... [2019-10-07 13:59:11,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (1/1) ... [2019-10-07 13:59:11,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (1/1) ... [2019-10-07 13:59:11,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (1/1) ... [2019-10-07 13:59:11,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (1/1) ... [2019-10-07 13:59:11,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:59:11,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:59:11,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:59:11,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:59:11,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (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 [2019-10-07 13:59:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:59:11,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:59:11,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 13:59:11,490 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-07 13:59:11,490 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-07 13:59:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-07 13:59:11,492 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-07 13:59:11,492 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-07 13:59:11,493 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-07 13:59:11,493 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-07 13:59:11,493 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-07 13:59:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-07 13:59:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-07 13:59:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-07 13:59:11,496 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-07 13:59:11,496 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-07 13:59:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-07 13:59:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 13:59:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-07 13:59:11,500 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-07 13:59:11,500 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-07 13:59:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-07 13:59:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-07 13:59:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-07 13:59:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-07 13:59:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-07 13:59:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-07 13:59:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-07 13:59:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-07 13:59:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-07 13:59:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-07 13:59:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-07 13:59:11,503 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 13:59:11,503 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-07 13:59:11,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:59:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 13:59:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 13:59:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 13:59:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 13:59:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 13:59:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 13:59:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 13:59:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 13:59:11,506 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 13:59:11,506 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 13:59:11,506 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-07 13:59:11,506 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-07 13:59:11,507 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-07 13:59:11,509 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-07 13:59:11,509 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-07 13:59:11,509 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-07 13:59:11,509 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-07 13:59:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-07 13:59:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-07 13:59:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-07 13:59:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-07 13:59:11,511 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-07 13:59:11,511 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-07 13:59:11,511 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-07 13:59:11,512 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-07 13:59:11,512 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-07 13:59:11,512 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-07 13:59:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-07 13:59:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-07 13:59:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-07 13:59:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-07 13:59:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-07 13:59:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-07 13:59:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-07 13:59:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-07 13:59:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-07 13:59:11,515 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-07 13:59:11,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 13:59:11,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:59:11,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:59:11,516 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-07 13:59:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-07 13:59:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-07 13:59:11,518 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-07 13:59:11,518 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-07 13:59:11,519 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-07 13:59:11,519 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-07 13:59:11,519 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-07 13:59:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-07 13:59:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-07 13:59:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-07 13:59:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-07 13:59:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-07 13:59:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-07 13:59:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-07 13:59:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-07 13:59:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-07 13:59:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-07 13:59:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 13:59:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-07 13:59:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-07 13:59:11,523 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-07 13:59:11,523 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-07 13:59:11,523 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-07 13:59:11,523 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-07 13:59:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-07 13:59:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-07 13:59:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-07 13:59:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 13:59:11,524 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 13:59:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-07 13:59:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-07 13:59:11,525 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-07 13:59:11,526 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-07 13:59:11,526 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-07 13:59:11,526 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-07 13:59:11,526 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-07 13:59:11,526 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-07 13:59:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-07 13:59:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-07 13:59:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-07 13:59:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 13:59:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-07 13:59:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 13:59:11,528 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 13:59:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 13:59:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:59:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 13:59:11,529 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 13:59:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 13:59:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 13:59:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 13:59:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 13:59:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:59:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 13:59:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 13:59:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:59:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 13:59:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 13:59:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:59:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 13:59:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 13:59:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:59:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 13:59:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 13:59:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 13:59:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-07 13:59:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-07 13:59:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-07 13:59:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-07 13:59:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-07 13:59:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-07 13:59:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-07 13:59:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-07 13:59:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-07 13:59:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-07 13:59:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-07 13:59:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-07 13:59:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-07 13:59:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-07 13:59:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-07 13:59:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-07 13:59:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-07 13:59:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:59:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 13:59:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:59:16,313 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:59:16,313 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-07 13:59:16,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:59:16 BoogieIcfgContainer [2019-10-07 13:59:16,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:59:16,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:59:16,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:59:16,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:59:16,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:59:10" (1/3) ... [2019-10-07 13:59:16,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722fb709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:59:16, skipping insertion in model container [2019-10-07 13:59:16,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:59:11" (2/3) ... [2019-10-07 13:59:16,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722fb709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:59:16, skipping insertion in model container [2019-10-07 13:59:16,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:59:16" (3/3) ... [2019-10-07 13:59:16,322 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product03.cil.c [2019-10-07 13:59:16,333 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:59:16,342 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:59:16,354 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:59:16,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:59:16,386 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:59:16,386 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:59:16,386 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:59:16,386 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:59:16,386 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:59:16,387 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:59:16,387 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:59:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states. [2019-10-07 13:59:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-07 13:59:16,441 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:16,443 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:16,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:16,452 INFO L82 PathProgramCache]: Analyzing trace with hash -809539187, now seen corresponding path program 1 times [2019-10-07 13:59:16,461 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:16,461 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:16,461 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:16,462 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:59:17,235 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:17,235 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:17,236 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:59:17,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:59:17,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:59:17,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:59:17,264 INFO L87 Difference]: Start difference. First operand 528 states. Second operand 5 states. [2019-10-07 13:59:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:18,345 INFO L93 Difference]: Finished difference Result 1186 states and 1810 transitions. [2019-10-07 13:59:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:59:18,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-07 13:59:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:18,386 INFO L225 Difference]: With dead ends: 1186 [2019-10-07 13:59:18,387 INFO L226 Difference]: Without dead ends: 780 [2019-10-07 13:59:18,399 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:59:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2019-10-07 13:59:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 773. [2019-10-07 13:59:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-07 13:59:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1170 transitions. [2019-10-07 13:59:18,544 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1170 transitions. Word has length 110 [2019-10-07 13:59:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:18,545 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1170 transitions. [2019-10-07 13:59:18,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:59:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1170 transitions. [2019-10-07 13:59:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-07 13:59:18,554 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:18,555 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:18,555 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1987540519, now seen corresponding path program 1 times [2019-10-07 13:59:18,556 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:18,556 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:18,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:18,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:59:18,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:18,836 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:18,837 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:59:18,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:59:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:59:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:18,840 INFO L87 Difference]: Start difference. First operand 773 states and 1170 transitions. Second operand 7 states. [2019-10-07 13:59:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:19,949 INFO L93 Difference]: Finished difference Result 905 states and 1332 transitions. [2019-10-07 13:59:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:59:19,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-10-07 13:59:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:19,958 INFO L225 Difference]: With dead ends: 905 [2019-10-07 13:59:19,958 INFO L226 Difference]: Without dead ends: 902 [2019-10-07 13:59:19,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:59:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-10-07 13:59:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 894. [2019-10-07 13:59:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-10-07 13:59:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1320 transitions. [2019-10-07 13:59:20,016 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1320 transitions. Word has length 114 [2019-10-07 13:59:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:20,016 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1320 transitions. [2019-10-07 13:59:20,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:59:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1320 transitions. [2019-10-07 13:59:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-07 13:59:20,024 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:20,024 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:20,024 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:20,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash 388765723, now seen corresponding path program 1 times [2019-10-07 13:59:20,025 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:20,025 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:20,026 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:20,026 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-07 13:59:20,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:20,193 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:20,194 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:59:20,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:59:20,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:59:20,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:59:20,195 INFO L87 Difference]: Start difference. First operand 894 states and 1320 transitions. Second operand 5 states. [2019-10-07 13:59:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:20,259 INFO L93 Difference]: Finished difference Result 1767 states and 2627 transitions. [2019-10-07 13:59:20,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:59:20,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-07 13:59:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:20,266 INFO L225 Difference]: With dead ends: 1767 [2019-10-07 13:59:20,266 INFO L226 Difference]: Without dead ends: 904 [2019-10-07 13:59:20,271 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:59:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-10-07 13:59:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2019-10-07 13:59:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-07 13:59:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1330 transitions. [2019-10-07 13:59:20,319 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1330 transitions. Word has length 150 [2019-10-07 13:59:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:20,320 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1330 transitions. [2019-10-07 13:59:20,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:59:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1330 transitions. [2019-10-07 13:59:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-07 13:59:20,324 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:20,325 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:20,325 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:20,326 INFO L82 PathProgramCache]: Analyzing trace with hash -146539075, now seen corresponding path program 1 times [2019-10-07 13:59:20,326 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:20,326 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:20,326 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:20,326 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 13:59:20,509 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:20,509 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:59:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:21,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 2877 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:59:21,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:59:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 13:59:21,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:59:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-07 13:59:21,428 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:59:21,429 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 10 [2019-10-07 13:59:21,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:59:21,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:59:21,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:59:21,430 INFO L87 Difference]: Start difference. First operand 904 states and 1330 transitions. Second operand 4 states. [2019-10-07 13:59:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:21,688 INFO L93 Difference]: Finished difference Result 1855 states and 2793 transitions. [2019-10-07 13:59:21,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:59:21,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-07 13:59:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:21,696 INFO L225 Difference]: With dead ends: 1855 [2019-10-07 13:59:21,696 INFO L226 Difference]: Without dead ends: 982 [2019-10-07 13:59:21,701 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:59:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-10-07 13:59:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2019-10-07 13:59:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-10-07 13:59:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1476 transitions. [2019-10-07 13:59:21,753 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1476 transitions. Word has length 155 [2019-10-07 13:59:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:21,754 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 1476 transitions. [2019-10-07 13:59:21,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:59:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1476 transitions. [2019-10-07 13:59:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-07 13:59:21,759 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:21,759 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:21,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:21,968 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1347898747, now seen corresponding path program 1 times [2019-10-07 13:59:21,968 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:21,968 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:21,969 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:21,969 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-07 13:59:22,270 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:22,270 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:59:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:22,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 2882 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:59:22,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:59:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 13:59:22,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:59:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-07 13:59:23,023 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:59:23,024 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2019-10-07 13:59:23,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:59:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:59:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:23,026 INFO L87 Difference]: Start difference. First operand 982 states and 1476 transitions. Second operand 4 states. [2019-10-07 13:59:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:23,308 INFO L93 Difference]: Finished difference Result 2011 states and 3083 transitions. [2019-10-07 13:59:23,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:59:23,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-07 13:59:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:23,316 INFO L225 Difference]: With dead ends: 2011 [2019-10-07 13:59:23,317 INFO L226 Difference]: Without dead ends: 1060 [2019-10-07 13:59:23,321 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:59:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-07 13:59:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2019-10-07 13:59:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-10-07 13:59:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1622 transitions. [2019-10-07 13:59:23,370 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1622 transitions. Word has length 160 [2019-10-07 13:59:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:23,371 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1622 transitions. [2019-10-07 13:59:23,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:59:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1622 transitions. [2019-10-07 13:59:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-07 13:59:23,377 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:23,378 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:23,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:23,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1791595061, now seen corresponding path program 1 times [2019-10-07 13:59:23,589 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:23,589 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:23,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:23,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 13:59:23,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:23,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:59:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:24,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 2886 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:59:24,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:59:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-07 13:59:24,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:59:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 13:59:24,602 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:59:24,602 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2019-10-07 13:59:24,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:59:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:59:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:24,605 INFO L87 Difference]: Start difference. First operand 1060 states and 1622 transitions. Second operand 4 states. [2019-10-07 13:59:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:24,875 INFO L93 Difference]: Finished difference Result 2167 states and 3373 transitions. [2019-10-07 13:59:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:59:24,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-07 13:59:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:24,893 INFO L225 Difference]: With dead ends: 2167 [2019-10-07 13:59:24,893 INFO L226 Difference]: Without dead ends: 1138 [2019-10-07 13:59:24,909 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:59:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-10-07 13:59:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2019-10-07 13:59:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-10-07 13:59:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1768 transitions. [2019-10-07 13:59:24,989 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1768 transitions. Word has length 164 [2019-10-07 13:59:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:24,991 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 1768 transitions. [2019-10-07 13:59:24,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:59:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1768 transitions. [2019-10-07 13:59:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-07 13:59:24,998 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:24,998 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:25,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:25,210 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 767809565, now seen corresponding path program 1 times [2019-10-07 13:59:25,211 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:25,211 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:25,212 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:25,212 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 13:59:25,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:25,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:59:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:26,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:59:26,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:59:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 13:59:26,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:59:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 13:59:26,280 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:59:26,280 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2019-10-07 13:59:26,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:59:26,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:59:26,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:26,282 INFO L87 Difference]: Start difference. First operand 1138 states and 1768 transitions. Second operand 4 states. [2019-10-07 13:59:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:26,554 INFO L93 Difference]: Finished difference Result 2323 states and 3663 transitions. [2019-10-07 13:59:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:59:26,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-10-07 13:59:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:26,564 INFO L225 Difference]: With dead ends: 2323 [2019-10-07 13:59:26,564 INFO L226 Difference]: Without dead ends: 1216 [2019-10-07 13:59:26,569 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:59:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-10-07 13:59:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2019-10-07 13:59:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-10-07 13:59:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1914 transitions. [2019-10-07 13:59:26,616 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1914 transitions. Word has length 167 [2019-10-07 13:59:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:26,616 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 1914 transitions. [2019-10-07 13:59:26,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:59:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1914 transitions. [2019-10-07 13:59:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-07 13:59:26,621 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:26,622 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:26,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:26,831 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 455444397, now seen corresponding path program 1 times [2019-10-07 13:59:26,832 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:26,832 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:26,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:26,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 13:59:27,019 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:27,020 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:27,020 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:59:27,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:59:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:59:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:59:27,021 INFO L87 Difference]: Start difference. First operand 1216 states and 1914 transitions. Second operand 4 states. [2019-10-07 13:59:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:27,251 INFO L93 Difference]: Finished difference Result 2485 states and 3951 transitions. [2019-10-07 13:59:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:59:27,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-10-07 13:59:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:27,260 INFO L225 Difference]: With dead ends: 2485 [2019-10-07 13:59:27,260 INFO L226 Difference]: Without dead ends: 1284 [2019-10-07 13:59:27,266 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:59:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-10-07 13:59:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-10-07 13:59:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-10-07 13:59:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1950 transitions. [2019-10-07 13:59:27,321 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1950 transitions. Word has length 169 [2019-10-07 13:59:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:27,322 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1950 transitions. [2019-10-07 13:59:27,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:59:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1950 transitions. [2019-10-07 13:59:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-07 13:59:27,327 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:27,327 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:27,328 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1600185500, now seen corresponding path program 1 times [2019-10-07 13:59:27,328 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:27,328 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:27,329 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:27,329 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 13:59:27,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:27,543 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:27,543 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:59:27,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:59:27,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:59:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:27,545 INFO L87 Difference]: Start difference. First operand 1284 states and 1950 transitions. Second operand 7 states. [2019-10-07 13:59:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:28,569 INFO L93 Difference]: Finished difference Result 2733 states and 4190 transitions. [2019-10-07 13:59:28,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:59:28,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2019-10-07 13:59:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:28,580 INFO L225 Difference]: With dead ends: 2733 [2019-10-07 13:59:28,580 INFO L226 Difference]: Without dead ends: 1237 [2019-10-07 13:59:28,588 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:59:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2019-10-07 13:59:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1221. [2019-10-07 13:59:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-10-07 13:59:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1770 transitions. [2019-10-07 13:59:28,653 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1770 transitions. Word has length 169 [2019-10-07 13:59:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:28,655 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 1770 transitions. [2019-10-07 13:59:28,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:59:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1770 transitions. [2019-10-07 13:59:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-07 13:59:28,662 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:28,662 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:28,663 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1763584325, now seen corresponding path program 1 times [2019-10-07 13:59:28,663 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:28,664 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:28,664 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:28,664 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-07 13:59:30,156 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:30,156 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:59:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:59:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:30,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-07 13:59:30,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:59:32,219 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-07 13:59:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-07 13:59:32,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:59:33,013 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43 [2019-10-07 13:59:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:33,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:33,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:33,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 13:59:33,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:33,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:33,664 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2019-10-07 13:59:34,487 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43 [2019-10-07 13:59:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 13:59:34,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:59:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:24,636 WARN L191 SmtUtils]: Spent 49.49 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:00:24,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:00:24,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:24,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:24,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:24,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:00:25,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,368 WARN L191 SmtUtils]: Spent 48.55 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:01:14,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:14,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:14,800 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-07 14:01:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,297 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-10-07 14:01:15,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,632 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 15 [2019-10-07 14:01:15,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:15,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:15,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:15,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:15,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:16,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:16,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:16,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:16,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:16,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:16,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:16,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:16,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-07 14:01:16,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 14:01:16,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:01:16,804 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43 [2019-10-07 14:01:17,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 14:01:17,186 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-07 14:01:17,529 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 23 [2019-10-07 14:01:18,329 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43 [2019-10-07 14:01:19,176 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43 [2019-10-07 14:01:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-07 14:01:19,578 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 14:01:19,611 INFO L162 IcfgInterpreter]: Started Sifa with 128 locations of interest [2019-10-07 14:01:19,612 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 14:01:19,619 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 14:01:19,628 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 14:01:19,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 14:02:04,386 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 750 [2019-10-07 14:02:08,985 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 405 DAG size of output: 327 [2019-10-07 14:02:09,428 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 836 [2019-10-07 14:02:09,965 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 836 [2019-10-07 14:02:10,307 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 836 [2019-10-07 14:02:10,881 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:11,339 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:11,794 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:12,327 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:14,090 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 1014 DAG size of output: 1012 [2019-10-07 14:02:14,572 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:15,054 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:15,482 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:15,929 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:16,472 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 1012 [2019-10-07 14:02:16,492 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 370 for LOIs [2019-10-07 14:02:16,829 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 719 [2019-10-07 14:02:17,017 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 719 [2019-10-07 14:02:17,484 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 895 [2019-10-07 14:02:17,486 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1056 for LOIs [2019-10-07 14:02:17,904 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:18,332 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:18,447 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:19,130 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:19,556 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:19,978 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:20,191 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:21,009 WARN L191 SmtUtils]: Spent 814.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:21,474 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:21,887 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:21,996 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:22,684 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:23,553 WARN L191 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 1210 DAG size of output: 1056 [2019-10-07 14:02:23,965 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:24,089 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:24,786 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:25,228 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:25,659 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:25,771 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:26,469 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:26,888 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:27,313 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:27,419 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:28,099 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:28,512 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:28,938 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:29,046 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:29,730 WARN L191 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:30,144 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:30,559 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:30,664 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:31,349 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:31,771 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:32,205 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:32,980 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:33,407 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:33,838 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:33,980 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:34,661 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:35,077 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:35,504 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:35,611 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:36,303 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:36,723 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:37,151 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:37,255 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:37,925 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:38,351 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:38,760 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:02:38,866 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:39,545 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:40,277 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:40,952 WARN L191 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:41,087 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:02:41,782 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:43,035 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:02:43,729 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:44,531 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:45,203 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:45,898 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:46,700 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:02:47,566 WARN L191 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:48,255 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:48,367 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:02:49,067 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:49,770 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:50,461 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:50,577 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:02:51,274 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:51,962 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:52,649 WARN L191 SmtUtils]: Spent 684.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:52,754 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:02:53,430 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:02:54,118 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:02:54,812 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:02:54,957 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:02:55,647 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:02:56,356 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:02:57,064 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:02:57,175 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:02:57,865 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:02:58,579 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:02:59,273 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:02:59,388 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:00,094 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:00,798 WARN L191 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:01,509 WARN L191 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:01,736 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:02,482 WARN L191 SmtUtils]: Spent 744.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:03,190 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:03,900 WARN L191 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:04,715 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:06,041 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:06,723 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:06,845 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:07,547 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:08,764 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:09,456 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:09,577 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:10,257 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:10,953 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:11,626 WARN L191 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:11,730 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:12,407 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:13,664 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1210 [2019-10-07 14:03:14,366 WARN L191 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:03:15,167 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:03:16,403 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1210 [2019-10-07 14:03:17,092 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:03:17,896 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:03:19,125 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 1212 DAG size of output: 1210 [2019-10-07 14:03:19,807 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:03:19,911 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:20,593 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:03:21,299 WARN L191 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:03:21,984 WARN L191 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:03:22,108 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:22,795 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:03:23,510 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:24,202 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:24,312 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:24,993 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:03:26,270 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:26,949 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:27,064 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:27,745 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:28,983 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:29,653 WARN L191 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:29,768 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:30,445 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:31,136 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:31,814 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:31,920 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:32,624 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:33,893 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:34,590 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:35,362 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:36,623 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:37,306 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:37,417 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:38,102 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:38,780 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:39,488 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:39,591 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:40,294 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:41,588 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1210 [2019-10-07 14:03:42,278 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:03:42,389 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:43,093 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:03:44,402 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1212 [2019-10-07 14:03:45,116 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:03:45,229 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:45,918 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:03:47,123 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1210 [2019-10-07 14:03:47,850 WARN L191 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:03:47,957 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:03:48,659 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:03:49,930 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 1219 DAG size of output: 1217 [2019-10-07 14:03:50,652 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:03:51,469 WARN L191 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:03:52,766 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:53,475 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:53,588 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:54,274 WARN L191 SmtUtils]: Spent 684.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:55,526 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:03:56,234 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:56,345 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:03:57,054 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:57,746 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:58,446 WARN L191 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:03:59,236 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:00,084 WARN L191 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:00,779 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:01,594 WARN L191 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:02,826 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1210 [2019-10-07 14:04:03,539 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:04:03,654 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:04,368 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:05,552 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1210 [2019-10-07 14:04:06,255 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:04:06,358 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:07,067 WARN L191 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:08,398 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 1219 DAG size of output: 1217 [2019-10-07 14:04:09,109 WARN L191 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:04:09,685 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:10,397 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 1217 [2019-10-07 14:04:11,117 WARN L191 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:11,837 WARN L191 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:11,948 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:12,684 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:13,450 WARN L191 SmtUtils]: Spent 742.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:14,165 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:14,274 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:15,004 WARN L191 SmtUtils]: Spent 728.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:15,753 WARN L191 SmtUtils]: Spent 736.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:16,475 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:16,589 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:17,315 WARN L191 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 1219 [2019-10-07 14:04:18,653 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:04:19,352 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:19,463 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:04:20,178 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:21,992 WARN L191 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:04:22,680 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:22,788 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:04:23,482 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:24,762 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:04:25,471 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:25,581 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:04:26,291 WARN L191 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:27,636 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:04:28,340 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:29,185 WARN L191 SmtUtils]: Spent 736.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:29,901 WARN L191 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:30,624 WARN L191 SmtUtils]: Spent 720.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:31,441 WARN L191 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:32,731 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1212 [2019-10-07 14:04:33,441 WARN L191 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:33,549 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:34,288 WARN L191 SmtUtils]: Spent 736.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:35,634 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1212 [2019-10-07 14:04:36,329 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:36,442 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:37,154 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:38,410 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1212 [2019-10-07 14:04:39,138 WARN L191 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:39,241 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:39,958 WARN L191 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:41,455 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 1219 DAG size of output: 1210 [2019-10-07 14:04:42,148 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:04:42,263 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:42,985 WARN L191 SmtUtils]: Spent 720.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:44,163 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 1221 DAG size of output: 1212 [2019-10-07 14:04:45,009 WARN L191 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:45,131 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:45,847 WARN L191 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 1214 [2019-10-07 14:04:47,148 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:04:47,843 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:47,956 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:04:48,645 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:49,920 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 1210 DAG size of output: 1208 [2019-10-07 14:04:50,629 WARN L191 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:50,738 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:04:51,450 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:52,148 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:52,860 WARN L191 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:53,675 WARN L191 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:04:54,406 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:55,102 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:55,228 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:55,921 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:57,096 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1210 [2019-10-07 14:04:57,804 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 1210 [2019-10-07 14:04:57,912 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 419 [2019-10-07 14:04:58,616 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 1212 [2019-10-07 14:04:58,622 INFO L199 IcfgInterpreter]: Interpreting procedure runTest with input of size 1076 for LOIs [2019-10-07 14:04:59,070 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 1076 [2019-10-07 14:04:59,525 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 1076 [2019-10-07 14:04:59,633 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:05:00,330 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:05:00,339 INFO L199 IcfgInterpreter]: Interpreting procedure test with input of size 1030 for LOIs [2019-10-07 14:05:00,726 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 1030 [2019-10-07 14:05:01,107 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 1030 [2019-10-07 14:05:01,227 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 416 [2019-10-07 14:05:01,942 WARN L191 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 1208 [2019-10-07 14:05:02,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:05:02,186 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee initPersonOnFloor at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee initPersonOnFloor at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 14:05:02,193 INFO L168 Benchmark]: Toolchain (without parser) took 352026.72 ms. Allocated memory was 137.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 99.6 MB in the beginning and 670.8 MB in the end (delta: -571.2 MB). Peak memory consumption was 644.1 MB. Max. memory is 7.1 GB. [2019-10-07 14:05:02,193 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 14:05:02,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1039.04 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 143.0 MB in the end (delta: -43.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2019-10-07 14:05:02,194 INFO L168 Benchmark]: Boogie Preprocessor took 182.87 ms. Allocated memory is still 202.9 MB. Free memory was 143.0 MB in the beginning and 133.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-07 14:05:02,194 INFO L168 Benchmark]: RCFGBuilder took 4924.48 ms. Allocated memory was 202.9 MB in the beginning and 299.4 MB in the end (delta: 96.5 MB). Free memory was 133.8 MB in the beginning and 234.6 MB in the end (delta: -100.8 MB). Peak memory consumption was 153.7 MB. Max. memory is 7.1 GB. [2019-10-07 14:05:02,194 INFO L168 Benchmark]: TraceAbstraction took 345875.48 ms. Allocated memory was 299.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 234.6 MB in the beginning and 670.8 MB in the end (delta: -436.3 MB). Peak memory consumption was 617.5 MB. Max. memory is 7.1 GB. [2019-10-07 14:05:02,207 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1039.04 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 143.0 MB in the end (delta: -43.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.87 ms. Allocated memory is still 202.9 MB. Free memory was 143.0 MB in the beginning and 133.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4924.48 ms. Allocated memory was 202.9 MB in the beginning and 299.4 MB in the end (delta: 96.5 MB). Free memory was 133.8 MB in the beginning and 234.6 MB in the end (delta: -100.8 MB). Peak memory consumption was 153.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 345875.48 ms. Allocated memory was 299.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 234.6 MB in the beginning and 670.8 MB in the end (delta: -436.3 MB). Peak memory consumption was 617.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee initPersonOnFloor de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee initPersonOnFloor: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...