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/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:33:25,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:33:25,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:33:25,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:33:25,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:33:25,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:33:25,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:33:25,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:33:25,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:33:25,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:33:25,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:33:25,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:33:25,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:33:25,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:33:25,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:33:25,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:33:25,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:33:25,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:33:25,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:33:25,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:33:25,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:33:25,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:33:25,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:33:25,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:33:25,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:33:25,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:33:25,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:33:25,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:33:25,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:33:25,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:33:25,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:33:25,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:33:25,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:33:25,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:33:25,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:33:25,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:33:25,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:33:25,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:33:25,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:33:25,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:33:25,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:33:25,346 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-10-03 02:33:25,362 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:33:25,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:33:25,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:33:25,363 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:33:25,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:33:25,364 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:33:25,364 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:33:25,364 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:33:25,365 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:33:25,365 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:33:25,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:33:25,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:33:25,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:33:25,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:33:25,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:33:25,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:33:25,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:33:25,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:33:25,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:33:25,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:33:25,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:33:25,368 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:33:25,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:33:25,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:33:25,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:33:25,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:33:25,369 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:33:25,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:33:25,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:33:25,369 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:33:25,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:33:25,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:33:25,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:33:25,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:33:25,416 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:33:25,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-10-03 02:33:25,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a67fe727/51161bbf6db34269bc2bcc6e847947b8/FLAGebc093e61 [2019-10-03 02:33:26,029 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:33:26,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-10-03 02:33:26,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a67fe727/51161bbf6db34269bc2bcc6e847947b8/FLAGebc093e61 [2019-10-03 02:33:26,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a67fe727/51161bbf6db34269bc2bcc6e847947b8 [2019-10-03 02:33:26,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:33:26,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:33:26,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:33:26,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:33:26,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:33:26,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db0bf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26, skipping insertion in model container [2019-10-03 02:33:26,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,392 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:33:26,449 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:33:26,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:33:26,807 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:33:26,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:33:27,010 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:33:27,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27 WrapperNode [2019-10-03 02:33:27,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:33:27,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:33:27,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:33:27,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:33:27,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... [2019-10-03 02:33:27,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... [2019-10-03 02:33:27,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... [2019-10-03 02:33:27,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... [2019-10-03 02:33:27,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... [2019-10-03 02:33:27,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... [2019-10-03 02:33:27,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... [2019-10-03 02:33:27,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:33:27,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:33:27,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:33:27,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:33:27,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:33:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:33:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:33:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:33:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:33:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:33:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:33:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:33:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:33:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:33:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:33:27,976 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:33:27,976 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:33:27,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:33:27 BoogieIcfgContainer [2019-10-03 02:33:27,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:33:27,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:33:27,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:33:27,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:33:27,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:33:26" (1/3) ... [2019-10-03 02:33:27,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fccf45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:33:27, skipping insertion in model container [2019-10-03 02:33:27,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:27" (2/3) ... [2019-10-03 02:33:27,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fccf45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:33:27, skipping insertion in model container [2019-10-03 02:33:27,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:33:27" (3/3) ... [2019-10-03 02:33:27,987 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-10-03 02:33:27,997 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:33:28,006 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:33:28,024 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:33:28,054 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:33:28,054 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:33:28,054 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:33:28,054 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:33:28,055 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:33:28,055 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:33:28,055 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:33:28,055 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:33:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-03 02:33:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:28,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:28,092 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:28,094 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-10-03 02:33:28,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:28,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:28,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:28,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:28,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:33:28,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:28,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:33:28,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:33:28,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:33:28,356 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-10-03 02:33:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:28,888 INFO L93 Difference]: Finished difference Result 149 states and 282 transitions. [2019-10-03 02:33:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:33:28,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-03 02:33:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:28,903 INFO L225 Difference]: With dead ends: 149 [2019-10-03 02:33:28,903 INFO L226 Difference]: Without dead ends: 145 [2019-10-03 02:33:28,905 INFO L640 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-10-03 02:33:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-03 02:33:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-10-03 02:33:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-03 02:33:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-10-03 02:33:28,995 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-10-03 02:33:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:28,996 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-10-03 02:33:28,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:33:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-10-03 02:33:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:29,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:29,000 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:29,001 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-10-03 02:33:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:29,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:29,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:33:29,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:29,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:33:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:33:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:33:29,203 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-10-03 02:33:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:29,859 INFO L93 Difference]: Finished difference Result 277 states and 345 transitions. [2019-10-03 02:33:29,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:33:29,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-03 02:33:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:29,862 INFO L225 Difference]: With dead ends: 277 [2019-10-03 02:33:29,863 INFO L226 Difference]: Without dead ends: 277 [2019-10-03 02:33:29,864 INFO L640 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-10-03 02:33:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-03 02:33:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-10-03 02:33:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-03 02:33:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-10-03 02:33:29,882 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-10-03 02:33:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:29,883 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-10-03 02:33:29,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:33:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-10-03 02:33:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:29,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:29,887 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:29,887 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-10-03 02:33:29,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:32,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:32,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:32,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:32,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:32,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:32,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:32,427 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 69 states. [2019-10-03 02:33:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:33,293 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2019-10-03 02:33:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:33:33,294 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:33,296 INFO L225 Difference]: With dead ends: 269 [2019-10-03 02:33:33,296 INFO L226 Difference]: Without dead ends: 269 [2019-10-03 02:33:33,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-03 02:33:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-10-03 02:33:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-03 02:33:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-10-03 02:33:33,313 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-10-03 02:33:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:33,313 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-10-03 02:33:33,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-10-03 02:33:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:33,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:33,316 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:33,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:33,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-10-03 02:33:33,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:33,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:33,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:35,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:35,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:35,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:35,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:35,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:35,686 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 69 states. [2019-10-03 02:33:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:36,817 INFO L93 Difference]: Finished difference Result 267 states and 330 transitions. [2019-10-03 02:33:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:33:36,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:36,821 INFO L225 Difference]: With dead ends: 267 [2019-10-03 02:33:36,821 INFO L226 Difference]: Without dead ends: 267 [2019-10-03 02:33:36,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-03 02:33:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-10-03 02:33:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-03 02:33:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-10-03 02:33:36,832 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-10-03 02:33:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:36,833 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-10-03 02:33:36,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-10-03 02:33:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:36,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:36,836 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:36,836 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-10-03 02:33:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:36,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:36,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:38,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:38,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:38,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:38,653 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 69 states. [2019-10-03 02:33:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:39,756 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2019-10-03 02:33:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:33:39,757 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:39,759 INFO L225 Difference]: With dead ends: 265 [2019-10-03 02:33:39,760 INFO L226 Difference]: Without dead ends: 265 [2019-10-03 02:33:39,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-03 02:33:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-10-03 02:33:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-03 02:33:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-10-03 02:33:39,770 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-10-03 02:33:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:39,770 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-10-03 02:33:39,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-10-03 02:33:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:39,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:39,773 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:39,773 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:39,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-10-03 02:33:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:39,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:39,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:39,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:39,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:41,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:41,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:41,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:41,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:41,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:41,515 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 69 states. [2019-10-03 02:33:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:42,855 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2019-10-03 02:33:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:33:42,856 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:42,859 INFO L225 Difference]: With dead ends: 259 [2019-10-03 02:33:42,859 INFO L226 Difference]: Without dead ends: 259 [2019-10-03 02:33:42,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-03 02:33:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-03 02:33:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-03 02:33:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-10-03 02:33:42,868 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-10-03 02:33:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:42,868 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-10-03 02:33:42,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-10-03 02:33:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:42,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:42,871 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:42,871 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-10-03 02:33:42,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:42,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:42,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:44,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:44,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:44,467 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 69 states. [2019-10-03 02:33:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:46,143 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2019-10-03 02:33:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:33:46,144 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:46,146 INFO L225 Difference]: With dead ends: 255 [2019-10-03 02:33:46,146 INFO L226 Difference]: Without dead ends: 255 [2019-10-03 02:33:46,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-03 02:33:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-10-03 02:33:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-03 02:33:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-10-03 02:33:46,155 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-10-03 02:33:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:46,155 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-10-03 02:33:46,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-10-03 02:33:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:46,157 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:46,158 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:46,158 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:46,158 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-10-03 02:33:46,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:46,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:46,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:46,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:46,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:47,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:47,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:47,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:47,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:47,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:47,771 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 69 states. [2019-10-03 02:33:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:49,393 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2019-10-03 02:33:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:33:49,393 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:49,396 INFO L225 Difference]: With dead ends: 253 [2019-10-03 02:33:49,396 INFO L226 Difference]: Without dead ends: 253 [2019-10-03 02:33:49,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-03 02:33:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-10-03 02:33:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-03 02:33:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-10-03 02:33:49,405 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-10-03 02:33:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:49,406 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-10-03 02:33:49,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-10-03 02:33:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:49,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:49,408 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:49,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-10-03 02:33:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:49,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:49,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:51,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:51,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:51,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:51,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:51,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:51,117 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 69 states. [2019-10-03 02:33:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:53,002 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2019-10-03 02:33:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:33:53,003 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:53,005 INFO L225 Difference]: With dead ends: 249 [2019-10-03 02:33:53,005 INFO L226 Difference]: Without dead ends: 249 [2019-10-03 02:33:53,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-03 02:33:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-10-03 02:33:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-03 02:33:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-10-03 02:33:53,012 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-10-03 02:33:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:53,012 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-10-03 02:33:53,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-10-03 02:33:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:53,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:53,014 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:53,014 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:53,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-10-03 02:33:53,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:53,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:53,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:53,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:53,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:54,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-03 02:33:54,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:54,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:33:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:33:54,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:54,530 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 69 states. [2019-10-03 02:33:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:56,468 INFO L93 Difference]: Finished difference Result 245 states and 297 transitions. [2019-10-03 02:33:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 02:33:56,469 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-03 02:33:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:56,471 INFO L225 Difference]: With dead ends: 245 [2019-10-03 02:33:56,471 INFO L226 Difference]: Without dead ends: 245 [2019-10-03 02:33:56,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 02:33:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-03 02:33:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-10-03 02:33:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-03 02:33:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-10-03 02:33:56,482 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-10-03 02:33:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:56,482 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-10-03 02:33:56,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:33:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-10-03 02:33:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:33:56,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:56,484 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:56,484 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-10-03 02:33:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:56,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:56,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:58,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:58,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-10-03 02:33:58,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:58,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-03 02:33:58,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-03 02:33:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-03 02:33:58,573 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 70 states. [2019-10-03 02:34:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:07,370 INFO L93 Difference]: Finished difference Result 453 states and 471 transitions. [2019-10-03 02:34:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-03 02:34:07,371 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-10-03 02:34:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:07,373 INFO L225 Difference]: With dead ends: 453 [2019-10-03 02:34:07,374 INFO L226 Difference]: Without dead ends: 453 [2019-10-03 02:34:07,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-03 02:34:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-03 02:34:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-10-03 02:34:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-03 02:34:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 470 transitions. [2019-10-03 02:34:07,384 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 470 transitions. Word has length 143 [2019-10-03 02:34:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:07,385 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 470 transitions. [2019-10-03 02:34:07,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-03 02:34:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 470 transitions. [2019-10-03 02:34:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:34:07,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:07,387 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:07,388 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-10-03 02:34:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:07,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:07,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:07,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:07,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:09,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:09,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:09,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-10-03 02:34:09,385 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [78], [81], [85], [88], [92], [95], [99], [102], [106], [109], [113], [116], [120], [123], [127], [130], [134], [137], [141], [144], [148], [151], [155], [158], [162], [165], [169], [172], [176], [179], [183], [186], [190], [193], [197], [200], [204], [207], [211], [214], [218], [221], [225], [228], [232], [235], [239], [242], [246], [249], [253], [256], [260], [263], [267], [270], [274], [277], [281], [284], [288], [291], [295], [298], [302], [305], [309], [312], [316], [319], [323], [326], [330], [333], [337], [340], [344], [347], [351], [354], [358], [365], [372], [379], [386], [393], [400], [407], [414], [421], [428], [435], [442], [449], [456], [463], [470], [477], [483], [485], [488], [489], [492], [495], [498], [501], [504], [507], [510], [513], [516], [519], [522], [525], [528], [531], [534], [537], [540], [694], [695], [696] [2019-10-03 02:34:09,436 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:34:09,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:34:09,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:34:09,740 INFO L272 AbstractInterpreter]: Visited 145 different actions 165 times. Merged at 5 different actions 15 times. Widened at 1 different actions 2 times. Performed 298 root evaluator evaluations with a maximum evaluation depth of 4. Performed 298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-10-03 02:34:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:09,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:34:09,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:09,746 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-10-03 02:34:09,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:09,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:34:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:09,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-03 02:34:09,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:09,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:13,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:13,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 102 [2019-10-03 02:34:13,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:13,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-03 02:34:13,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-03 02:34:13,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:13,554 INFO L87 Difference]: Start difference. First operand 452 states and 470 transitions. Second operand 71 states. [2019-10-03 02:34:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:22,180 INFO L93 Difference]: Finished difference Result 455 states and 473 transitions. [2019-10-03 02:34:22,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-03 02:34:22,181 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 145 [2019-10-03 02:34:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:22,184 INFO L225 Difference]: With dead ends: 455 [2019-10-03 02:34:22,184 INFO L226 Difference]: Without dead ends: 455 [2019-10-03 02:34:22,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 222 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-10-03 02:34:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 454. [2019-10-03 02:34:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-03 02:34:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 472 transitions. [2019-10-03 02:34:22,200 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 472 transitions. Word has length 145 [2019-10-03 02:34:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:22,200 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 472 transitions. [2019-10-03 02:34:22,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-03 02:34:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 472 transitions. [2019-10-03 02:34:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:34:22,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:22,203 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:22,203 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:22,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1458227952, now seen corresponding path program 2 times [2019-10-03 02:34:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:22,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:22,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:22,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:22,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:24,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:24,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:24,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:24,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:24,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:24,099 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:34:24,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:34:24,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:34:24,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:34:24,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:24,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-03 02:34:24,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:24,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:27,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:27,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 102 [2019-10-03 02:34:27,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:27,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-03 02:34:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-03 02:34:27,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:27,492 INFO L87 Difference]: Start difference. First operand 454 states and 472 transitions. Second operand 72 states. [2019-10-03 02:34:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:31,112 INFO L93 Difference]: Finished difference Result 457 states and 475 transitions. [2019-10-03 02:34:31,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-03 02:34:31,113 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 147 [2019-10-03 02:34:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:31,116 INFO L225 Difference]: With dead ends: 457 [2019-10-03 02:34:31,116 INFO L226 Difference]: Without dead ends: 457 [2019-10-03 02:34:31,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 225 SyntacticMatches, 40 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-03 02:34:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 456. [2019-10-03 02:34:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-03 02:34:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 474 transitions. [2019-10-03 02:34:31,125 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 474 transitions. Word has length 147 [2019-10-03 02:34:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:31,126 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 474 transitions. [2019-10-03 02:34:31,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-03 02:34:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 474 transitions. [2019-10-03 02:34:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-03 02:34:31,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:31,128 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:31,128 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:31,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 3 times [2019-10-03 02:34:31,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:31,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:31,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:33,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:33,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:33,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:33,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:33,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:33,010 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:34:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:34:33,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:34:33,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:34:33,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:33,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-03 02:34:33,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:33,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:36,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:36,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-10-03 02:34:36,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:36,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-03 02:34:36,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-03 02:34:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:36,451 INFO L87 Difference]: Start difference. First operand 456 states and 474 transitions. Second operand 73 states. [2019-10-03 02:34:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:45,258 INFO L93 Difference]: Finished difference Result 459 states and 477 transitions. [2019-10-03 02:34:45,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-03 02:34:45,258 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 149 [2019-10-03 02:34:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:45,261 INFO L225 Difference]: With dead ends: 459 [2019-10-03 02:34:45,261 INFO L226 Difference]: Without dead ends: 459 [2019-10-03 02:34:45,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 228 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-10-03 02:34:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2019-10-03 02:34:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-03 02:34:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 476 transitions. [2019-10-03 02:34:45,271 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 476 transitions. Word has length 149 [2019-10-03 02:34:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:45,271 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 476 transitions. [2019-10-03 02:34:45,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-03 02:34:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 476 transitions. [2019-10-03 02:34:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 02:34:45,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:45,273 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:45,274 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:45,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1311476900, now seen corresponding path program 4 times [2019-10-03 02:34:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:45,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:45,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:47,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:47,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:47,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:47,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:47,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:47,252 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-10-03 02:34:47,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:47,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:34:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:47,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2019-10-03 02:34:47,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:47,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:50,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:50,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 102 [2019-10-03 02:34:50,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:50,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-03 02:34:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-03 02:34:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:50,768 INFO L87 Difference]: Start difference. First operand 458 states and 476 transitions. Second operand 74 states. [2019-10-03 02:34:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:59,584 INFO L93 Difference]: Finished difference Result 461 states and 479 transitions. [2019-10-03 02:34:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-03 02:34:59,584 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-10-03 02:34:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:59,587 INFO L225 Difference]: With dead ends: 461 [2019-10-03 02:34:59,587 INFO L226 Difference]: Without dead ends: 461 [2019-10-03 02:34:59,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 231 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-03 02:34:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2019-10-03 02:34:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-03 02:34:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 478 transitions. [2019-10-03 02:34:59,596 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 478 transitions. Word has length 151 [2019-10-03 02:34:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:59,596 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 478 transitions. [2019-10-03 02:34:59,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-03 02:34:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 478 transitions. [2019-10-03 02:34:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 02:34:59,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:59,598 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:59,599 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:59,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1896357822, now seen corresponding path program 5 times [2019-10-03 02:34:59,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:59,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:59,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:01,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:01,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:01,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:01,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:01,559 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-10-03 02:35:01,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:01,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:01,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-03 02:35:01,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:01,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-03 02:35:01,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:05,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:05,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-10-03 02:35:05,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:05,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-03 02:35:05,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-03 02:35:05,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:05,329 INFO L87 Difference]: Start difference. First operand 460 states and 478 transitions. Second operand 75 states. [2019-10-03 02:35:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:14,257 INFO L93 Difference]: Finished difference Result 463 states and 481 transitions. [2019-10-03 02:35:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-03 02:35:14,257 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-10-03 02:35:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:14,260 INFO L225 Difference]: With dead ends: 463 [2019-10-03 02:35:14,260 INFO L226 Difference]: Without dead ends: 463 [2019-10-03 02:35:14,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-10-03 02:35:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 462. [2019-10-03 02:35:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-10-03 02:35:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2019-10-03 02:35:14,272 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 153 [2019-10-03 02:35:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:14,273 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2019-10-03 02:35:14,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-03 02:35:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2019-10-03 02:35:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:35:14,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:14,275 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:14,275 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1326208088, now seen corresponding path program 6 times [2019-10-03 02:35:14,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:14,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:14,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:16,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:16,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:16,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:16,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:16,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:16,371 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-10-03 02:35:16,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:16,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:35:16,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:16,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:16,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-10-03 02:35:16,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:16,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:19,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:19,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-10-03 02:35:19,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:19,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-03 02:35:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-03 02:35:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:19,952 INFO L87 Difference]: Start difference. First operand 462 states and 480 transitions. Second operand 76 states. [2019-10-03 02:35:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:22,957 INFO L93 Difference]: Finished difference Result 465 states and 483 transitions. [2019-10-03 02:35:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-03 02:35:22,958 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-10-03 02:35:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:22,961 INFO L225 Difference]: With dead ends: 465 [2019-10-03 02:35:22,961 INFO L226 Difference]: Without dead ends: 465 [2019-10-03 02:35:22,962 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 237 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-03 02:35:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2019-10-03 02:35:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-03 02:35:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 482 transitions. [2019-10-03 02:35:22,969 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 482 transitions. Word has length 155 [2019-10-03 02:35:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:22,970 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 482 transitions. [2019-10-03 02:35:22,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-03 02:35:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 482 transitions. [2019-10-03 02:35:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:35:22,972 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:22,972 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:22,972 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1126839694, now seen corresponding path program 7 times [2019-10-03 02:35:22,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:22,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:22,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:22,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:22,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:25,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:25,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:25,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:25,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:25,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:25,072 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:25,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:25,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:25,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-03 02:35:25,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:25,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:28,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:28,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 102 [2019-10-03 02:35:28,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:28,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-03 02:35:28,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-03 02:35:28,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:28,457 INFO L87 Difference]: Start difference. First operand 464 states and 482 transitions. Second operand 77 states. [2019-10-03 02:35:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:35,797 INFO L93 Difference]: Finished difference Result 467 states and 485 transitions. [2019-10-03 02:35:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-03 02:35:35,799 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-10-03 02:35:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:35,803 INFO L225 Difference]: With dead ends: 467 [2019-10-03 02:35:35,803 INFO L226 Difference]: Without dead ends: 467 [2019-10-03 02:35:35,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 240 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-03 02:35:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2019-10-03 02:35:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-03 02:35:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 484 transitions. [2019-10-03 02:35:35,811 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 484 transitions. Word has length 157 [2019-10-03 02:35:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:35,812 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 484 transitions. [2019-10-03 02:35:35,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-03 02:35:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 484 transitions. [2019-10-03 02:35:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-03 02:35:35,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:35,814 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:35,814 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:35,815 INFO L82 PathProgramCache]: Analyzing trace with hash -568712692, now seen corresponding path program 8 times [2019-10-03 02:35:35,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:35,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:35,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:38,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:38,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:38,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:38,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:38,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:38,051 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:38,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:38,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:38,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-03 02:35:38,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:38,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-03 02:35:38,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:38,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:41,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:41,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-10-03 02:35:41,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:41,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-03 02:35:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-03 02:35:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:41,538 INFO L87 Difference]: Start difference. First operand 466 states and 484 transitions. Second operand 78 states. [2019-10-03 02:35:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:50,427 INFO L93 Difference]: Finished difference Result 469 states and 487 transitions. [2019-10-03 02:35:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-03 02:35:50,427 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-10-03 02:35:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:50,430 INFO L225 Difference]: With dead ends: 469 [2019-10-03 02:35:50,430 INFO L226 Difference]: Without dead ends: 469 [2019-10-03 02:35:50,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-10-03 02:35:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 468. [2019-10-03 02:35:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-03 02:35:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 486 transitions. [2019-10-03 02:35:50,438 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 486 transitions. Word has length 159 [2019-10-03 02:35:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:50,439 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 486 transitions. [2019-10-03 02:35:50,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-03 02:35:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 486 transitions. [2019-10-03 02:35:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-03 02:35:50,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:50,441 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:50,441 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1079575770, now seen corresponding path program 9 times [2019-10-03 02:35:50,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:50,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:50,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:50,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:50,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:52,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:52,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:52,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:52,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:52,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:52,716 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:52,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:52,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:35:52,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:52,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:52,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-10-03 02:35:52,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:52,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:56,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:56,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-10-03 02:35:56,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:56,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-03 02:35:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-03 02:35:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:56,496 INFO L87 Difference]: Start difference. First operand 468 states and 486 transitions. Second operand 79 states. [2019-10-03 02:36:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:03,213 INFO L93 Difference]: Finished difference Result 471 states and 489 transitions. [2019-10-03 02:36:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-03 02:36:03,213 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-10-03 02:36:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:03,215 INFO L225 Difference]: With dead ends: 471 [2019-10-03 02:36:03,215 INFO L226 Difference]: Without dead ends: 471 [2019-10-03 02:36:03,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-03 02:36:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 470. [2019-10-03 02:36:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-03 02:36:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 488 transitions. [2019-10-03 02:36:03,224 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 488 transitions. Word has length 161 [2019-10-03 02:36:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:03,224 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 488 transitions. [2019-10-03 02:36:03,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-03 02:36:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 488 transitions. [2019-10-03 02:36:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-03 02:36:03,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:03,226 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:03,227 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1902245312, now seen corresponding path program 10 times [2019-10-03 02:36:03,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:03,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:03,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:05,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:05,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:05,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:05,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:05,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:05,420 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-10-03 02:36:05,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:05,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:36:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:05,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-03 02:36:05,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:05,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:09,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:09,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 102 [2019-10-03 02:36:09,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:09,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-03 02:36:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-03 02:36:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:09,135 INFO L87 Difference]: Start difference. First operand 470 states and 488 transitions. Second operand 80 states. [2019-10-03 02:36:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:15,355 INFO L93 Difference]: Finished difference Result 473 states and 491 transitions. [2019-10-03 02:36:15,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-03 02:36:15,355 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-10-03 02:36:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:15,358 INFO L225 Difference]: With dead ends: 473 [2019-10-03 02:36:15,358 INFO L226 Difference]: Without dead ends: 473 [2019-10-03 02:36:15,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 249 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-03 02:36:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2019-10-03 02:36:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-03 02:36:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 490 transitions. [2019-10-03 02:36:15,366 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 490 transitions. Word has length 163 [2019-10-03 02:36:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:15,367 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 490 transitions. [2019-10-03 02:36:15,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-03 02:36:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 490 transitions. [2019-10-03 02:36:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-03 02:36:15,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:15,369 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:15,369 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1605848614, now seen corresponding path program 11 times [2019-10-03 02:36:15,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:15,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:15,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:17,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:17,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:17,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:17,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:17,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:17,767 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-10-03 02:36:17,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:36:17,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:36:17,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-03 02:36:17,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:17,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-03 02:36:17,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:17,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:21,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:21,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-10-03 02:36:21,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:21,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-03 02:36:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-03 02:36:21,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:21,313 INFO L87 Difference]: Start difference. First operand 472 states and 490 transitions. Second operand 81 states. [2019-10-03 02:36:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:30,139 INFO L93 Difference]: Finished difference Result 475 states and 493 transitions. [2019-10-03 02:36:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-03 02:36:30,142 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-10-03 02:36:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:30,144 INFO L225 Difference]: With dead ends: 475 [2019-10-03 02:36:30,145 INFO L226 Difference]: Without dead ends: 475 [2019-10-03 02:36:30,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 252 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-03 02:36:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 474. [2019-10-03 02:36:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-03 02:36:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 492 transitions. [2019-10-03 02:36:30,152 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 492 transitions. Word has length 165 [2019-10-03 02:36:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:30,152 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 492 transitions. [2019-10-03 02:36:30,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-03 02:36:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 492 transitions. [2019-10-03 02:36:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-03 02:36:30,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:30,154 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:30,155 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1334784140, now seen corresponding path program 12 times [2019-10-03 02:36:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:30,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:30,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:32,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:32,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:32,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:32,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:32,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:32,782 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-10-03 02:36:32,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:36:32,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:36:32,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:36:32,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:32,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-03 02:36:32,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:32,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:36,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:36,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-10-03 02:36:36,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:36,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-03 02:36:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-03 02:36:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:36,361 INFO L87 Difference]: Start difference. First operand 474 states and 492 transitions. Second operand 82 states. [2019-10-03 02:36:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:45,269 INFO L93 Difference]: Finished difference Result 477 states and 495 transitions. [2019-10-03 02:36:45,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-03 02:36:45,270 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-10-03 02:36:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:45,271 INFO L225 Difference]: With dead ends: 477 [2019-10-03 02:36:45,272 INFO L226 Difference]: Without dead ends: 477 [2019-10-03 02:36:45,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 255 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-03 02:36:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 476. [2019-10-03 02:36:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-03 02:36:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 494 transitions. [2019-10-03 02:36:45,278 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 494 transitions. Word has length 167 [2019-10-03 02:36:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:45,279 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 494 transitions. [2019-10-03 02:36:45,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-03 02:36:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 494 transitions. [2019-10-03 02:36:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-03 02:36:45,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:45,281 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:45,281 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:45,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:45,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1460137614, now seen corresponding path program 13 times [2019-10-03 02:36:45,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:45,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:45,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:45,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:47,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:47,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:47,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:47,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:47,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:47,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 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-10-03 02:36:47,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:47,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:36:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:47,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-03 02:36:47,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:47,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:51,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:51,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 102 [2019-10-03 02:36:51,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:51,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-03 02:36:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-03 02:36:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:51,263 INFO L87 Difference]: Start difference. First operand 476 states and 494 transitions. Second operand 83 states. [2019-10-03 02:37:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:00,157 INFO L93 Difference]: Finished difference Result 479 states and 497 transitions. [2019-10-03 02:37:00,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-03 02:37:00,158 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-10-03 02:37:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:00,160 INFO L225 Difference]: With dead ends: 479 [2019-10-03 02:37:00,160 INFO L226 Difference]: Without dead ends: 479 [2019-10-03 02:37:00,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 258 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-03 02:37:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 478. [2019-10-03 02:37:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-10-03 02:37:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 496 transitions. [2019-10-03 02:37:00,168 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 496 transitions. Word has length 169 [2019-10-03 02:37:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:00,169 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 496 transitions. [2019-10-03 02:37:00,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-03 02:37:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 496 transitions. [2019-10-03 02:37:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-03 02:37:00,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:00,171 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:00,171 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1269584088, now seen corresponding path program 14 times [2019-10-03 02:37:00,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:00,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:00,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:02,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:02,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:02,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:02,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:02,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:02,913 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:03,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:37:03,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:37:03,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-03 02:37:03,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:03,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-10-03 02:37:03,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:03,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:06,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:06,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-10-03 02:37:06,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:06,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-03 02:37:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-03 02:37:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:06,476 INFO L87 Difference]: Start difference. First operand 478 states and 496 transitions. Second operand 84 states. [2019-10-03 02:37:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:15,046 INFO L93 Difference]: Finished difference Result 481 states and 499 transitions. [2019-10-03 02:37:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-03 02:37:15,046 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-10-03 02:37:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:15,050 INFO L225 Difference]: With dead ends: 481 [2019-10-03 02:37:15,050 INFO L226 Difference]: Without dead ends: 481 [2019-10-03 02:37:15,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-10-03 02:37:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 480. [2019-10-03 02:37:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-10-03 02:37:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 498 transitions. [2019-10-03 02:37:15,057 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 498 transitions. Word has length 171 [2019-10-03 02:37:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:15,058 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 498 transitions. [2019-10-03 02:37:15,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-03 02:37:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 498 transitions. [2019-10-03 02:37:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-03 02:37:15,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:15,059 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:15,060 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -307121854, now seen corresponding path program 15 times [2019-10-03 02:37:15,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:15,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:15,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:17,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:17,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:17,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:17,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:17,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:17,774 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:17,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:37:17,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:37:17,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:37:17,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:17,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-10-03 02:37:17,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:18,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:21,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:21,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-10-03 02:37:21,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:21,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-03 02:37:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-03 02:37:21,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:21,489 INFO L87 Difference]: Start difference. First operand 480 states and 498 transitions. Second operand 85 states. [2019-10-03 02:37:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:26,627 INFO L93 Difference]: Finished difference Result 483 states and 501 transitions. [2019-10-03 02:37:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-03 02:37:26,627 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-10-03 02:37:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:26,629 INFO L225 Difference]: With dead ends: 483 [2019-10-03 02:37:26,629 INFO L226 Difference]: Without dead ends: 483 [2019-10-03 02:37:26,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-03 02:37:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 482. [2019-10-03 02:37:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-03 02:37:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 500 transitions. [2019-10-03 02:37:26,637 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 500 transitions. Word has length 173 [2019-10-03 02:37:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:26,637 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 500 transitions. [2019-10-03 02:37:26,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-03 02:37:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 500 transitions. [2019-10-03 02:37:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-03 02:37:26,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:26,639 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:26,639 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:26,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1201116380, now seen corresponding path program 16 times [2019-10-03 02:37:26,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:26,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:29,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:29,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:29,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:29,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:29,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:29,545 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:29,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:29,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:37:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:29,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-03 02:37:29,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:29,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:33,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:33,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 102 [2019-10-03 02:37:33,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:33,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-03 02:37:33,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-03 02:37:33,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:33,263 INFO L87 Difference]: Start difference. First operand 482 states and 500 transitions. Second operand 86 states. [2019-10-03 02:37:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:42,194 INFO L93 Difference]: Finished difference Result 485 states and 503 transitions. [2019-10-03 02:37:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-03 02:37:42,194 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-10-03 02:37:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:42,198 INFO L225 Difference]: With dead ends: 485 [2019-10-03 02:37:42,198 INFO L226 Difference]: Without dead ends: 485 [2019-10-03 02:37:42,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 267 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-03 02:37:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-10-03 02:37:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-03 02:37:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 502 transitions. [2019-10-03 02:37:42,206 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 502 transitions. Word has length 175 [2019-10-03 02:37:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:42,206 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 502 transitions. [2019-10-03 02:37:42,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-03 02:37:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 502 transitions. [2019-10-03 02:37:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-03 02:37:42,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:42,207 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:42,207 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1080886794, now seen corresponding path program 17 times [2019-10-03 02:37:42,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:42,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:42,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:44,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:44,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:44,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:44,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:44,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:44,855 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:44,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:37:44,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:37:45,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-03 02:37:45,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:45,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-10-03 02:37:45,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:45,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:48,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:48,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-10-03 02:37:48,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:48,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-03 02:37:48,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-03 02:37:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:48,590 INFO L87 Difference]: Start difference. First operand 484 states and 502 transitions. Second operand 87 states. [2019-10-03 02:37:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:53,295 INFO L93 Difference]: Finished difference Result 487 states and 505 transitions. [2019-10-03 02:37:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-03 02:37:53,295 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-10-03 02:37:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:53,298 INFO L225 Difference]: With dead ends: 487 [2019-10-03 02:37:53,298 INFO L226 Difference]: Without dead ends: 487 [2019-10-03 02:37:53,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 270 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-03 02:37:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 486. [2019-10-03 02:37:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-10-03 02:37:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 504 transitions. [2019-10-03 02:37:53,306 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 504 transitions. Word has length 177 [2019-10-03 02:37:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:53,307 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 504 transitions. [2019-10-03 02:37:53,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-03 02:37:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 504 transitions. [2019-10-03 02:37:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-03 02:37:53,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:53,308 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:53,309 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash 642351248, now seen corresponding path program 18 times [2019-10-03 02:37:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:53,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:55,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:55,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:55,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:55,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:55,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:55,963 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-10-03 02:37:56,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:37:56,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:37:56,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:37:56,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:56,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-03 02:37:56,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:56,229 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:59,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:59,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-10-03 02:37:59,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:59,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-03 02:37:59,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-03 02:37:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:59,698 INFO L87 Difference]: Start difference. First operand 486 states and 504 transitions. Second operand 88 states. [2019-10-03 02:38:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:08,752 INFO L93 Difference]: Finished difference Result 489 states and 507 transitions. [2019-10-03 02:38:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-03 02:38:08,753 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-10-03 02:38:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:08,756 INFO L225 Difference]: With dead ends: 489 [2019-10-03 02:38:08,756 INFO L226 Difference]: Without dead ends: 489 [2019-10-03 02:38:08,757 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 273 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-10-03 02:38:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 488. [2019-10-03 02:38:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-03 02:38:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 506 transitions. [2019-10-03 02:38:08,763 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 506 transitions. Word has length 179 [2019-10-03 02:38:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:08,763 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 506 transitions. [2019-10-03 02:38:08,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-03 02:38:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 506 transitions. [2019-10-03 02:38:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-03 02:38:08,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:08,765 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:08,765 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1183266646, now seen corresponding path program 19 times [2019-10-03 02:38:08,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:08,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:38:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:08,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:11,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:11,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:38:11,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:38:11,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:38:11,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:11,565 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-10-03 02:38:11,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:11,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:38:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:11,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 88 conjunts are in the unsatisfiable core [2019-10-03 02:38:11,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:38:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:11,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:38:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:15,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:38:15,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 102 [2019-10-03 02:38:15,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:38:15,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-03 02:38:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-03 02:38:15,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:15,343 INFO L87 Difference]: Start difference. First operand 488 states and 506 transitions. Second operand 89 states. [2019-10-03 02:38:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:24,520 INFO L93 Difference]: Finished difference Result 491 states and 509 transitions. [2019-10-03 02:38:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-03 02:38:24,520 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-10-03 02:38:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:24,522 INFO L225 Difference]: With dead ends: 491 [2019-10-03 02:38:24,523 INFO L226 Difference]: Without dead ends: 491 [2019-10-03 02:38:24,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 276 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-03 02:38:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 490. [2019-10-03 02:38:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-03 02:38:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 508 transitions. [2019-10-03 02:38:24,531 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 508 transitions. Word has length 181 [2019-10-03 02:38:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:24,546 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 508 transitions. [2019-10-03 02:38:24,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-03 02:38:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 508 transitions. [2019-10-03 02:38:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-03 02:38:24,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:24,549 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:24,549 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1039561284, now seen corresponding path program 20 times [2019-10-03 02:38:24,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:24,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:24,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:27,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:27,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:38:27,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:38:27,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:38:27,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:27,575 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:38:27,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:38:27,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:38:27,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-10-03 02:38:27,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:38:27,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-10-03 02:38:27,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:38:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:27,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:38:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:38:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-10-03 02:38:31,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:38:31,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-03 02:38:31,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-03 02:38:31,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:31,322 INFO L87 Difference]: Start difference. First operand 490 states and 508 transitions. Second operand 90 states. [2019-10-03 02:38:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:40,476 INFO L93 Difference]: Finished difference Result 493 states and 511 transitions. [2019-10-03 02:38:40,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-03 02:38:40,477 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-10-03 02:38:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:40,480 INFO L225 Difference]: With dead ends: 493 [2019-10-03 02:38:40,480 INFO L226 Difference]: Without dead ends: 493 [2019-10-03 02:38:40,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 279 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-03 02:38:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2019-10-03 02:38:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-03 02:38:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 510 transitions. [2019-10-03 02:38:40,487 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 510 transitions. Word has length 183 [2019-10-03 02:38:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:40,487 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 510 transitions. [2019-10-03 02:38:40,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-03 02:38:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 510 transitions. [2019-10-03 02:38:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:38:40,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:40,489 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:40,489 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1716511394, now seen corresponding path program 21 times [2019-10-03 02:38:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:40,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:38:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:40,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:43,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:43,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:38:43,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:38:43,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:38:43,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:43,410 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:38:43,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:38:43,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:38:43,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:38:43,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:38:43,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-03 02:38:43,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:38:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:43,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:38:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:47,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:38:47,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-10-03 02:38:47,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:38:47,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-03 02:38:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-03 02:38:47,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:47,673 INFO L87 Difference]: Start difference. First operand 492 states and 510 transitions. Second operand 91 states. [2019-10-03 02:38:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:56,799 INFO L93 Difference]: Finished difference Result 495 states and 513 transitions. [2019-10-03 02:38:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-03 02:38:56,800 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-10-03 02:38:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:56,803 INFO L225 Difference]: With dead ends: 495 [2019-10-03 02:38:56,803 INFO L226 Difference]: Without dead ends: 495 [2019-10-03 02:38:56,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 282 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-03 02:38:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2019-10-03 02:38:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-03 02:38:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 512 transitions. [2019-10-03 02:38:56,811 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 512 transitions. Word has length 185 [2019-10-03 02:38:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:56,812 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 512 transitions. [2019-10-03 02:38:56,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-03 02:38:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 512 transitions. [2019-10-03 02:38:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-03 02:38:56,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:56,814 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:56,814 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash -307533320, now seen corresponding path program 22 times [2019-10-03 02:38:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:56,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:56,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:38:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:56,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:59,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:59,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:38:59,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:38:59,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:38:59,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:59,813 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:38:59,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:59,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:39:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:00,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2019-10-03 02:39:00,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:39:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:00,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:39:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:03,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:39:03,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 102 [2019-10-03 02:39:03,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:39:03,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-10-03 02:39:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-10-03 02:39:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:03,600 INFO L87 Difference]: Start difference. First operand 494 states and 512 transitions. Second operand 92 states. [2019-10-03 02:39:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:12,814 INFO L93 Difference]: Finished difference Result 497 states and 515 transitions. [2019-10-03 02:39:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-10-03 02:39:12,815 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-10-03 02:39:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:12,818 INFO L225 Difference]: With dead ends: 497 [2019-10-03 02:39:12,818 INFO L226 Difference]: Without dead ends: 497 [2019-10-03 02:39:12,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 285 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-03 02:39:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 496. [2019-10-03 02:39:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-03 02:39:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 514 transitions. [2019-10-03 02:39:12,826 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 514 transitions. Word has length 187 [2019-10-03 02:39:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:12,826 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 514 transitions. [2019-10-03 02:39:12,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-10-03 02:39:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 514 transitions. [2019-10-03 02:39:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 02:39:12,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:12,828 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:12,829 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 805697554, now seen corresponding path program 23 times [2019-10-03 02:39:12,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:12,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:12,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:12,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:15,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:15,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:15,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:39:15,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:39:15,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:15,877 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:39:16,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:39:16,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:39:16,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-03 02:39:16,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:39:16,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-10-03 02:39:16,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:39:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:16,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:39:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:19,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:39:19,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-10-03 02:39:19,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:39:19,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-10-03 02:39:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-10-03 02:39:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:19,726 INFO L87 Difference]: Start difference. First operand 496 states and 514 transitions. Second operand 93 states. [2019-10-03 02:39:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:23,406 INFO L93 Difference]: Finished difference Result 499 states and 517 transitions. [2019-10-03 02:39:23,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-03 02:39:23,406 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-10-03 02:39:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:23,409 INFO L225 Difference]: With dead ends: 499 [2019-10-03 02:39:23,409 INFO L226 Difference]: Without dead ends: 499 [2019-10-03 02:39:23,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-03 02:39:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 498. [2019-10-03 02:39:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-03 02:39:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 516 transitions. [2019-10-03 02:39:23,416 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 516 transitions. Word has length 189 [2019-10-03 02:39:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:23,416 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 516 transitions. [2019-10-03 02:39:23,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-10-03 02:39:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 516 transitions. [2019-10-03 02:39:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 02:39:23,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:23,418 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:23,419 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1173710764, now seen corresponding path program 24 times [2019-10-03 02:39:23,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:23,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:23,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:39:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:23,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:26,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:26,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:26,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:39:26,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:39:26,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:26,502 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:39:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:39:26,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:39:26,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:39:26,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:39:26,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-10-03 02:39:26,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:39:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:26,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:39:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:30,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:39:30,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-10-03 02:39:30,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:39:30,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-10-03 02:39:30,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-10-03 02:39:30,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:30,327 INFO L87 Difference]: Start difference. First operand 498 states and 516 transitions. Second operand 94 states. [2019-10-03 02:39:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:39,497 INFO L93 Difference]: Finished difference Result 501 states and 519 transitions. [2019-10-03 02:39:39,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-03 02:39:39,498 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-10-03 02:39:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:39,500 INFO L225 Difference]: With dead ends: 501 [2019-10-03 02:39:39,500 INFO L226 Difference]: Without dead ends: 501 [2019-10-03 02:39:39,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-10-03 02:39:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2019-10-03 02:39:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-03 02:39:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 518 transitions. [2019-10-03 02:39:39,508 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 518 transitions. Word has length 191 [2019-10-03 02:39:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:39,509 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 518 transitions. [2019-10-03 02:39:39,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-10-03 02:39:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 518 transitions. [2019-10-03 02:39:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-03 02:39:39,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:39,511 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:39,511 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1647879994, now seen corresponding path program 25 times [2019-10-03 02:39:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:39:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:42,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:42,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:42,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:39:42,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:39:42,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:42,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:39:42,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:42,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:39:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:42,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-03 02:39:42,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:39:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:42,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:39:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:46,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:39:46,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-10-03 02:39:46,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:39:46,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-10-03 02:39:46,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-10-03 02:39:46,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:46,440 INFO L87 Difference]: Start difference. First operand 500 states and 518 transitions. Second operand 95 states. [2019-10-03 02:39:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:49,805 INFO L93 Difference]: Finished difference Result 503 states and 521 transitions. [2019-10-03 02:39:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-03 02:39:49,806 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-10-03 02:39:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:49,808 INFO L225 Difference]: With dead ends: 503 [2019-10-03 02:39:49,808 INFO L226 Difference]: Without dead ends: 503 [2019-10-03 02:39:49,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-03 02:39:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 502. [2019-10-03 02:39:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-03 02:39:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 520 transitions. [2019-10-03 02:39:49,814 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 520 transitions. Word has length 193 [2019-10-03 02:39:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:49,815 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 520 transitions. [2019-10-03 02:39:49,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-10-03 02:39:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 520 transitions. [2019-10-03 02:39:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:39:49,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:49,816 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:49,816 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1222732640, now seen corresponding path program 26 times [2019-10-03 02:39:49,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:49,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:49,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:53,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:53,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:53,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:39:53,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:39:53,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:53,073 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:39:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:39:53,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:39:53,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-10-03 02:39:53,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:39:53,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-03 02:39:53,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:39:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:53,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:39:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:56,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:39:56,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-10-03 02:39:56,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:39:56,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-10-03 02:39:56,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-10-03 02:39:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:39:56,966 INFO L87 Difference]: Start difference. First operand 502 states and 520 transitions. Second operand 96 states. [2019-10-03 02:40:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:06,062 INFO L93 Difference]: Finished difference Result 505 states and 523 transitions. [2019-10-03 02:40:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-03 02:40:06,062 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-10-03 02:40:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:06,065 INFO L225 Difference]: With dead ends: 505 [2019-10-03 02:40:06,065 INFO L226 Difference]: Without dead ends: 505 [2019-10-03 02:40:06,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 297 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:40:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-10-03 02:40:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 504. [2019-10-03 02:40:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-03 02:40:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 522 transitions. [2019-10-03 02:40:06,072 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 522 transitions. Word has length 195 [2019-10-03 02:40:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:06,072 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 522 transitions. [2019-10-03 02:40:06,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-10-03 02:40:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 522 transitions. [2019-10-03 02:40:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:40:06,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:06,074 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:06,074 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:06,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:06,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497414, now seen corresponding path program 27 times [2019-10-03 02:40:06,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:06,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:40:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:06,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:09,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:09,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:40:09,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:40:09,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:40:09,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:09,390 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:40:09,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:40:09,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:40:09,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:40:09,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:40:09,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-03 02:40:09,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:40:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:09,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:40:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:13,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:40:13,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-10-03 02:40:13,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:40:13,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-03 02:40:13,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-03 02:40:13,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:40:13,486 INFO L87 Difference]: Start difference. First operand 504 states and 522 transitions. Second operand 97 states. [2019-10-03 02:40:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:22,766 INFO L93 Difference]: Finished difference Result 507 states and 525 transitions. [2019-10-03 02:40:22,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-03 02:40:22,766 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-10-03 02:40:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:22,768 INFO L225 Difference]: With dead ends: 507 [2019-10-03 02:40:22,768 INFO L226 Difference]: Without dead ends: 507 [2019-10-03 02:40:22,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 300 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:40:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-03 02:40:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2019-10-03 02:40:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-03 02:40:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 524 transitions. [2019-10-03 02:40:22,774 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 524 transitions. Word has length 197 [2019-10-03 02:40:22,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:22,775 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 524 transitions. [2019-10-03 02:40:22,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-03 02:40:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 524 transitions. [2019-10-03 02:40:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:40:22,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:22,776 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:22,776 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 704410900, now seen corresponding path program 28 times [2019-10-03 02:40:22,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:22,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:40:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:22,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:26,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:26,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:40:26,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:40:26,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:40:26,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:26,220 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:40:26,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:26,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:40:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:26,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-10-03 02:40:26,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:40:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:26,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:40:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:30,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:40:30,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-10-03 02:40:30,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:40:30,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-10-03 02:40:30,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-10-03 02:40:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:40:30,153 INFO L87 Difference]: Start difference. First operand 506 states and 524 transitions. Second operand 98 states. [2019-10-03 02:40:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:39,435 INFO L93 Difference]: Finished difference Result 509 states and 527 transitions. [2019-10-03 02:40:39,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-10-03 02:40:39,435 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-10-03 02:40:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:39,437 INFO L225 Difference]: With dead ends: 509 [2019-10-03 02:40:39,437 INFO L226 Difference]: Without dead ends: 509 [2019-10-03 02:40:39,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 303 SyntacticMatches, 92 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:40:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-03 02:40:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 508. [2019-10-03 02:40:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-03 02:40:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 526 transitions. [2019-10-03 02:40:39,444 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 526 transitions. Word has length 199 [2019-10-03 02:40:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:39,444 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 526 transitions. [2019-10-03 02:40:39,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-10-03 02:40:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 526 transitions. [2019-10-03 02:40:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:40:39,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:39,446 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:39,446 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:39,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1673483218, now seen corresponding path program 29 times [2019-10-03 02:40:39,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:39,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:42,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:42,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:40:42,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:40:42,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:40:42,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:42,833 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:40:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:40:43,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:40:43,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-10-03 02:40:43,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:40:43,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-03 02:40:43,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:40:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:43,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:40:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:46,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:40:46,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-10-03 02:40:46,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:40:46,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-03 02:40:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-03 02:40:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:40:46,768 INFO L87 Difference]: Start difference. First operand 508 states and 526 transitions. Second operand 99 states. [2019-10-03 02:40:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:56,040 INFO L93 Difference]: Finished difference Result 511 states and 529 transitions. [2019-10-03 02:40:56,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-03 02:40:56,040 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-10-03 02:40:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:56,042 INFO L225 Difference]: With dead ends: 511 [2019-10-03 02:40:56,042 INFO L226 Difference]: Without dead ends: 511 [2019-10-03 02:40:56,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 306 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:40:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-03 02:40:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 510. [2019-10-03 02:40:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-03 02:40:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 528 transitions. [2019-10-03 02:40:56,048 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 528 transitions. Word has length 201 [2019-10-03 02:40:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:56,049 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 528 transitions. [2019-10-03 02:40:56,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-03 02:40:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 528 transitions. [2019-10-03 02:40:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:40:56,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:56,050 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:56,050 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1907129144, now seen corresponding path program 30 times [2019-10-03 02:40:56,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:56,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:40:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:56,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:59,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:59,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:40:59,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:40:59,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:40:59,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:59,572 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:40:59,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:40:59,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:40:59,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:40:59,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:40:59,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-10-03 02:40:59,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:40:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:59,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:41:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:03,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:41:03,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-10-03 02:41:03,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:41:03,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-10-03 02:41:03,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-10-03 02:41:03,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:41:03,437 INFO L87 Difference]: Start difference. First operand 510 states and 528 transitions. Second operand 100 states. [2019-10-03 02:41:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:08,737 INFO L93 Difference]: Finished difference Result 513 states and 531 transitions. [2019-10-03 02:41:08,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-03 02:41:08,737 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-10-03 02:41:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:08,741 INFO L225 Difference]: With dead ends: 513 [2019-10-03 02:41:08,742 INFO L226 Difference]: Without dead ends: 513 [2019-10-03 02:41:08,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 309 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:41:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-03 02:41:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-10-03 02:41:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-03 02:41:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 530 transitions. [2019-10-03 02:41:08,750 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 530 transitions. Word has length 203 [2019-10-03 02:41:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:08,750 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 530 transitions. [2019-10-03 02:41:08,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-10-03 02:41:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 530 transitions. [2019-10-03 02:41:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:41:08,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:08,752 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:08,752 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:08,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1192402658, now seen corresponding path program 31 times [2019-10-03 02:41:08,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:08,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:41:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:08,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:12,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:12,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:41:12,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:41:12,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:41:12,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:12,332 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:41:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:12,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:41:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:12,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-03 02:41:12,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:41:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:12,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:41:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:16,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:41:16,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-10-03 02:41:16,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:41:16,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-03 02:41:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-03 02:41:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:41:16,331 INFO L87 Difference]: Start difference. First operand 512 states and 530 transitions. Second operand 101 states. [2019-10-03 02:41:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:21,581 INFO L93 Difference]: Finished difference Result 515 states and 533 transitions. [2019-10-03 02:41:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-03 02:41:21,581 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-10-03 02:41:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:21,584 INFO L225 Difference]: With dead ends: 515 [2019-10-03 02:41:21,584 INFO L226 Difference]: Without dead ends: 515 [2019-10-03 02:41:21,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 312 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:41:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-03 02:41:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 514. [2019-10-03 02:41:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-10-03 02:41:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 532 transitions. [2019-10-03 02:41:21,591 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 532 transitions. Word has length 205 [2019-10-03 02:41:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:21,591 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 532 transitions. [2019-10-03 02:41:21,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-03 02:41:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 532 transitions. [2019-10-03 02:41:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:41:21,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:21,593 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:21,593 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash -864839044, now seen corresponding path program 32 times [2019-10-03 02:41:21,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:21,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:25,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:25,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:41:25,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:41:25,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:41:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:25,207 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:41:25,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:41:25,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:41:25,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-10-03 02:41:25,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:41:25,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-03 02:41:25,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:41:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:25,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:41:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:29,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:41:29,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-10-03 02:41:29,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:41:29,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-10-03 02:41:29,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-10-03 02:41:29,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:41:29,186 INFO L87 Difference]: Start difference. First operand 514 states and 532 transitions. Second operand 102 states. [2019-10-03 02:41:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:34,359 INFO L93 Difference]: Finished difference Result 516 states and 534 transitions. [2019-10-03 02:41:34,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-03 02:41:34,360 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-10-03 02:41:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:34,362 INFO L225 Difference]: With dead ends: 516 [2019-10-03 02:41:34,362 INFO L226 Difference]: Without dead ends: 516 [2019-10-03 02:41:34,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:41:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-03 02:41:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2019-10-03 02:41:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-03 02:41:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 534 transitions. [2019-10-03 02:41:34,370 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 534 transitions. Word has length 207 [2019-10-03 02:41:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:34,370 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 534 transitions. [2019-10-03 02:41:34,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-10-03 02:41:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 534 transitions. [2019-10-03 02:41:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:41:34,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:34,372 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:34,372 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2105808790, now seen corresponding path program 33 times [2019-10-03 02:41:34,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:41:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:36,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:36,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:41:36,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:41:36,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:41:36,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:36,141 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:41:36,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:41:36,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:41:36,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:41:36,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:41:36,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-10-03 02:41:36,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:41:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:41:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:36,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:41:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:36,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:41:36,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-10-03 02:41:36,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:41:36,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-03 02:41:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-03 02:41:36,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:41:36,882 INFO L87 Difference]: Start difference. First operand 516 states and 534 transitions. Second operand 55 states. [2019-10-03 02:41:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:44,496 INFO L93 Difference]: Finished difference Result 520 states and 538 transitions. [2019-10-03 02:41:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-03 02:41:44,497 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-10-03 02:41:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:44,500 INFO L225 Difference]: With dead ends: 520 [2019-10-03 02:41:44,500 INFO L226 Difference]: Without dead ends: 519 [2019-10-03 02:41:44,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 02:41:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-03 02:41:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 518. [2019-10-03 02:41:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-03 02:41:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 536 transitions. [2019-10-03 02:41:44,506 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 536 transitions. Word has length 209 [2019-10-03 02:41:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:44,507 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 536 transitions. [2019-10-03 02:41:44,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-03 02:41:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 536 transitions. [2019-10-03 02:41:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:41:44,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:44,509 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:44,509 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 745125424, now seen corresponding path program 34 times [2019-10-03 02:41:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:44,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:41:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:44,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:45,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:45,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-10-03 02:41:45,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:45,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-03 02:41:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-03 02:41:45,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:41:45,712 INFO L87 Difference]: Start difference. First operand 518 states and 536 transitions. Second operand 52 states. [2019-10-03 02:41:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:47,097 INFO L93 Difference]: Finished difference Result 513 states and 530 transitions. [2019-10-03 02:41:47,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-03 02:41:47,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-10-03 02:41:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:47,098 INFO L225 Difference]: With dead ends: 513 [2019-10-03 02:41:47,098 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:41:47,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:41:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:41:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:41:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:41:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:41:47,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-10-03 02:41:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:47,100 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:41:47,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-03 02:41:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:41:47,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:41:47,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:41:47 BoogieIcfgContainer [2019-10-03 02:41:47,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:41:47,108 INFO L168 Benchmark]: Toolchain (without parser) took 500736.33 ms. Allocated memory was 139.5 MB in the beginning and 1.1 GB in the end (delta: 986.2 MB). Free memory was 86.2 MB in the beginning and 423.8 MB in the end (delta: -337.5 MB). Peak memory consumption was 648.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:47,108 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:41:47,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.97 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 86.0 MB in the beginning and 172.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:47,110 INFO L168 Benchmark]: Boogie Preprocessor took 57.55 ms. Allocated memory is still 199.2 MB. Free memory was 172.2 MB in the beginning and 169.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:47,110 INFO L168 Benchmark]: RCFGBuilder took 908.72 ms. Allocated memory is still 199.2 MB. Free memory was 169.0 MB in the beginning and 106.3 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:47,111 INFO L168 Benchmark]: TraceAbstraction took 499125.99 ms. Allocated memory was 199.2 MB in the beginning and 1.1 GB in the end (delta: 926.4 MB). Free memory was 105.6 MB in the beginning and 423.8 MB in the end (delta: -318.1 MB). Peak memory consumption was 608.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:47,114 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 636.97 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 86.0 MB in the beginning and 172.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.55 ms. Allocated memory is still 199.2 MB. Free memory was 172.2 MB in the beginning and 169.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 908.72 ms. Allocated memory is still 199.2 MB. Free memory was 169.0 MB in the beginning and 106.3 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 499125.99 ms. Allocated memory was 199.2 MB in the beginning and 1.1 GB in the end (delta: 926.4 MB). Free memory was 105.6 MB in the beginning and 423.8 MB in the end (delta: -318.1 MB). Peak memory consumption was 608.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 1 error locations. SAFE Result, 499.0s OverallTime, 45 OverallIterations, 34 TraceHistogramMax, 270.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2571 SDtfs, 9682 SDslu, 31053 SDs, 0 SdLazy, 419340 SolverSat, 10007 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 207.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15152 GetRequests, 9032 SyntacticMatches, 2210 SemanticMatches, 3910 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113503 ImplicationChecksByTransitivity, 212.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=518occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 45 MinimizatonAttempts, 33 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 218.4s InterpolantComputationTime, 13466 NumberOfCodeBlocks, 13466 NumberOfCodeBlocksAsserted, 276 NumberOfCheckSat, 19196 ConstructedInterpolants, 0 QuantifiedInterpolants, 10216144 SizeOfPredicates, 35 NumberOfNonLiveVariables, 14454 ConjunctsInSsa, 2844 ConjunctsInUnsatCore, 111 InterpolantComputations, 12 PerfectInterpolantSequences, 1156/38743 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...