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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:38:48,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:38:48,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:38:48,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:38:48,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:38:48,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:38:48,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:38:48,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:38:48,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:38:48,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:38:48,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:38:48,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:38:48,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:38:48,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:38:48,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:38:48,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:38:48,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:38:48,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:38:48,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:38:48,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:38:48,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:38:48,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:38:48,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:38:48,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:38:48,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:38:48,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:38:48,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:38:48,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:38:48,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:38:48,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:38:48,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:38:48,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:38:48,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:38:48,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:38:48,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:38:48,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:38:48,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:38:48,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:38:48,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:38:48,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:38:48,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:38:48,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:38:48,403 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:38:48,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:38:48,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:38:48,404 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:38:48,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:38:48,405 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:38:48,405 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:38:48,405 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:38:48,406 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:38:48,406 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:38:48,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:38:48,408 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:38:48,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:38:48,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:38:48,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:38:48,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:38:48,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:38:48,409 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:38:48,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:38:48,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:38:48,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:38:48,410 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:38:48,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:38:48,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:38:48,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:38:48,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:38:48,411 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:38:48,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:38:48,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:38:48,412 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:38:48,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:38:48,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:38:48,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:38:48,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:38:48,487 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:38:48,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:38:48,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567ade333/5707fc8913784072b88d88c27d7b4d97/FLAG799057a49 [2019-09-10 07:38:49,016 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:38:49,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:38:49,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567ade333/5707fc8913784072b88d88c27d7b4d97/FLAG799057a49 [2019-09-10 07:38:49,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567ade333/5707fc8913784072b88d88c27d7b4d97 [2019-09-10 07:38:49,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:38:49,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:38:49,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:38:49,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:38:49,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:38:49,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:38:49" (1/1) ... [2019-09-10 07:38:49,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:49, skipping insertion in model container [2019-09-10 07:38:49,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:38:49" (1/1) ... [2019-09-10 07:38:49,431 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:38:49,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:38:49,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:38:49,996 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:38:50,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:38:50,131 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:38:50,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50 WrapperNode [2019-09-10 07:38:50,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:38:50,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:38:50,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:38:50,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:38:50,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (1/1) ... [2019-09-10 07:38:50,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (1/1) ... [2019-09-10 07:38:50,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (1/1) ... [2019-09-10 07:38:50,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (1/1) ... [2019-09-10 07:38:50,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (1/1) ... [2019-09-10 07:38:50,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (1/1) ... [2019-09-10 07:38:50,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (1/1) ... [2019-09-10 07:38:50,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:38:50,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:38:50,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:38:50,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:38:50,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (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-09-10 07:38:50,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:38:50,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:38:50,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:38:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:38:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:38:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:38:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:38:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:38:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:38:50,264 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:38:50,264 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:38:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:38:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:38:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:38:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:38:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:38:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:38:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:38:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:38:50,967 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:38:50,968 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:38:50,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:38:50 BoogieIcfgContainer [2019-09-10 07:38:50,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:38:50,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:38:50,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:38:50,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:38:50,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:38:49" (1/3) ... [2019-09-10 07:38:50,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452597bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:38:50, skipping insertion in model container [2019-09-10 07:38:50,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:50" (2/3) ... [2019-09-10 07:38:50,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452597bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:38:50, skipping insertion in model container [2019-09-10 07:38:50,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:38:50" (3/3) ... [2019-09-10 07:38:50,982 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:38:50,991 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:38:51,012 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 07:38:51,029 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 07:38:51,057 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:38:51,057 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:38:51,057 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:38:51,057 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:38:51,058 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:38:51,058 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:38:51,058 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:38:51,058 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:38:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-09-10 07:38:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:38:51,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:51,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:51,086 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:51,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1559662222, now seen corresponding path program 1 times [2019-09-10 07:38:51,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:51,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:51,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:51,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:51,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:38:51,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:51,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:38:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:38:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:38:51,502 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2019-09-10 07:38:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:51,617 INFO L93 Difference]: Finished difference Result 166 states and 264 transitions. [2019-09-10 07:38:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:38:51,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 07:38:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:51,632 INFO L225 Difference]: With dead ends: 166 [2019-09-10 07:38:51,632 INFO L226 Difference]: Without dead ends: 158 [2019-09-10 07:38:51,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:38:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-10 07:38:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-09-10 07:38:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-10 07:38:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2019-09-10 07:38:51,686 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 51 [2019-09-10 07:38:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:51,687 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2019-09-10 07:38:51,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:38:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2019-09-10 07:38:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:38:51,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:51,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:51,690 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1275879745, now seen corresponding path program 1 times [2019-09-10 07:38:51,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:51,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:51,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:51,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:51,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:38:51,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:51,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:38:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:38:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:38:51,865 INFO L87 Difference]: Start difference. First operand 156 states and 219 transitions. Second operand 3 states. [2019-09-10 07:38:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:51,937 INFO L93 Difference]: Finished difference Result 201 states and 285 transitions. [2019-09-10 07:38:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:38:51,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 07:38:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:51,940 INFO L225 Difference]: With dead ends: 201 [2019-09-10 07:38:51,940 INFO L226 Difference]: Without dead ends: 201 [2019-09-10 07:38:51,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:38:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-10 07:38:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-09-10 07:38:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 07:38:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 284 transitions. [2019-09-10 07:38:51,967 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 284 transitions. Word has length 52 [2019-09-10 07:38:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:51,967 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 284 transitions. [2019-09-10 07:38:51,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:38:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 284 transitions. [2019-09-10 07:38:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 07:38:51,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:51,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:51,970 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash 920769505, now seen corresponding path program 1 times [2019-09-10 07:38:51,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:51,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:51,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:51,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:52,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:52,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:38:52,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:52,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:38:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:38:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:52,105 INFO L87 Difference]: Start difference. First operand 199 states and 284 transitions. Second operand 5 states. [2019-09-10 07:38:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:52,234 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2019-09-10 07:38:52,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:38:52,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-10 07:38:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:52,239 INFO L225 Difference]: With dead ends: 199 [2019-09-10 07:38:52,239 INFO L226 Difference]: Without dead ends: 199 [2019-09-10 07:38:52,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:38:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-10 07:38:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-09-10 07:38:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 07:38:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 280 transitions. [2019-09-10 07:38:52,251 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 280 transitions. Word has length 53 [2019-09-10 07:38:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:52,252 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 280 transitions. [2019-09-10 07:38:52,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:38:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 280 transitions. [2019-09-10 07:38:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:38:52,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:52,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:52,254 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:52,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1424755381, now seen corresponding path program 1 times [2019-09-10 07:38:52,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:52,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:52,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:52,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:52,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:52,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:38:52,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:52,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:38:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:38:52,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:52,341 INFO L87 Difference]: Start difference. First operand 199 states and 280 transitions. Second operand 5 states. [2019-09-10 07:38:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:52,462 INFO L93 Difference]: Finished difference Result 199 states and 276 transitions. [2019-09-10 07:38:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:38:52,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 07:38:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:52,467 INFO L225 Difference]: With dead ends: 199 [2019-09-10 07:38:52,467 INFO L226 Difference]: Without dead ends: 199 [2019-09-10 07:38:52,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:38:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-10 07:38:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-09-10 07:38:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 07:38:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2019-09-10 07:38:52,487 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 54 [2019-09-10 07:38:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:52,488 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2019-09-10 07:38:52,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:38:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2019-09-10 07:38:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:38:52,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:52,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:52,493 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 710908993, now seen corresponding path program 1 times [2019-09-10 07:38:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:52,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:52,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:52,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:38:52,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:52,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:38:52,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:38:52,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:52,591 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand 5 states. [2019-09-10 07:38:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:52,723 INFO L93 Difference]: Finished difference Result 199 states and 272 transitions. [2019-09-10 07:38:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:38:52,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 07:38:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:52,727 INFO L225 Difference]: With dead ends: 199 [2019-09-10 07:38:52,727 INFO L226 Difference]: Without dead ends: 199 [2019-09-10 07:38:52,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:38:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-10 07:38:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-09-10 07:38:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 07:38:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 272 transitions. [2019-09-10 07:38:52,752 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 272 transitions. Word has length 55 [2019-09-10 07:38:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:52,752 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 272 transitions. [2019-09-10 07:38:52,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:38:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 272 transitions. [2019-09-10 07:38:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:38:52,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:52,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:52,755 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:52,755 INFO L82 PathProgramCache]: Analyzing trace with hash 885426054, now seen corresponding path program 1 times [2019-09-10 07:38:52,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:52,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:52,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:52,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:52,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:38:52,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:52,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:38:52,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:38:52,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:52,849 INFO L87 Difference]: Start difference. First operand 199 states and 272 transitions. Second operand 5 states. [2019-09-10 07:38:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:52,969 INFO L93 Difference]: Finished difference Result 495 states and 696 transitions. [2019-09-10 07:38:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:38:52,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 07:38:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:52,973 INFO L225 Difference]: With dead ends: 495 [2019-09-10 07:38:52,973 INFO L226 Difference]: Without dead ends: 495 [2019-09-10 07:38:52,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-10 07:38:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 292. [2019-09-10 07:38:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-10 07:38:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 409 transitions. [2019-09-10 07:38:52,983 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 409 transitions. Word has length 56 [2019-09-10 07:38:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:52,984 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 409 transitions. [2019-09-10 07:38:52,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:38:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 409 transitions. [2019-09-10 07:38:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:38:52,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:52,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:52,997 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1174705316, now seen corresponding path program 1 times [2019-09-10 07:38:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:53,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:53,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:53,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:53,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:38:53,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:53,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:38:53,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:38:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:53,099 INFO L87 Difference]: Start difference. First operand 292 states and 409 transitions. Second operand 5 states. [2019-09-10 07:38:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:53,196 INFO L93 Difference]: Finished difference Result 563 states and 795 transitions. [2019-09-10 07:38:53,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:38:53,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 07:38:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:53,200 INFO L225 Difference]: With dead ends: 563 [2019-09-10 07:38:53,200 INFO L226 Difference]: Without dead ends: 563 [2019-09-10 07:38:53,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-10 07:38:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 423. [2019-09-10 07:38:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-10 07:38:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 600 transitions. [2019-09-10 07:38:53,213 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 600 transitions. Word has length 56 [2019-09-10 07:38:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:53,214 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 600 transitions. [2019-09-10 07:38:53,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:38:53,214 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 600 transitions. [2019-09-10 07:38:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:38:53,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:53,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:53,215 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1012396963, now seen corresponding path program 1 times [2019-09-10 07:38:53,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:53,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:53,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:38:53,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:53,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:38:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:38:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:38:53,291 INFO L87 Difference]: Start difference. First operand 423 states and 600 transitions. Second operand 5 states. [2019-09-10 07:38:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:53,418 INFO L93 Difference]: Finished difference Result 666 states and 947 transitions. [2019-09-10 07:38:53,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:38:53,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 07:38:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:53,422 INFO L225 Difference]: With dead ends: 666 [2019-09-10 07:38:53,423 INFO L226 Difference]: Without dead ends: 666 [2019-09-10 07:38:53,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:38:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-10 07:38:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 516. [2019-09-10 07:38:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-10 07:38:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 737 transitions. [2019-09-10 07:38:53,439 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 737 transitions. Word has length 56 [2019-09-10 07:38:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:53,440 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 737 transitions. [2019-09-10 07:38:53,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:38:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 737 transitions. [2019-09-10 07:38:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:38:53,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:53,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:53,442 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1507412779, now seen corresponding path program 1 times [2019-09-10 07:38:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:53,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:53,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:38:53,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:53,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:38:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:38:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:38:53,700 INFO L87 Difference]: Start difference. First operand 516 states and 737 transitions. Second operand 10 states. [2019-09-10 07:38:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:54,322 INFO L93 Difference]: Finished difference Result 986 states and 1412 transitions. [2019-09-10 07:38:54,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:38:54,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-09-10 07:38:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:54,328 INFO L225 Difference]: With dead ends: 986 [2019-09-10 07:38:54,328 INFO L226 Difference]: Without dead ends: 986 [2019-09-10 07:38:54,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:38:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-10 07:38:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 516. [2019-09-10 07:38:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-10 07:38:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 735 transitions. [2019-09-10 07:38:54,347 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 735 transitions. Word has length 57 [2019-09-10 07:38:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:54,347 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 735 transitions. [2019-09-10 07:38:54,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:38:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 735 transitions. [2019-09-10 07:38:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:38:54,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:54,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:54,349 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1490525900, now seen corresponding path program 1 times [2019-09-10 07:38:54,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:54,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:54,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:54,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:54,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:38:54,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:54,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:38:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:38:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:38:54,543 INFO L87 Difference]: Start difference. First operand 516 states and 735 transitions. Second operand 9 states. [2019-09-10 07:38:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:54,932 INFO L93 Difference]: Finished difference Result 951 states and 1368 transitions. [2019-09-10 07:38:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:38:54,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 07:38:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:54,940 INFO L225 Difference]: With dead ends: 951 [2019-09-10 07:38:54,940 INFO L226 Difference]: Without dead ends: 951 [2019-09-10 07:38:54,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:38:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-10 07:38:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 516. [2019-09-10 07:38:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-10 07:38:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 734 transitions. [2019-09-10 07:38:54,958 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 734 transitions. Word has length 57 [2019-09-10 07:38:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:54,958 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 734 transitions. [2019-09-10 07:38:54,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:38:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 734 transitions. [2019-09-10 07:38:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:38:54,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:54,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:54,960 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 640170611, now seen corresponding path program 1 times [2019-09-10 07:38:54,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:54,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:54,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:55,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:38:55,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:55,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:38:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:38:55,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:38:55,140 INFO L87 Difference]: Start difference. First operand 516 states and 734 transitions. Second operand 10 states. [2019-09-10 07:38:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:55,897 INFO L93 Difference]: Finished difference Result 981 states and 1398 transitions. [2019-09-10 07:38:55,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:38:55,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-10 07:38:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:55,903 INFO L225 Difference]: With dead ends: 981 [2019-09-10 07:38:55,903 INFO L226 Difference]: Without dead ends: 981 [2019-09-10 07:38:55,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:38:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-10 07:38:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 516. [2019-09-10 07:38:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-10 07:38:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions. [2019-09-10 07:38:55,922 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 58 [2019-09-10 07:38:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:55,923 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 730 transitions. [2019-09-10 07:38:55,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:38:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions. [2019-09-10 07:38:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:38:55,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:55,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:38:55,924 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:55,924 INFO L82 PathProgramCache]: Analyzing trace with hash 783431871, now seen corresponding path program 1 times [2019-09-10 07:38:55,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:55,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:55,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:55,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:55,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:56,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:56,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:38:56,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:56,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:38:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:38:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:38:56,594 INFO L87 Difference]: Start difference. First operand 516 states and 730 transitions. Second operand 21 states. [2019-09-10 07:38:56,740 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:38:57,446 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:38:57,626 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:38:57,874 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 07:39:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:00,272 INFO L93 Difference]: Finished difference Result 3302 states and 4805 transitions. [2019-09-10 07:39:00,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:39:00,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-10 07:39:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:00,290 INFO L225 Difference]: With dead ends: 3302 [2019-09-10 07:39:00,291 INFO L226 Difference]: Without dead ends: 3302 [2019-09-10 07:39:00,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:39:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2019-09-10 07:39:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 531. [2019-09-10 07:39:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-10 07:39:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 749 transitions. [2019-09-10 07:39:00,335 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 749 transitions. Word has length 59 [2019-09-10 07:39:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:00,336 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 749 transitions. [2019-09-10 07:39:00,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:39:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 749 transitions. [2019-09-10 07:39:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:39:00,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:00,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:00,340 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash 125988192, now seen corresponding path program 1 times [2019-09-10 07:39:00,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:00,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:00,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:00,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:01,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:01,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:39:01,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:01,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:39:01,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:39:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:01,002 INFO L87 Difference]: Start difference. First operand 531 states and 749 transitions. Second operand 21 states. [2019-09-10 07:39:01,147 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:39:01,756 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:39:01,917 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:39:02,135 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 07:39:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:03,985 INFO L93 Difference]: Finished difference Result 2871 states and 4175 transitions. [2019-09-10 07:39:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:39:03,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-10 07:39:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:04,000 INFO L225 Difference]: With dead ends: 2871 [2019-09-10 07:39:04,000 INFO L226 Difference]: Without dead ends: 2871 [2019-09-10 07:39:04,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=333, Invalid=1389, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:39:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-09-10 07:39:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 531. [2019-09-10 07:39:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-10 07:39:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 748 transitions. [2019-09-10 07:39:04,034 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 748 transitions. Word has length 59 [2019-09-10 07:39:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:04,035 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 748 transitions. [2019-09-10 07:39:04,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:39:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 748 transitions. [2019-09-10 07:39:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:39:04,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:04,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:04,036 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1854553764, now seen corresponding path program 1 times [2019-09-10 07:39:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:04,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:04,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:39:04,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:04,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:39:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:39:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:39:04,931 INFO L87 Difference]: Start difference. First operand 531 states and 748 transitions. Second operand 17 states. [2019-09-10 07:39:05,431 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:39:05,588 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:39:05,823 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 07:39:05,993 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:39:06,181 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:39:06,438 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:39:06,573 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 07:39:06,734 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 07:39:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:07,643 INFO L93 Difference]: Finished difference Result 2010 states and 2910 transitions. [2019-09-10 07:39:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:39:07,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-09-10 07:39:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:07,654 INFO L225 Difference]: With dead ends: 2010 [2019-09-10 07:39:07,654 INFO L226 Difference]: Without dead ends: 2010 [2019-09-10 07:39:07,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:39:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2019-09-10 07:39:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 526. [2019-09-10 07:39:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-10 07:39:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 739 transitions. [2019-09-10 07:39:07,678 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 739 transitions. Word has length 59 [2019-09-10 07:39:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:07,678 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 739 transitions. [2019-09-10 07:39:07,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:39:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 739 transitions. [2019-09-10 07:39:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:39:07,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:07,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:07,679 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:07,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash -573041072, now seen corresponding path program 1 times [2019-09-10 07:39:07,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:07,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:07,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:08,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:08,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:39:08,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:08,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:39:08,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:39:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:39:08,242 INFO L87 Difference]: Start difference. First operand 526 states and 739 transitions. Second operand 14 states. [2019-09-10 07:39:08,728 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 07:39:08,935 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:39:09,130 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:39:09,288 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:39:09,440 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:39:09,669 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 07:39:10,055 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 07:39:10,243 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:39:10,731 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:39:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:10,857 INFO L93 Difference]: Finished difference Result 2596 states and 3788 transitions. [2019-09-10 07:39:10,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:39:10,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-09-10 07:39:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:10,870 INFO L225 Difference]: With dead ends: 2596 [2019-09-10 07:39:10,870 INFO L226 Difference]: Without dead ends: 2596 [2019-09-10 07:39:10,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:39:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2019-09-10 07:39:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 509. [2019-09-10 07:39:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-09-10 07:39:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 717 transitions. [2019-09-10 07:39:10,895 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 717 transitions. Word has length 60 [2019-09-10 07:39:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:10,896 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 717 transitions. [2019-09-10 07:39:10,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:39:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 717 transitions. [2019-09-10 07:39:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:39:10,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:10,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:10,897 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2089882996, now seen corresponding path program 1 times [2019-09-10 07:39:10,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:10,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:10,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:10,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:11,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:39:11,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:11,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:39:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:39:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:39:11,724 INFO L87 Difference]: Start difference. First operand 509 states and 717 transitions. Second operand 19 states. [2019-09-10 07:39:12,481 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:39:12,690 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:39:13,298 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:39:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:14,843 INFO L93 Difference]: Finished difference Result 3201 states and 4680 transitions. [2019-09-10 07:39:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:39:14,844 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-09-10 07:39:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:14,857 INFO L225 Difference]: With dead ends: 3201 [2019-09-10 07:39:14,858 INFO L226 Difference]: Without dead ends: 3201 [2019-09-10 07:39:14,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:39:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-09-10 07:39:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 503. [2019-09-10 07:39:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-10 07:39:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 708 transitions. [2019-09-10 07:39:14,887 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 708 transitions. Word has length 60 [2019-09-10 07:39:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:14,887 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 708 transitions. [2019-09-10 07:39:14,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:39:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 708 transitions. [2019-09-10 07:39:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:39:14,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:14,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:14,888 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1529221616, now seen corresponding path program 1 times [2019-09-10 07:39:14,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:14,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:14,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:15,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:15,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:39:15,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:15,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:39:15,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:39:15,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:39:15,986 INFO L87 Difference]: Start difference. First operand 503 states and 708 transitions. Second operand 20 states. [2019-09-10 07:39:16,620 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:39:16,764 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:39:16,932 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:39:17,202 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:39:17,377 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:39:17,552 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:39:17,856 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:39:18,055 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:39:18,228 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:39:18,420 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:39:18,729 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:39:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:20,646 INFO L93 Difference]: Finished difference Result 3800 states and 5566 transitions. [2019-09-10 07:39:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 07:39:20,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-09-10 07:39:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:20,666 INFO L225 Difference]: With dead ends: 3800 [2019-09-10 07:39:20,667 INFO L226 Difference]: Without dead ends: 3800 [2019-09-10 07:39:20,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=366, Invalid=1356, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:39:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2019-09-10 07:39:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 503. [2019-09-10 07:39:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-10 07:39:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 707 transitions. [2019-09-10 07:39:20,704 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 707 transitions. Word has length 60 [2019-09-10 07:39:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:20,704 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 707 transitions. [2019-09-10 07:39:20,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:39:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 707 transitions. [2019-09-10 07:39:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:39:20,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:20,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:20,706 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash 464532363, now seen corresponding path program 1 times [2019-09-10 07:39:20,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:21,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:21,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:39:21,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:21,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:39:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:39:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:39:21,171 INFO L87 Difference]: Start difference. First operand 503 states and 707 transitions. Second operand 13 states. [2019-09-10 07:39:21,566 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 07:39:21,721 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:39:21,882 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:39:22,179 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 07:39:22,404 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 07:39:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:22,718 INFO L93 Difference]: Finished difference Result 1744 states and 2535 transitions. [2019-09-10 07:39:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:22,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-10 07:39:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:22,726 INFO L225 Difference]: With dead ends: 1744 [2019-09-10 07:39:22,726 INFO L226 Difference]: Without dead ends: 1744 [2019-09-10 07:39:22,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:39:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-09-10 07:39:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 488. [2019-09-10 07:39:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:39:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 688 transitions. [2019-09-10 07:39:22,742 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 688 transitions. Word has length 60 [2019-09-10 07:39:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:22,742 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 688 transitions. [2019-09-10 07:39:22,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:39:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 688 transitions. [2019-09-10 07:39:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:39:22,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:22,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:22,743 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash -22477888, now seen corresponding path program 1 times [2019-09-10 07:39:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:23,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:23,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:39:23,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:23,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:39:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:39:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:39:23,572 INFO L87 Difference]: Start difference. First operand 488 states and 688 transitions. Second operand 17 states. [2019-09-10 07:39:24,354 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 07:39:24,561 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:39:24,707 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:39:24,858 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:39:25,118 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:39:25,268 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:39:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:26,761 INFO L93 Difference]: Finished difference Result 2154 states and 3141 transitions. [2019-09-10 07:39:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:39:26,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-10 07:39:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:26,770 INFO L225 Difference]: With dead ends: 2154 [2019-09-10 07:39:26,770 INFO L226 Difference]: Without dead ends: 2145 [2019-09-10 07:39:26,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:39:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-09-10 07:39:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 469. [2019-09-10 07:39:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-10 07:39:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 668 transitions. [2019-09-10 07:39:26,789 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 668 transitions. Word has length 61 [2019-09-10 07:39:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:26,790 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 668 transitions. [2019-09-10 07:39:26,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:39:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 668 transitions. [2019-09-10 07:39:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:39:26,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:26,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:26,792 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash 161317224, now seen corresponding path program 1 times [2019-09-10 07:39:26,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:26,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:26,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:26,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:26,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:26,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:26,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:26,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:26,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:26,841 INFO L87 Difference]: Start difference. First operand 469 states and 668 transitions. Second operand 3 states. [2019-09-10 07:39:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:26,866 INFO L93 Difference]: Finished difference Result 815 states and 1144 transitions. [2019-09-10 07:39:26,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:26,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:39:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:26,869 INFO L225 Difference]: With dead ends: 815 [2019-09-10 07:39:26,869 INFO L226 Difference]: Without dead ends: 815 [2019-09-10 07:39:26,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-09-10 07:39:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 803. [2019-09-10 07:39:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-09-10 07:39:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1133 transitions. [2019-09-10 07:39:26,883 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1133 transitions. Word has length 79 [2019-09-10 07:39:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:26,884 INFO L475 AbstractCegarLoop]: Abstraction has 803 states and 1133 transitions. [2019-09-10 07:39:26,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1133 transitions. [2019-09-10 07:39:26,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:39:26,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:26,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:26,885 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash 954765304, now seen corresponding path program 1 times [2019-09-10 07:39:26,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:26,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:26,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:26,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:26,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:26,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:26,928 INFO L87 Difference]: Start difference. First operand 803 states and 1133 transitions. Second operand 3 states. [2019-09-10 07:39:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:26,955 INFO L93 Difference]: Finished difference Result 1054 states and 1479 transitions. [2019-09-10 07:39:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:26,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:39:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:26,959 INFO L225 Difference]: With dead ends: 1054 [2019-09-10 07:39:26,959 INFO L226 Difference]: Without dead ends: 1054 [2019-09-10 07:39:26,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-09-10 07:39:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1041. [2019-09-10 07:39:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-09-10 07:39:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1466 transitions. [2019-09-10 07:39:26,975 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1466 transitions. Word has length 80 [2019-09-10 07:39:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:26,976 INFO L475 AbstractCegarLoop]: Abstraction has 1041 states and 1466 transitions. [2019-09-10 07:39:26,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1466 transitions. [2019-09-10 07:39:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:39:26,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:26,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:26,977 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash 271546837, now seen corresponding path program 1 times [2019-09-10 07:39:26,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:26,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:26,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:27,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:27,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:39:27,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:27,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:39:27,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:39:27,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:39:27,056 INFO L87 Difference]: Start difference. First operand 1041 states and 1466 transitions. Second operand 6 states. [2019-09-10 07:39:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:27,126 INFO L93 Difference]: Finished difference Result 1751 states and 2450 transitions. [2019-09-10 07:39:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:39:27,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-10 07:39:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:27,131 INFO L225 Difference]: With dead ends: 1751 [2019-09-10 07:39:27,131 INFO L226 Difference]: Without dead ends: 1751 [2019-09-10 07:39:27,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2019-09-10 07:39:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1053. [2019-09-10 07:39:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-09-10 07:39:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1473 transitions. [2019-09-10 07:39:27,152 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1473 transitions. Word has length 80 [2019-09-10 07:39:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:27,153 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1473 transitions. [2019-09-10 07:39:27,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:39:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1473 transitions. [2019-09-10 07:39:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:39:27,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:27,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:27,154 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash -109706295, now seen corresponding path program 1 times [2019-09-10 07:39:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:27,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:27,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:27,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:27,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:27,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:27,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:27,209 INFO L87 Difference]: Start difference. First operand 1053 states and 1473 transitions. Second operand 3 states. [2019-09-10 07:39:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:27,228 INFO L93 Difference]: Finished difference Result 1925 states and 2642 transitions. [2019-09-10 07:39:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:27,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:39:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:27,232 INFO L225 Difference]: With dead ends: 1925 [2019-09-10 07:39:27,232 INFO L226 Difference]: Without dead ends: 1925 [2019-09-10 07:39:27,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-09-10 07:39:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1803. [2019-09-10 07:39:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-09-10 07:39:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2491 transitions. [2019-09-10 07:39:27,255 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2491 transitions. Word has length 81 [2019-09-10 07:39:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:27,255 INFO L475 AbstractCegarLoop]: Abstraction has 1803 states and 2491 transitions. [2019-09-10 07:39:27,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2491 transitions. [2019-09-10 07:39:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:39:27,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:27,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:27,257 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash -291437512, now seen corresponding path program 1 times [2019-09-10 07:39:27,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:27,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:27,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:27,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:27,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:27,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:27,302 INFO L87 Difference]: Start difference. First operand 1803 states and 2491 transitions. Second operand 3 states. [2019-09-10 07:39:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:27,322 INFO L93 Difference]: Finished difference Result 3305 states and 4438 transitions. [2019-09-10 07:39:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:27,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:39:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:27,328 INFO L225 Difference]: With dead ends: 3305 [2019-09-10 07:39:27,328 INFO L226 Difference]: Without dead ends: 3305 [2019-09-10 07:39:27,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2019-09-10 07:39:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3063. [2019-09-10 07:39:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-09-10 07:39:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4137 transitions. [2019-09-10 07:39:27,367 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4137 transitions. Word has length 82 [2019-09-10 07:39:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:27,368 INFO L475 AbstractCegarLoop]: Abstraction has 3063 states and 4137 transitions. [2019-09-10 07:39:27,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4137 transitions. [2019-09-10 07:39:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:39:27,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:27,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:39:27,369 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1434685438, now seen corresponding path program 1 times [2019-09-10 07:39:27,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:27,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:27,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:27,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:27,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:27,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:27,418 INFO L87 Difference]: Start difference. First operand 3063 states and 4137 transitions. Second operand 3 states. [2019-09-10 07:39:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:27,440 INFO L93 Difference]: Finished difference Result 3985 states and 5250 transitions. [2019-09-10 07:39:27,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:27,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:39:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:27,449 INFO L225 Difference]: With dead ends: 3985 [2019-09-10 07:39:27,449 INFO L226 Difference]: Without dead ends: 3985 [2019-09-10 07:39:27,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2019-09-10 07:39:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3679. [2019-09-10 07:39:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2019-09-10 07:39:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4869 transitions. [2019-09-10 07:39:27,514 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4869 transitions. Word has length 83 [2019-09-10 07:39:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:27,515 INFO L475 AbstractCegarLoop]: Abstraction has 3679 states and 4869 transitions. [2019-09-10 07:39:27,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4869 transitions. [2019-09-10 07:39:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:39:27,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:27,519 INFO L399 BasicCegarLoop]: trace histogram [2, 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] [2019-09-10 07:39:27,519 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1887526267, now seen corresponding path program 1 times [2019-09-10 07:39:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:27,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:27,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:27,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:27,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:39:27,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:39:27,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 07:39:27,950 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [176], [178], [181], [189], [191], [194], [202], [204], [207], [210], [214], [216], [218], [221], [222], [224], [226], [231], [233], [236], [249], [251], [254], [257], [259], [274], [276], [279], [282], [284], [299], [301], [303], [306], [309], [311], [389], [390], [394], [395], [396] [2019-09-10 07:39:28,009 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:39:28,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:39:28,163 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:39:28,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:39:28,659 INFO L272 AbstractInterpreter]: Visited 97 different actions 501 times. Merged at 38 different actions 348 times. Widened at 14 different actions 44 times. Performed 1625 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 15 different actions. Largest state had 110 variables. [2019-09-10 07:39:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:28,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:39:28,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:39:28,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:39:28,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:28,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:39:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:28,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:39:28,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:39:29,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:29,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:39:29,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:30,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:30,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:39:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2019-09-10 07:39:30,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:39:30,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:39:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:39:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:39:30,910 INFO L87 Difference]: Start difference. First operand 3679 states and 4869 transitions. Second operand 20 states. [2019-09-10 07:39:31,321 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:39:31,841 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:39:32,238 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:39:32,620 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:39:33,311 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:39:33,707 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:39:34,030 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:39:34,318 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:39:34,569 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:39:34,875 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:39:35,217 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:39:35,541 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:39:35,829 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:39:36,160 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:39:38,518 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:39:38,817 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:39:39,093 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:39:39,321 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:39:39,682 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:39:39,989 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:39:40,549 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:39:40,902 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:39:41,162 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:39:41,413 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:39:41,761 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:39:42,041 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:39:42,301 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:39:42,711 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:39:43,055 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:39:43,359 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:39:43,656 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:39:43,994 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:39:44,218 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:39:44,560 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:39:44,930 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:39:45,249 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:39:45,643 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:39:45,897 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:39:46,263 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:39:46,755 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:39:47,047 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:39:47,397 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-10 07:39:47,733 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 07:39:48,027 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:39:48,350 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:39:48,637 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:39:49,025 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:39:49,518 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:39:49,875 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:39:50,158 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:39:50,585 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:39:51,185 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-10 07:39:51,622 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:39:52,081 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:39:52,395 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:39:52,708 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:39:53,243 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:39:53,621 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:39:54,005 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:39:54,372 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:39:54,787 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:39:55,140 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:39:55,647 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-10 07:39:55,987 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:39:56,322 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:39:56,635 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:39:57,237 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 07:39:57,532 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 07:39:57,756 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:39:58,145 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:39:58,611 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-10 07:39:58,962 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-10 07:39:59,515 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:39:59,924 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:40:00,210 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:40:00,652 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:40:00,946 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:40:01,274 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:40:01,591 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:40:02,336 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:40:02,679 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:40:03,056 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-10 07:40:03,443 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-10 07:40:03,838 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:40:04,281 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:40:04,607 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:40:05,149 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:40:05,519 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-09-10 07:40:05,955 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:40:06,356 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-09-10 07:40:06,648 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:40:06,920 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:40:07,533 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:40:07,888 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:40:08,216 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:40:08,590 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:40:08,964 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:40:09,246 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:40:09,566 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:40:09,835 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:40:10,384 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:40:10,739 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:40:11,216 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:40:11,710 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:40:12,207 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:40:12,639 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:40:12,997 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:40:13,288 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:40:13,614 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:40:14,182 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:40:14,634 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:40:15,014 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:40:15,322 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:40:16,355 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:40:16,621 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:40:16,914 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:40:17,249 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:40:17,551 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:40:17,849 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:40:18,286 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:40:18,572 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:40:18,870 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:40:19,171 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:40:19,602 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:40:20,086 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 07:40:20,468 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 07:40:20,959 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:40:21,338 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 07:40:21,617 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:40:21,920 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:40:22,279 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-10 07:40:22,619 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-10 07:40:23,010 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:40:23,313 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:40:23,851 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:40:24,178 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:40:24,473 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:40:24,769 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:40:25,122 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-10 07:40:25,508 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:40:25,861 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-10 07:40:26,182 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:40:26,470 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:40:26,848 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:40:27,252 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:40:27,761 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:40:28,073 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:40:28,319 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 07:40:28,934 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:40:29,338 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:40:29,784 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 07:40:30,112 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:40:30,495 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:40:30,882 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 07:40:31,297 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 07:40:31,598 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 07:40:31,960 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 07:40:32,356 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:40:32,638 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:40:32,962 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:40:33,281 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:40:33,641 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 07:40:34,021 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 07:40:34,308 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:40:34,624 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:40:34,925 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:40:35,392 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:40:35,794 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:40:36,150 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:40:36,478 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-10 07:40:36,825 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 07:40:37,106 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:40:37,533 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:40:38,013 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:40:38,558 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:40:38,852 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:40:39,163 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:40:40,061 WARN L188 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:40:40,425 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:40:40,691 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:40:40,973 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:40:41,293 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:40:41,575 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:40:42,133 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:40:42,431 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 07:40:42,766 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:40:43,089 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:40:43,400 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:40:43,681 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:40:43,950 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:40:44,390 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:40:44,651 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:40:45,020 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:40:45,356 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 07:40:45,839 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-10 07:40:46,183 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 07:40:46,483 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:40:46,772 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 07:40:47,006 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:40:47,314 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 07:40:47,836 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:40:48,121 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:40:48,615 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 07:40:48,953 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:40:49,465 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-10 07:40:49,871 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-09-10 07:40:50,256 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:40:50,529 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:40:50,892 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 07:40:51,259 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:40:51,753 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:40:52,004 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:40:52,483 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:40:52,727 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:40:53,021 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 07:40:53,404 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:40:53,745 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:40:54,144 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:40:54,503 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-10 07:40:54,997 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-10 07:40:55,415 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 07:40:55,749 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:40:56,214 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:40:56,534 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 07:40:56,815 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:40:57,167 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-10 07:40:57,398 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:40:57,715 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:40:58,268 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 07:40:58,593 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:40:58,856 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 07:40:59,480 WARN L188 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-09-10 07:40:59,794 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:41:00,163 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-10 07:41:00,797 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 07:41:01,282 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:41:01,814 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 07:41:02,439 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:41:03,032 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-10 07:41:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:03,292 INFO L93 Difference]: Finished difference Result 64979 states and 83260 transitions. [2019-09-10 07:41:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-10 07:41:03,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-10 07:41:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:03,430 INFO L225 Difference]: With dead ends: 64979 [2019-09-10 07:41:03,431 INFO L226 Difference]: Without dead ends: 64979 [2019-09-10 07:41:03,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 175 SyntacticMatches, 15 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28885 ImplicationChecksByTransitivity, 87.2s TimeCoverageRelationStatistics Valid=10941, Invalid=62771, Unknown=0, NotChecked=0, Total=73712 [2019-09-10 07:41:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64979 states. [2019-09-10 07:41:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64979 to 19544. [2019-09-10 07:41:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19544 states. [2019-09-10 07:41:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19544 states to 19544 states and 25711 transitions. [2019-09-10 07:41:04,246 INFO L78 Accepts]: Start accepts. Automaton has 19544 states and 25711 transitions. Word has length 104 [2019-09-10 07:41:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:04,247 INFO L475 AbstractCegarLoop]: Abstraction has 19544 states and 25711 transitions. [2019-09-10 07:41:04,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:41:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 19544 states and 25711 transitions. [2019-09-10 07:41:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:41:04,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:04,251 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-10 07:41:04,252 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2056347745, now seen corresponding path program 1 times [2019-09-10 07:41:04,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:04,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:04,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:04,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:04,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:04,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:04,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:04,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:04,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:04,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:04,335 INFO L87 Difference]: Start difference. First operand 19544 states and 25711 transitions. Second operand 3 states. [2019-09-10 07:41:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:04,385 INFO L93 Difference]: Finished difference Result 18049 states and 23214 transitions. [2019-09-10 07:41:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:04,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:41:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:04,410 INFO L225 Difference]: With dead ends: 18049 [2019-09-10 07:41:04,411 INFO L226 Difference]: Without dead ends: 18049 [2019-09-10 07:41:04,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18049 states. [2019-09-10 07:41:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18049 to 17967. [2019-09-10 07:41:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17967 states. [2019-09-10 07:41:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17967 states to 17967 states and 23117 transitions. [2019-09-10 07:41:05,313 INFO L78 Accepts]: Start accepts. Automaton has 17967 states and 23117 transitions. Word has length 104 [2019-09-10 07:41:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:05,314 INFO L475 AbstractCegarLoop]: Abstraction has 17967 states and 23117 transitions. [2019-09-10 07:41:05,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17967 states and 23117 transitions. [2019-09-10 07:41:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:41:05,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:05,319 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:41:05,320 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2017194729, now seen corresponding path program 1 times [2019-09-10 07:41:05,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:05,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:05,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:05,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:05,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:05,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 07:41:05,706 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [189], [191], [194], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [249], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [389], [390], [394], [395], [396] [2019-09-10 07:41:05,715 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:05,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:05,736 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:05,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:05,972 INFO L272 AbstractInterpreter]: Visited 99 different actions 446 times. Merged at 41 different actions 308 times. Widened at 14 different actions 49 times. Performed 1487 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1487 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 12 different actions. Largest state had 110 variables. [2019-09-10 07:41:05,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:05,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:05,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:05,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:41:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:05,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:06,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:41:06,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:06,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:06,690 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:06,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:07,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:07,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:41:07,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2019-09-10 07:41:07,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:41:07,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:41:07,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:41:07,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:41:07,890 INFO L87 Difference]: Start difference. First operand 17967 states and 23117 transitions. Second operand 20 states. [2019-09-10 07:41:08,181 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:41:08,461 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:41:08,812 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:41:09,171 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:41:09,511 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:41:09,792 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:41:10,002 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:41:10,253 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:41:10,639 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:41:10,897 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:41:11,155 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:41:11,390 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:41:11,643 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:41:12,013 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:41:12,225 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:41:12,425 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:41:12,710 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:41:13,002 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:41:13,187 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:41:13,384 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:41:13,671 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:41:13,874 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:41:14,131 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:41:14,532 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:41:14,800 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:41:15,147 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:41:15,377 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:41:15,768 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:41:15,982 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:41:16,207 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:41:16,472 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:41:16,729 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:41:17,005 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:41:17,276 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:41:17,574 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:41:17,749 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:41:18,061 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:41:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:18,301 INFO L93 Difference]: Finished difference Result 96689 states and 122268 transitions. [2019-09-10 07:41:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 07:41:18,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2019-09-10 07:41:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:18,416 INFO L225 Difference]: With dead ends: 96689 [2019-09-10 07:41:18,416 INFO L226 Difference]: Without dead ends: 96689 [2019-09-10 07:41:18,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 181 SyntacticMatches, 15 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1201, Invalid=3089, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 07:41:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96689 states. [2019-09-10 07:41:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96689 to 44109. [2019-09-10 07:41:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44109 states. [2019-09-10 07:41:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44109 states to 44109 states and 56679 transitions. [2019-09-10 07:41:19,301 INFO L78 Accepts]: Start accepts. Automaton has 44109 states and 56679 transitions. Word has length 105 [2019-09-10 07:41:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:19,301 INFO L475 AbstractCegarLoop]: Abstraction has 44109 states and 56679 transitions. [2019-09-10 07:41:19,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:41:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 44109 states and 56679 transitions. [2019-09-10 07:41:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:41:19,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:19,310 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:41:19,310 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:19,311 INFO L82 PathProgramCache]: Analyzing trace with hash -530573863, now seen corresponding path program 1 times [2019-09-10 07:41:19,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:19,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:19,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:19,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:19,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:19,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:41:19,503 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [299], [301], [303], [306], [309], [311], [329], [334], [389], [390], [394], [395], [396] [2019-09-10 07:41:19,505 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:19,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:19,518 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:19,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:19,699 INFO L272 AbstractInterpreter]: Visited 100 different actions 334 times. Merged at 41 different actions 206 times. Widened at 8 different actions 12 times. Performed 1175 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1175 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 6 different actions. Largest state had 110 variables. [2019-09-10 07:41:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:19,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:19,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:19,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:41:19,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:19,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:19,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:41:19,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:19,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:19,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:20,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:20,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:20,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:20,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:21,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:21,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:41:21,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:41:21,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:41:21,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:41:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:41:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:41:21,992 INFO L87 Difference]: Start difference. First operand 44109 states and 56679 transitions. Second operand 20 states. [2019-09-10 07:41:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:28,885 INFO L93 Difference]: Finished difference Result 159577 states and 204003 transitions. [2019-09-10 07:41:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 07:41:28,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-10 07:41:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:29,038 INFO L225 Difference]: With dead ends: 159577 [2019-09-10 07:41:29,038 INFO L226 Difference]: Without dead ends: 159577 [2019-09-10 07:41:29,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 168 SyntacticMatches, 25 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3773 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2167, Invalid=8545, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 07:41:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159577 states. [2019-09-10 07:41:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159577 to 67711. [2019-09-10 07:41:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67711 states. [2019-09-10 07:41:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67711 states to 67711 states and 86725 transitions. [2019-09-10 07:41:30,111 INFO L78 Accepts]: Start accepts. Automaton has 67711 states and 86725 transitions. Word has length 106 [2019-09-10 07:41:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:30,111 INFO L475 AbstractCegarLoop]: Abstraction has 67711 states and 86725 transitions. [2019-09-10 07:41:30,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:41:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 67711 states and 86725 transitions. [2019-09-10 07:41:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:41:30,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:30,120 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-10 07:41:30,121 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 795611084, now seen corresponding path program 1 times [2019-09-10 07:41:30,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:30,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:30,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:30,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:30,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:30,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:30,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:30,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:30,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:30,180 INFO L87 Difference]: Start difference. First operand 67711 states and 86725 transitions. Second operand 3 states. [2019-09-10 07:41:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:30,280 INFO L93 Difference]: Finished difference Result 37642 states and 46863 transitions. [2019-09-10 07:41:30,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:30,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:41:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:30,317 INFO L225 Difference]: With dead ends: 37642 [2019-09-10 07:41:30,317 INFO L226 Difference]: Without dead ends: 37642 [2019-09-10 07:41:30,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2019-09-10 07:41:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 37640. [2019-09-10 07:41:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37640 states. [2019-09-10 07:41:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37640 states to 37640 states and 46862 transitions. [2019-09-10 07:41:30,906 INFO L78 Accepts]: Start accepts. Automaton has 37640 states and 46862 transitions. Word has length 106 [2019-09-10 07:41:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:30,907 INFO L475 AbstractCegarLoop]: Abstraction has 37640 states and 46862 transitions. [2019-09-10 07:41:30,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 37640 states and 46862 transitions. [2019-09-10 07:41:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:41:30,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:30,915 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:41:30,915 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash -839839732, now seen corresponding path program 1 times [2019-09-10 07:41:30,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:30,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:30,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:30,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:31,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:31,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:31,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:41:31,328 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [389], [390], [394], [395], [396] [2019-09-10 07:41:31,334 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:31,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:31,345 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:31,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:31,604 INFO L272 AbstractInterpreter]: Visited 100 different actions 464 times. Merged at 42 different actions 324 times. Widened at 13 different actions 47 times. Performed 1523 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1523 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 11 different actions. Largest state had 110 variables. [2019-09-10 07:41:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:31,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:31,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:31,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:31,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:31,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:41:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:31,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:41:31,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:32,626 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 07:41:33,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 07:41:33,898 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 07:41:33,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 07:41:34,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:34,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:41:34,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:35,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:41:36,074 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:41:36,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 18] imperfect sequences [19] total 51 [2019-09-10 07:41:36,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:36,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:41:36,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:41:36,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2344, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:41:36,075 INFO L87 Difference]: Start difference. First operand 37640 states and 46862 transitions. Second operand 18 states. [2019-09-10 07:41:36,659 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 07:41:38,273 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 07:41:38,992 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 116 [2019-09-10 07:41:40,640 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 70 [2019-09-10 07:41:45,144 WARN L188 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 07:41:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:50,388 INFO L93 Difference]: Finished difference Result 86455 states and 108112 transitions. [2019-09-10 07:41:50,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:41:50,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2019-09-10 07:41:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:50,458 INFO L225 Difference]: With dead ends: 86455 [2019-09-10 07:41:50,458 INFO L226 Difference]: Without dead ends: 86455 [2019-09-10 07:41:50,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 173 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 07:41:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86455 states. [2019-09-10 07:41:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86455 to 37634. [2019-09-10 07:41:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37634 states. [2019-09-10 07:41:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37634 states to 37634 states and 46855 transitions. [2019-09-10 07:41:51,089 INFO L78 Accepts]: Start accepts. Automaton has 37634 states and 46855 transitions. Word has length 106 [2019-09-10 07:41:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:51,089 INFO L475 AbstractCegarLoop]: Abstraction has 37634 states and 46855 transitions. [2019-09-10 07:41:51,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:41:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 37634 states and 46855 transitions. [2019-09-10 07:41:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:41:51,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:51,095 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:41:51,096 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2059640868, now seen corresponding path program 1 times [2019-09-10 07:41:51,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:51,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:51,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:51,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:51,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:51,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:51,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:41:51,423 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [189], [191], [194], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [249], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [339], [344], [389], [390], [394], [395], [396] [2019-09-10 07:41:51,426 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:51,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:51,442 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:51,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:51,624 INFO L272 AbstractInterpreter]: Visited 100 different actions 419 times. Merged at 41 different actions 283 times. Widened at 13 different actions 37 times. Performed 1392 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 110 variables. [2019-09-10 07:41:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:51,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:51,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:51,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:51,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:51,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:41:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:51,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:41:51,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:51,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:51,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:51,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:52,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:52,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:52,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:52,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:52,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:52,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:52,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:53,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:53,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:41:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2019-09-10 07:41:53,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:41:53,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:41:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:41:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:41:53,164 INFO L87 Difference]: Start difference. First operand 37634 states and 46855 transitions. Second operand 22 states. [2019-09-10 07:41:53,557 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-09-10 07:41:55,300 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 31 [2019-09-10 07:41:55,784 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-09-10 07:41:56,357 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-09-10 07:41:57,499 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-10 07:41:58,526 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-09-10 07:42:00,349 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-09-10 07:42:00,501 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2019-09-10 07:42:01,165 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-09-10 07:42:01,734 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-09-10 07:42:01,876 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 07:42:02,009 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-09-10 07:42:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:03,591 INFO L93 Difference]: Finished difference Result 143492 states and 176586 transitions. [2019-09-10 07:42:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 07:42:03,592 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 106 [2019-09-10 07:42:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:03,717 INFO L225 Difference]: With dead ends: 143492 [2019-09-10 07:42:03,718 INFO L226 Difference]: Without dead ends: 143492 [2019-09-10 07:42:03,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 178 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2114, Invalid=8392, Unknown=0, NotChecked=0, Total=10506 [2019-09-10 07:42:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143492 states. [2019-09-10 07:42:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143492 to 37610. [2019-09-10 07:42:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37610 states. [2019-09-10 07:42:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37610 states to 37610 states and 46830 transitions. [2019-09-10 07:42:04,657 INFO L78 Accepts]: Start accepts. Automaton has 37610 states and 46830 transitions. Word has length 106 [2019-09-10 07:42:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:04,658 INFO L475 AbstractCegarLoop]: Abstraction has 37610 states and 46830 transitions. [2019-09-10 07:42:04,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:42:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 37610 states and 46830 transitions. [2019-09-10 07:42:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:42:04,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:04,662 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:04,663 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1416503901, now seen corresponding path program 1 times [2019-09-10 07:42:04,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:04,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:04,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:04,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:04,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:04,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:42:04,888 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [274], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:42:04,891 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:04,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:04,911 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:05,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:05,087 INFO L272 AbstractInterpreter]: Visited 100 different actions 402 times. Merged at 41 different actions 266 times. Widened at 14 different actions 34 times. Performed 1325 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1325 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 11 different actions. Largest state had 110 variables. [2019-09-10 07:42:05,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:05,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:05,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:05,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:42:05,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:05,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:42:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:05,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:42:05,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:05,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:05,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:05,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:05,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:05,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:05,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:05,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:06,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:06,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:06,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:06,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:06,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:06,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2019-09-10 07:42:06,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:06,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:42:06,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:42:06,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:42:06,700 INFO L87 Difference]: Start difference. First operand 37610 states and 46830 transitions. Second operand 20 states. [2019-09-10 07:42:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:12,990 INFO L93 Difference]: Finished difference Result 134402 states and 166572 transitions. [2019-09-10 07:42:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 07:42:12,991 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-10 07:42:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:13,095 INFO L225 Difference]: With dead ends: 134402 [2019-09-10 07:42:13,096 INFO L226 Difference]: Without dead ends: 134402 [2019-09-10 07:42:13,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 180 SyntacticMatches, 13 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1532, Invalid=5950, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 07:42:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134402 states. [2019-09-10 07:42:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134402 to 37592. [2019-09-10 07:42:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37592 states. [2019-09-10 07:42:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37592 states to 37592 states and 46811 transitions. [2019-09-10 07:42:13,718 INFO L78 Accepts]: Start accepts. Automaton has 37592 states and 46811 transitions. Word has length 106 [2019-09-10 07:42:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:13,718 INFO L475 AbstractCegarLoop]: Abstraction has 37592 states and 46811 transitions. [2019-09-10 07:42:13,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:42:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 37592 states and 46811 transitions. [2019-09-10 07:42:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:42:13,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:13,722 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:13,722 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -897654530, now seen corresponding path program 1 times [2019-09-10 07:42:13,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:13,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:14,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:14,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:14,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:42:14,257 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [329], [334], [389], [390], [394], [395], [396] [2019-09-10 07:42:14,258 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:14,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:14,270 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:14,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:14,402 INFO L272 AbstractInterpreter]: Visited 101 different actions 352 times. Merged at 42 different actions 223 times. Widened at 11 different actions 21 times. Performed 1186 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1186 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 10 different actions. Largest state had 110 variables. [2019-09-10 07:42:14,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:14,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:14,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:14,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:42:14,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:14,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:42:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:14,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:42:14,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:14,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:14,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:14,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:15,384 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-10 07:42:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:15,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:15,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 39 [2019-09-10 07:42:15,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:15,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:42:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:42:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:42:15,630 INFO L87 Difference]: Start difference. First operand 37592 states and 46811 transitions. Second operand 30 states. [2019-09-10 07:42:18,014 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:42:18,200 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:42:18,451 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 07:42:18,690 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:19,175 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:19,608 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:42:20,138 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:21,052 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:42:21,233 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:42:21,692 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:42:21,862 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:42:22,020 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:42:22,247 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:22,424 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:22,596 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:42:23,076 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:42:23,282 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 07:42:23,851 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 07:42:24,076 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 07:42:24,424 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:42:24,723 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 07:42:24,984 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:42:25,193 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:42:25,533 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 07:42:25,749 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:26,174 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:42:26,350 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:42:26,761 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 07:42:26,958 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 07:42:27,154 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:42:27,380 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:42:27,659 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:42:27,853 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 07:42:28,021 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:42:28,447 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:42:29,053 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:42:30,313 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:42:30,733 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:31,298 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:42:31,608 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:42:32,044 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:42:32,834 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:42:33,179 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 07:42:33,731 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:42:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:34,960 INFO L93 Difference]: Finished difference Result 124182 states and 153794 transitions. [2019-09-10 07:42:34,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-10 07:42:34,960 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 107 [2019-09-10 07:42:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:35,069 INFO L225 Difference]: With dead ends: 124182 [2019-09-10 07:42:35,069 INFO L226 Difference]: Without dead ends: 124182 [2019-09-10 07:42:35,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6527 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=2997, Invalid=19353, Unknown=0, NotChecked=0, Total=22350 [2019-09-10 07:42:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124182 states. [2019-09-10 07:42:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124182 to 64008. [2019-09-10 07:42:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64008 states. [2019-09-10 07:42:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64008 states to 64008 states and 79730 transitions. [2019-09-10 07:42:36,068 INFO L78 Accepts]: Start accepts. Automaton has 64008 states and 79730 transitions. Word has length 107 [2019-09-10 07:42:36,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:36,069 INFO L475 AbstractCegarLoop]: Abstraction has 64008 states and 79730 transitions. [2019-09-10 07:42:36,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:42:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 64008 states and 79730 transitions. [2019-09-10 07:42:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:42:36,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:36,072 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:36,073 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:36,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:36,073 INFO L82 PathProgramCache]: Analyzing trace with hash 988012191, now seen corresponding path program 1 times [2019-09-10 07:42:36,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:36,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:36,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:36,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:36,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:36,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:36,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:36,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:42:36,451 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [339], [344], [389], [390], [394], [395], [396] [2019-09-10 07:42:36,456 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:36,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:36,466 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:36,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:36,619 INFO L272 AbstractInterpreter]: Visited 101 different actions 385 times. Merged at 42 different actions 251 times. Widened at 12 different actions 30 times. Performed 1293 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1293 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 14 different actions. Largest state had 110 variables. [2019-09-10 07:42:36,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:36,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:36,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:36,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:42:36,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:36,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:42:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:36,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:42:36,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:36,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:36,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:36,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:36,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:37,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:37,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:37,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:37,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2019-09-10 07:42:37,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:37,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 07:42:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 07:42:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1214, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:42:37,644 INFO L87 Difference]: Start difference. First operand 64008 states and 79730 transitions. Second operand 27 states. [2019-09-10 07:42:40,269 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 07:42:40,604 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 07:42:41,315 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 07:42:41,636 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-09-10 07:42:45,899 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 07:42:46,463 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:42:46,614 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 07:42:47,860 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:42:53,573 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:42:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:54,985 INFO L93 Difference]: Finished difference Result 198535 states and 246341 transitions. [2019-09-10 07:42:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-10 07:42:54,986 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2019-09-10 07:42:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:55,175 INFO L225 Difference]: With dead ends: 198535 [2019-09-10 07:42:55,175 INFO L226 Difference]: Without dead ends: 198535 [2019-09-10 07:42:55,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9225 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3706, Invalid=24350, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 07:42:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198535 states. [2019-09-10 07:42:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198535 to 111371. [2019-09-10 07:42:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111371 states. [2019-09-10 07:42:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111371 states to 111371 states and 138782 transitions. [2019-09-10 07:42:56,693 INFO L78 Accepts]: Start accepts. Automaton has 111371 states and 138782 transitions. Word has length 107 [2019-09-10 07:42:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:56,694 INFO L475 AbstractCegarLoop]: Abstraction has 111371 states and 138782 transitions. [2019-09-10 07:42:56,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 07:42:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 111371 states and 138782 transitions. [2019-09-10 07:42:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:42:56,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:56,701 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:56,701 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:56,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1256248256, now seen corresponding path program 1 times [2019-09-10 07:42:56,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:56,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:56,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:57,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:57,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:57,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:42:57,090 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:42:57,092 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:57,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:57,102 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:57,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:57,284 INFO L272 AbstractInterpreter]: Visited 101 different actions 447 times. Merged at 42 different actions 309 times. Widened at 11 different actions 40 times. Performed 1472 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1472 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 10 different actions. Largest state had 110 variables. [2019-09-10 07:42:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:57,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:57,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:57,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:42:57,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:57,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:42:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:57,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 07:42:57,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:57,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:57,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:58,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 51 [2019-09-10 07:42:59,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:59,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:42:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:42:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2372, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:42:59,521 INFO L87 Difference]: Start difference. First operand 111371 states and 138782 transitions. Second operand 35 states. [2019-09-10 07:43:00,959 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:43:01,247 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 07:43:02,068 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 07:43:02,373 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:43:02,988 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:43:03,469 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-10 07:43:04,887 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 07:43:06,350 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:43:06,659 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:43:07,006 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:43:07,283 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:43:07,591 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:43:07,960 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:43:08,640 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:43:08,955 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:43:09,287 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:43:09,747 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:43:11,051 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:43:11,366 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:43:11,858 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:43:13,043 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:43:13,286 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:43:13,533 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:43:13,856 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:43:14,167 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:43:14,568 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:43:14,861 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:43:15,735 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:43:16,438 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:43:16,806 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:43:17,176 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 07:43:17,809 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:43:18,079 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:43:19,854 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 07:43:21,710 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:43:21,992 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:43:22,192 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:43:22,534 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:43:22,863 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 07:43:23,271 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:43:23,647 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:43:24,085 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:43:24,553 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 07:43:24,801 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 07:43:25,137 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:43:25,617 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:43:25,816 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:43:26,266 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 07:43:26,652 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 07:43:26,922 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:43:27,202 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:43:27,731 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:43:27,932 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:43:28,254 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:43:28,511 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:43:28,895 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:43:29,142 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:43:30,057 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:43:30,417 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:43:30,712 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:43:30,963 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:43:31,369 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:43:32,160 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:43:32,443 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:43:32,767 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:43:33,221 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:43:33,677 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:43:33,997 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 07:43:34,253 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 07:43:34,644 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:43:34,820 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 07:43:35,136 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:43:35,755 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 07:43:36,015 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 07:43:37,545 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 07:43:38,072 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:43:38,541 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:43:38,842 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:43:39,177 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 07:43:39,448 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:43:39,809 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:43:40,116 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:43:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:40,311 INFO L93 Difference]: Finished difference Result 258831 states and 320463 transitions. [2019-09-10 07:43:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-10 07:43:40,312 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2019-09-10 07:43:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:40,576 INFO L225 Difference]: With dead ends: 258831 [2019-09-10 07:43:40,576 INFO L226 Difference]: Without dead ends: 258831 [2019-09-10 07:43:40,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11837 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=5225, Invalid=32995, Unknown=0, NotChecked=0, Total=38220 [2019-09-10 07:43:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258831 states. [2019-09-10 07:43:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258831 to 119385. [2019-09-10 07:43:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119385 states. [2019-09-10 07:43:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119385 states to 119385 states and 148702 transitions. [2019-09-10 07:43:42,359 INFO L78 Accepts]: Start accepts. Automaton has 119385 states and 148702 transitions. Word has length 107 [2019-09-10 07:43:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:42,360 INFO L475 AbstractCegarLoop]: Abstraction has 119385 states and 148702 transitions. [2019-09-10 07:43:42,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 07:43:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 119385 states and 148702 transitions. [2019-09-10 07:43:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:43:42,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:42,366 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:43:42,367 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:42,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1511704451, now seen corresponding path program 1 times [2019-09-10 07:43:42,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:42,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:42,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:42,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:43:42,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:43:42,849 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:43:42,853 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:43:42,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:43:42,862 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:43:43,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:43:43,046 INFO L272 AbstractInterpreter]: Visited 101 different actions 468 times. Merged at 42 different actions 327 times. Widened at 13 different actions 44 times. Performed 1550 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 11 different actions. Largest state had 110 variables. [2019-09-10 07:43:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:43,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:43:43,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:43,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:43:43,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:43,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:43:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:43,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:43:43,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:43:43,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:43,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:43,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:43,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:43,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:43:43,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:44,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:43:44,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 41 [2019-09-10 07:43:44,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:43:44,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 07:43:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 07:43:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1520, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:43:44,067 INFO L87 Difference]: Start difference. First operand 119385 states and 148702 transitions. Second operand 31 states. [2019-09-10 07:43:44,280 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 07:43:44,482 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 07:44:02,855 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:44:03,090 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:44:05,575 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:44:06,158 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:44:08,307 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 07:44:09,134 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:44:13,365 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:44:13,751 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:44:18,469 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:44:24,319 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:44:33,076 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:44:35,267 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:44:39,849 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:44:40,577 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:44:44,716 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:44:45,173 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:44:45,786 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:44:46,473 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:44:46,883 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:44:49,160 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:44:55,431 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:44:57,922 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:45:02,167 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:45:02,382 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:45:02,558 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:45:02,898 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:45:03,080 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:45:08,066 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:45:10,640 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:45:15,291 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:45:24,140 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:45:24,351 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:45:24,605 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:45:26,913 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:45:27,239 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:45:29,594 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:45:31,855 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:45:33,247 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:45:37,590 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:45:46,245 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:45:49,448 WARN L188 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:45:49,823 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:45:56,584 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:45:59,236 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:45:59,628 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:46:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:06,433 INFO L93 Difference]: Finished difference Result 249238 states and 311378 transitions. [2019-09-10 07:46:06,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-10 07:46:06,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2019-09-10 07:46:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:06,676 INFO L225 Difference]: With dead ends: 249238 [2019-09-10 07:46:06,676 INFO L226 Difference]: Without dead ends: 249238 [2019-09-10 07:46:06,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 96.2s TimeCoverageRelationStatistics Valid=4136, Invalid=25966, Unknown=0, NotChecked=0, Total=30102 [2019-09-10 07:46:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249238 states. [2019-09-10 07:46:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249238 to 135201. [2019-09-10 07:46:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135201 states. [2019-09-10 07:46:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135201 states to 135201 states and 168342 transitions. [2019-09-10 07:46:08,486 INFO L78 Accepts]: Start accepts. Automaton has 135201 states and 168342 transitions. Word has length 107 [2019-09-10 07:46:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:08,486 INFO L475 AbstractCegarLoop]: Abstraction has 135201 states and 168342 transitions. [2019-09-10 07:46:08,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 07:46:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 135201 states and 168342 transitions. [2019-09-10 07:46:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:46:08,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:08,494 INFO L399 BasicCegarLoop]: trace histogram [2, 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] [2019-09-10 07:46:08,494 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -429394752, now seen corresponding path program 1 times [2019-09-10 07:46:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:08,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:08,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:09,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:09,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:09,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:46:09,463 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [174], [176], [178], [181], [184], [187], [189], [191], [194], [197], [200], [202], [204], [207], [210], [214], [216], [218], [221], [222], [224], [226], [231], [233], [236], [251], [254], [257], [259], [276], [279], [282], [284], [301], [303], [306], [309], [311], [329], [334], [389], [390], [394], [395], [396] [2019-09-10 07:46:09,467 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:09,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:09,480 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:09,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:09,718 INFO L272 AbstractInterpreter]: Visited 101 different actions 610 times. Merged at 41 different actions 445 times. Widened at 15 different actions 93 times. Performed 1940 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1940 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 66 fixpoints after 16 different actions. Largest state had 110 variables. [2019-09-10 07:46:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:09,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:09,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:09,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:09,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:09,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:46:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:09,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 07:46:09,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:46:10,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:46:10,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:10,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 6, 7] total 37 [2019-09-10 07:46:10,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:10,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:46:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:46:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1222, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:46:10,324 INFO L87 Difference]: Start difference. First operand 135201 states and 168342 transitions. Second operand 32 states. [2019-09-10 07:46:11,590 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 07:46:11,811 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 07:46:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:22,859 INFO L93 Difference]: Finished difference Result 168038 states and 208235 transitions. [2019-09-10 07:46:22,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 07:46:22,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 108 [2019-09-10 07:46:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:23,034 INFO L225 Difference]: With dead ends: 168038 [2019-09-10 07:46:23,034 INFO L226 Difference]: Without dead ends: 168038 [2019-09-10 07:46:23,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=807, Invalid=7203, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 07:46:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168038 states. [2019-09-10 07:46:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168038 to 143742. [2019-09-10 07:46:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143742 states. [2019-09-10 07:46:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143742 states to 143742 states and 178915 transitions. [2019-09-10 07:46:24,141 INFO L78 Accepts]: Start accepts. Automaton has 143742 states and 178915 transitions. Word has length 108 [2019-09-10 07:46:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:24,141 INFO L475 AbstractCegarLoop]: Abstraction has 143742 states and 178915 transitions. [2019-09-10 07:46:24,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:46:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 143742 states and 178915 transitions. [2019-09-10 07:46:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:46:24,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:24,148 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:46:24,148 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash -682272672, now seen corresponding path program 1 times [2019-09-10 07:46:24,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:24,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:24,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:24,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:24,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:24,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:24,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:24,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:24,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:24,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:24,205 INFO L87 Difference]: Start difference. First operand 143742 states and 178915 transitions. Second operand 3 states. [2019-09-10 07:46:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:24,383 INFO L93 Difference]: Finished difference Result 90932 states and 109871 transitions. [2019-09-10 07:46:24,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:24,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 07:46:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:24,466 INFO L225 Difference]: With dead ends: 90932 [2019-09-10 07:46:24,466 INFO L226 Difference]: Without dead ends: 90932 [2019-09-10 07:46:24,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90932 states. [2019-09-10 07:46:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90932 to 87303. [2019-09-10 07:46:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87303 states. [2019-09-10 07:46:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87303 states to 87303 states and 105487 transitions. [2019-09-10 07:46:27,569 INFO L78 Accepts]: Start accepts. Automaton has 87303 states and 105487 transitions. Word has length 108 [2019-09-10 07:46:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:27,570 INFO L475 AbstractCegarLoop]: Abstraction has 87303 states and 105487 transitions. [2019-09-10 07:46:27,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 87303 states and 105487 transitions. [2019-09-10 07:46:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:46:27,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:27,575 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:46:27,575 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:27,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1916580899, now seen corresponding path program 1 times [2019-09-10 07:46:27,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:27,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:27,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:46:27,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:27,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:27,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:27,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:27,622 INFO L87 Difference]: Start difference. First operand 87303 states and 105487 transitions. Second operand 3 states. [2019-09-10 07:46:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:27,774 INFO L93 Difference]: Finished difference Result 47111 states and 55860 transitions. [2019-09-10 07:46:27,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:27,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 07:46:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:27,823 INFO L225 Difference]: With dead ends: 47111 [2019-09-10 07:46:27,823 INFO L226 Difference]: Without dead ends: 47111 [2019-09-10 07:46:27,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47111 states. [2019-09-10 07:46:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47111 to 47111. [2019-09-10 07:46:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47111 states. [2019-09-10 07:46:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47111 states to 47111 states and 55860 transitions. [2019-09-10 07:46:28,264 INFO L78 Accepts]: Start accepts. Automaton has 47111 states and 55860 transitions. Word has length 108 [2019-09-10 07:46:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:28,265 INFO L475 AbstractCegarLoop]: Abstraction has 47111 states and 55860 transitions. [2019-09-10 07:46:28,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 47111 states and 55860 transitions. [2019-09-10 07:46:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:46:28,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:28,268 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:46:28,268 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 435973576, now seen corresponding path program 1 times [2019-09-10 07:46:28,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:28,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:28,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:36,587 WARN L188 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-09-10 07:46:42,662 WARN L188 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-09-10 07:46:48,742 WARN L188 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-09-10 07:46:50,872 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-09-10 07:46:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:55,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:55,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:55,148 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:46:55,148 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [303], [306], [309], [311], [329], [334], [339], [344], [389], [390], [394], [395], [396] [2019-09-10 07:46:55,150 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:55,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:55,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:55,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:55,287 INFO L272 AbstractInterpreter]: Visited 102 different actions 377 times. Merged at 42 different actions 246 times. Widened at 11 different actions 22 times. Performed 1255 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 10 different actions. Largest state had 110 variables. [2019-09-10 07:46:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:55,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:55,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:55,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:55,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:55,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:46:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:55,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:46:55,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:59,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:59,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:18,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:20,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:24,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:29,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:31,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:31,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 12] total 40 [2019-09-10 07:47:31,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:31,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 07:47:31,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 07:47:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1421, Unknown=6, NotChecked=0, Total=1560 [2019-09-10 07:47:31,313 INFO L87 Difference]: Start difference. First operand 47111 states and 55860 transitions. Second operand 31 states. [2019-09-10 07:47:35,855 WARN L188 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 07:47:36,126 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:47:44,862 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-09-10 07:47:52,255 WARN L188 SmtUtils]: Spent 7.30 s on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:47:52,637 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:47:53,065 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:47:57,539 WARN L188 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:47:58,755 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:48:01,774 WARN L188 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:48:03,041 WARN L188 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 07:48:05,751 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-10 07:48:07,354 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:48:08,642 WARN L188 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-09-10 07:48:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:08,780 INFO L93 Difference]: Finished difference Result 52645 states and 61797 transitions. [2019-09-10 07:48:08,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:48:08,780 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 108 [2019-09-10 07:48:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:08,823 INFO L225 Difference]: With dead ends: 52645 [2019-09-10 07:48:08,823 INFO L226 Difference]: Without dead ends: 52645 [2019-09-10 07:48:08,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 190 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=668, Invalid=3745, Unknown=9, NotChecked=0, Total=4422 [2019-09-10 07:48:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52645 states. [2019-09-10 07:48:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52645 to 43485. [2019-09-10 07:48:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43485 states. [2019-09-10 07:48:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43485 states to 43485 states and 51482 transitions. [2019-09-10 07:48:09,139 INFO L78 Accepts]: Start accepts. Automaton has 43485 states and 51482 transitions. Word has length 108 [2019-09-10 07:48:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:09,140 INFO L475 AbstractCegarLoop]: Abstraction has 43485 states and 51482 transitions. [2019-09-10 07:48:09,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 07:48:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43485 states and 51482 transitions. [2019-09-10 07:48:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:48:09,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:09,142 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:48:09,143 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash 780109983, now seen corresponding path program 1 times [2019-09-10 07:48:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:09,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:09,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:09,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:09,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:09,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:48:09,680 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [303], [306], [309], [311], [339], [344], [389], [390], [394], [395], [396] [2019-09-10 07:48:09,682 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:09,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:09,690 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:09,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:09,892 INFO L272 AbstractInterpreter]: Visited 100 different actions 423 times. Merged at 41 different actions 287 times. Widened at 13 different actions 36 times. Performed 1451 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1451 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 12 different actions. Largest state had 110 variables. [2019-09-10 07:48:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:09,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:09,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:09,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:09,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:09,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:10,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 07:48:10,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:10,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:11,407 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:11,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:11,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:12,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:12,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:12,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:12,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:12,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:12,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 18] total 54 [2019-09-10 07:48:12,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:12,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:48:12,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:48:12,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2582, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:48:12,668 INFO L87 Difference]: Start difference. First operand 43485 states and 51482 transitions. Second operand 39 states. [2019-09-10 07:48:17,112 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 07:48:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:23,833 INFO L93 Difference]: Finished difference Result 54030 states and 64092 transitions. [2019-09-10 07:48:23,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 07:48:23,835 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 108 [2019-09-10 07:48:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:23,878 INFO L225 Difference]: With dead ends: 54030 [2019-09-10 07:48:23,879 INFO L226 Difference]: Without dead ends: 54030 [2019-09-10 07:48:23,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1091, Invalid=7098, Unknown=1, NotChecked=0, Total=8190 [2019-09-10 07:48:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54030 states. [2019-09-10 07:48:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54030 to 48552. [2019-09-10 07:48:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48552 states. [2019-09-10 07:48:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48552 states to 48552 states and 57536 transitions. [2019-09-10 07:48:24,208 INFO L78 Accepts]: Start accepts. Automaton has 48552 states and 57536 transitions. Word has length 108 [2019-09-10 07:48:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:24,209 INFO L475 AbstractCegarLoop]: Abstraction has 48552 states and 57536 transitions. [2019-09-10 07:48:24,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 07:48:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 48552 states and 57536 transitions. [2019-09-10 07:48:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:48:24,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:24,212 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:48:24,212 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1797686574, now seen corresponding path program 1 times [2019-09-10 07:48:24,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:24,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:24,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:24,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:24,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:24,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:48:24,677 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [339], [344], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:48:24,680 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:24,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:24,692 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:24,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:24,884 INFO L272 AbstractInterpreter]: Visited 102 different actions 429 times. Merged at 42 different actions 292 times. Widened at 12 different actions 33 times. Performed 1421 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1421 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 11 different actions. Largest state had 110 variables. [2019-09-10 07:48:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:24,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:24,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:24,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:48:24,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:24,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:24,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:48:24,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:25,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:25,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:25,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:25,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:42,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:42,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:42,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:42,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:42,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 27 [2019-09-10 07:48:42,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:42,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 07:48:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 07:48:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:48:42,868 INFO L87 Difference]: Start difference. First operand 48552 states and 57536 transitions. Second operand 26 states. [2019-09-10 07:48:43,717 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-09-10 07:48:43,968 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 07:48:44,411 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:48:49,876 WARN L188 SmtUtils]: Spent 5.39 s on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:48:51,959 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:48:52,449 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:48:52,950 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:48:53,276 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:48:55,816 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:49:00,370 WARN L188 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:49:00,844 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 07:49:05,573 WARN L188 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:49:05,783 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 07:49:05,978 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-10 07:49:06,199 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 07:49:06,824 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:49:11,393 WARN L188 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:49:11,985 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:49:12,161 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-10 07:49:17,886 WARN L188 SmtUtils]: Spent 5.66 s on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:49:18,192 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:49:23,187 WARN L188 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:49:23,515 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:49:32,546 WARN L188 SmtUtils]: Spent 8.98 s on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:49:37,162 WARN L188 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:49:39,452 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:49:39,920 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:49:44,972 WARN L188 SmtUtils]: Spent 4.98 s on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:49:51,473 WARN L188 SmtUtils]: Spent 6.45 s on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:49:51,903 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 07:49:52,216 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-09-10 07:49:54,635 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:50:01,326 WARN L188 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:50:01,544 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-09-10 07:50:02,202 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:50:06,727 WARN L188 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:50:07,608 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:50:10,038 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:50:10,549 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:50:13,588 WARN L188 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:50:13,854 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 07:50:16,180 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 07:50:19,488 WARN L188 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:50:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:19,557 INFO L93 Difference]: Finished difference Result 94502 states and 112516 transitions. [2019-09-10 07:50:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 07:50:19,557 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 108 [2019-09-10 07:50:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:19,638 INFO L225 Difference]: With dead ends: 94502 [2019-09-10 07:50:19,638 INFO L226 Difference]: Without dead ends: 94502 [2019-09-10 07:50:19,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 192 SyntacticMatches, 14 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 112.3s TimeCoverageRelationStatistics Valid=1467, Invalid=6188, Unknown=1, NotChecked=0, Total=7656 [2019-09-10 07:50:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94502 states. [2019-09-10 07:50:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94502 to 49833. [2019-09-10 07:50:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49833 states. [2019-09-10 07:50:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49833 states to 49833 states and 59073 transitions. [2019-09-10 07:50:20,205 INFO L78 Accepts]: Start accepts. Automaton has 49833 states and 59073 transitions. Word has length 108 [2019-09-10 07:50:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:20,206 INFO L475 AbstractCegarLoop]: Abstraction has 49833 states and 59073 transitions. [2019-09-10 07:50:20,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 07:50:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 49833 states and 59073 transitions. [2019-09-10 07:50:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:50:20,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:20,210 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:50:20,210 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1306662269, now seen corresponding path program 1 times [2019-09-10 07:50:20,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:20,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:20,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:20,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:20,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:50:20,560 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [242], [247], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [303], [306], [309], [311], [329], [334], [389], [390], [394], [395], [396] [2019-09-10 07:50:20,561 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:20,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:20,579 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:20,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:20,789 INFO L272 AbstractInterpreter]: Visited 101 different actions 398 times. Merged at 42 different actions 264 times. Widened at 12 different actions 27 times. Performed 1340 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 10 different actions. Largest state had 110 variables. [2019-09-10 07:50:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:20,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:20,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:20,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:50:20,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:20,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:20,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-10 07:50:20,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:22,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:22,777 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:23,761 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 07:50:24,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:24,761 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:50:25,366 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 07:50:25,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:25,760 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-09-10 07:50:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:26,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:26,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27, 28] total 68 [2019-09-10 07:50:26,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:26,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 07:50:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 07:50:26,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=4079, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 07:50:26,057 INFO L87 Difference]: Start difference. First operand 49833 states and 59073 transitions. Second operand 42 states. [2019-09-10 07:50:27,429 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:50:27,630 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:50:28,402 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:50:28,884 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:50:29,954 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:50:30,815 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:50:31,123 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:50:31,633 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:50:32,856 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:50:33,176 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:50:33,698 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:50:34,247 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:50:34,599 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:50:35,130 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:50:35,763 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:50:36,337 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:50:37,241 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 07:50:37,502 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:50:38,164 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:50:39,024 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-10 07:50:39,313 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 07:50:39,621 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:50:40,323 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 07:50:42,193 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 07:50:42,439 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 07:50:44,590 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 07:50:45,511 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:50:46,703 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:50:47,450 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 07:50:47,781 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 07:50:48,142 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:50:48,713 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:50:49,591 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:50:50,443 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:50:51,875 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:50:52,079 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:50:52,536 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:50:52,737 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 07:50:52,931 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:50:53,814 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:50:54,214 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-10 07:50:54,610 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 07:50:55,138 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 07:50:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:58,445 INFO L93 Difference]: Finished difference Result 78473 states and 93291 transitions. [2019-09-10 07:50:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-10 07:50:58,445 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 109 [2019-09-10 07:50:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:58,510 INFO L225 Difference]: With dead ends: 78473 [2019-09-10 07:50:58,510 INFO L226 Difference]: Without dead ends: 78473 [2019-09-10 07:50:58,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14629 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=7424, Invalid=39016, Unknown=0, NotChecked=0, Total=46440 [2019-09-10 07:50:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78473 states. [2019-09-10 07:50:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78473 to 54863. [2019-09-10 07:50:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54863 states. [2019-09-10 07:50:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54863 states to 54863 states and 65098 transitions. [2019-09-10 07:50:58,973 INFO L78 Accepts]: Start accepts. Automaton has 54863 states and 65098 transitions. Word has length 109 [2019-09-10 07:50:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:58,973 INFO L475 AbstractCegarLoop]: Abstraction has 54863 states and 65098 transitions. [2019-09-10 07:50:58,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 07:50:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 54863 states and 65098 transitions. [2019-09-10 07:50:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:50:58,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:58,977 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:50:58,977 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash 389032522, now seen corresponding path program 1 times [2019-09-10 07:50:58,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:58,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:58,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:50:59,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:50:59,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:50:59,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:50:59,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:50:59,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:50:59,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:50:59,011 INFO L87 Difference]: Start difference. First operand 54863 states and 65098 transitions. Second operand 3 states. [2019-09-10 07:50:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:59,098 INFO L93 Difference]: Finished difference Result 23765 states and 27902 transitions. [2019-09-10 07:50:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:50:59,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:50:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:59,115 INFO L225 Difference]: With dead ends: 23765 [2019-09-10 07:50:59,116 INFO L226 Difference]: Without dead ends: 23765 [2019-09-10 07:50:59,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:50:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2019-09-10 07:50:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 23765. [2019-09-10 07:50:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23765 states. [2019-09-10 07:50:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23765 states to 23765 states and 27902 transitions. [2019-09-10 07:50:59,264 INFO L78 Accepts]: Start accepts. Automaton has 23765 states and 27902 transitions. Word has length 109 [2019-09-10 07:50:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:59,264 INFO L475 AbstractCegarLoop]: Abstraction has 23765 states and 27902 transitions. [2019-09-10 07:50:59,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:50:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23765 states and 27902 transitions. [2019-09-10 07:50:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:50:59,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:59,265 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:50:59,266 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash -308813263, now seen corresponding path program 1 times [2019-09-10 07:50:59,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:59,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:59,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:59,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:59,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:59,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:59,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:50:59,649 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [329], [334], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:50:59,650 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:59,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:59,658 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:59,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:59,791 INFO L272 AbstractInterpreter]: Visited 101 different actions 371 times. Merged at 41 different actions 239 times. Widened at 12 different actions 25 times. Performed 1255 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 12 different actions. Largest state had 110 variables. [2019-09-10 07:50:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:59,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:59,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:59,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:50:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:59,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:59,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:50:59,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:00,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:00,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:00,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2019-09-10 07:51:00,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:00,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:51:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:51:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:51:00,868 INFO L87 Difference]: Start difference. First operand 23765 states and 27902 transitions. Second operand 24 states. [2019-09-10 07:51:03,802 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:51:09,664 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:51:10,086 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:51:10,408 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:51:10,990 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:51:14,245 WARN L188 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 07:51:15,162 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:51:15,453 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:51:15,667 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:51:16,035 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:51:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:16,231 INFO L93 Difference]: Finished difference Result 27359 states and 31952 transitions. [2019-09-10 07:51:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:51:16,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 109 [2019-09-10 07:51:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:16,253 INFO L225 Difference]: With dead ends: 27359 [2019-09-10 07:51:16,253 INFO L226 Difference]: Without dead ends: 27359 [2019-09-10 07:51:16,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:51:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27359 states. [2019-09-10 07:51:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27359 to 23843. [2019-09-10 07:51:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23843 states. [2019-09-10 07:51:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23843 states to 23843 states and 27980 transitions. [2019-09-10 07:51:16,440 INFO L78 Accepts]: Start accepts. Automaton has 23843 states and 27980 transitions. Word has length 109 [2019-09-10 07:51:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:16,440 INFO L475 AbstractCegarLoop]: Abstraction has 23843 states and 27980 transitions. [2019-09-10 07:51:16,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:51:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23843 states and 27980 transitions. [2019-09-10 07:51:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:51:16,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:16,442 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:51:16,442 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1796653684, now seen corresponding path program 1 times [2019-09-10 07:51:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:16,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:51:16,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:51:16,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:51:16,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:51:16,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:51:16,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:51:16,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:51:16,699 INFO L87 Difference]: Start difference. First operand 23843 states and 27980 transitions. Second operand 3 states. [2019-09-10 07:51:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:16,769 INFO L93 Difference]: Finished difference Result 9472 states and 10846 transitions. [2019-09-10 07:51:16,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:51:16,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:51:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:16,779 INFO L225 Difference]: With dead ends: 9472 [2019-09-10 07:51:16,779 INFO L226 Difference]: Without dead ends: 9472 [2019-09-10 07:51:16,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:51:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2019-09-10 07:51:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 9472. [2019-09-10 07:51:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9472 states. [2019-09-10 07:51:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9472 states to 9472 states and 10846 transitions. [2019-09-10 07:51:16,856 INFO L78 Accepts]: Start accepts. Automaton has 9472 states and 10846 transitions. Word has length 109 [2019-09-10 07:51:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:16,857 INFO L475 AbstractCegarLoop]: Abstraction has 9472 states and 10846 transitions. [2019-09-10 07:51:16,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:51:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 9472 states and 10846 transitions. [2019-09-10 07:51:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:51:16,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:16,858 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:51:16,858 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1982687056, now seen corresponding path program 1 times [2019-09-10 07:51:16,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:16,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:16,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:17,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:17,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:17,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:51:17,118 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [339], [344], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:51:17,119 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:17,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:17,130 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:17,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:17,250 INFO L272 AbstractInterpreter]: Visited 101 different actions 342 times. Merged at 41 different actions 213 times. Widened at 9 different actions 11 times. Performed 1183 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1183 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 9 different actions. Largest state had 110 variables. [2019-09-10 07:51:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:17,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:17,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:17,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:51:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:17,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:17,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:51:17,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:18,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:20,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:20,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:20,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:20,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:20,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:20,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:20,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 24 [2019-09-10 07:51:20,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:20,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:51:20,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:51:20,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:51:20,899 INFO L87 Difference]: Start difference. First operand 9472 states and 10846 transitions. Second operand 18 states. [2019-09-10 07:51:21,156 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 07:51:22,124 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 07:51:22,394 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:51:22,654 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:51:26,949 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:51:27,451 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:51:29,726 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:51:32,014 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:51:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:32,143 INFO L93 Difference]: Finished difference Result 10666 states and 12251 transitions. [2019-09-10 07:51:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:51:32,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 109 [2019-09-10 07:51:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:32,151 INFO L225 Difference]: With dead ends: 10666 [2019-09-10 07:51:32,151 INFO L226 Difference]: Without dead ends: 10666 [2019-09-10 07:51:32,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 194 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=274, Invalid=1129, Unknown=3, NotChecked=0, Total=1406 [2019-09-10 07:51:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-09-10 07:51:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 8497. [2019-09-10 07:51:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8497 states. [2019-09-10 07:51:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8497 states to 8497 states and 9715 transitions. [2019-09-10 07:51:32,213 INFO L78 Accepts]: Start accepts. Automaton has 8497 states and 9715 transitions. Word has length 109 [2019-09-10 07:51:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:32,213 INFO L475 AbstractCegarLoop]: Abstraction has 8497 states and 9715 transitions. [2019-09-10 07:51:32,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:51:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 8497 states and 9715 transitions. [2019-09-10 07:51:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:51:32,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:32,214 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:51:32,214 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1047045622, now seen corresponding path program 1 times [2019-09-10 07:51:32,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:32,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:32,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:33,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:33,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:33,300 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:51:33,301 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [242], [247], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [303], [306], [309], [311], [329], [334], [339], [344], [389], [390], [394], [395], [396] [2019-09-10 07:51:33,302 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:33,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:33,309 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:33,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:33,434 INFO L272 AbstractInterpreter]: Visited 102 different actions 381 times. Merged at 42 different actions 249 times. Widened at 10 different actions 23 times. Performed 1270 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1270 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 110 variables. [2019-09-10 07:51:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:33,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:33,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:33,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:33,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:33,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:51:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:33,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 07:51:33,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:34,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:36,283 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-09-10 07:51:36,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,779 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-09-10 07:51:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:37,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 22] total 67 [2019-09-10 07:51:37,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:37,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 07:51:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 07:51:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=4118, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 07:51:37,210 INFO L87 Difference]: Start difference. First operand 8497 states and 9715 transitions. Second operand 47 states. [2019-09-10 07:51:37,427 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:51:38,342 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-09-10 07:51:40,967 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 07:51:41,562 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:51:41,937 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:51:42,429 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 07:51:42,778 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-10 07:51:43,258 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2019-09-10 07:51:43,702 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-09-10 07:51:44,687 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2019-09-10 07:51:45,684 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-10 07:51:46,235 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:51:46,977 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 07:51:48,086 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:51:48,645 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 07:51:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:49,939 INFO L93 Difference]: Finished difference Result 12449 states and 14357 transitions. [2019-09-10 07:51:49,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 07:51:49,939 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 110 [2019-09-10 07:51:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:49,949 INFO L225 Difference]: With dead ends: 12449 [2019-09-10 07:51:49,950 INFO L226 Difference]: Without dead ends: 12442 [2019-09-10 07:51:49,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1598, Invalid=10392, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 07:51:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12442 states. [2019-09-10 07:51:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12442 to 8221. [2019-09-10 07:51:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8221 states. [2019-09-10 07:51:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8221 states to 8221 states and 9410 transitions. [2019-09-10 07:51:50,020 INFO L78 Accepts]: Start accepts. Automaton has 8221 states and 9410 transitions. Word has length 110 [2019-09-10 07:51:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:50,020 INFO L475 AbstractCegarLoop]: Abstraction has 8221 states and 9410 transitions. [2019-09-10 07:51:50,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 07:51:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 8221 states and 9410 transitions. [2019-09-10 07:51:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:51:50,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:50,021 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 07:51:50,021 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1002250804, now seen corresponding path program 1 times [2019-09-10 07:51:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:50,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:51,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:51,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:51,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:51:51,094 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [251], [254], [257], [259], [267], [272], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [339], [344], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:51:51,096 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:51,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:51,102 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:51,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:51,227 INFO L272 AbstractInterpreter]: Visited 102 different actions 434 times. Merged at 42 different actions 296 times. Widened at 14 different actions 37 times. Performed 1375 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1375 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 10 different actions. Largest state had 110 variables. [2019-09-10 07:51:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:51,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:51,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:51,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:51,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:51:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:51,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 07:51:51,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:51,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:52,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:52,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:52,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:53,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:53,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:53,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 16] total 53 [2019-09-10 07:51:53,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:53,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:51:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:51:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2601, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:51:53,990 INFO L87 Difference]: Start difference. First operand 8221 states and 9410 transitions. Second operand 39 states. [2019-09-10 07:51:54,249 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-09-10 07:51:54,529 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:51:55,899 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:51:56,226 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:51:56,424 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:51:57,009 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-10 07:51:57,740 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-10 07:51:58,162 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:51:58,454 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:51:58,918 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-10 07:51:59,593 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:52:00,328 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:52:01,454 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 07:52:01,959 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:52:05,895 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2019-09-10 07:52:06,701 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:52:07,612 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-09-10 07:52:08,049 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:52:11,026 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-09-10 07:52:12,124 WARN L188 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2019-09-10 07:52:12,537 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:52:13,374 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 07:52:14,335 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 109 [2019-09-10 07:52:15,153 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-09-10 07:52:15,668 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:52:16,611 WARN L188 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 07:52:19,543 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-09-10 07:52:19,773 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:52:20,141 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:52:20,532 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61