java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:19,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:19,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:19,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:19,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:19,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:19,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:19,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:19,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:19,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:19,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:19,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:19,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:19,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:19,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:19,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:19,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:19,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:19,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:19,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:19,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:19,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:19,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:19,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:19,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:19,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:19,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:19,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:19,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:19,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:19,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:19,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:19,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:19,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:19,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:19,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:19,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:19,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:19,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:19,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:19,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:19,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:05:19,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:19,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:19,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:19,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:19,565 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:19,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:19,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:19,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:19,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:19,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:19,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:19,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:19,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:19,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:19,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:19,568 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:19,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:19,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:19,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:19,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:19,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:19,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:19,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:19,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:19,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:19,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:19,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:19,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:19,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:05:19,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:19,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:19,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:19,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:19,886 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:19,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-13 21:05:19,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f963733/3a94e1e006394354aab36d10b649c9d2/FLAG3930d26fc [2019-10-13 21:05:20,455 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:20,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-13 21:05:20,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f963733/3a94e1e006394354aab36d10b649c9d2/FLAG3930d26fc [2019-10-13 21:05:20,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f963733/3a94e1e006394354aab36d10b649c9d2 [2019-10-13 21:05:20,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:20,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:20,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:20,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:20,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:20,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:20" (1/1) ... [2019-10-13 21:05:20,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c329617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:20, skipping insertion in model container [2019-10-13 21:05:20,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:20" (1/1) ... [2019-10-13 21:05:20,846 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:20,875 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:21,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:21,124 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:21,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:21,195 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:21,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21 WrapperNode [2019-10-13 21:05:21,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:21,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:21,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:21,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:21,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (1/1) ... [2019-10-13 21:05:21,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (1/1) ... [2019-10-13 21:05:21,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (1/1) ... [2019-10-13 21:05:21,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (1/1) ... [2019-10-13 21:05:21,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (1/1) ... [2019-10-13 21:05:21,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (1/1) ... [2019-10-13 21:05:21,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (1/1) ... [2019-10-13 21:05:21,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:21,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:21,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:21,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:21,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (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-13 21:05:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:21,677 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:21,677 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:21,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:21 BoogieIcfgContainer [2019-10-13 21:05:21,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:21,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:21,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:21,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:21,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:20" (1/3) ... [2019-10-13 21:05:21,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425daf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:21, skipping insertion in model container [2019-10-13 21:05:21,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:21" (2/3) ... [2019-10-13 21:05:21,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425daf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:21, skipping insertion in model container [2019-10-13 21:05:21,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:21" (3/3) ... [2019-10-13 21:05:21,691 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-13 21:05:21,703 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:21,713 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:21,728 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:21,754 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:21,754 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:21,754 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:21,755 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:21,755 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:21,755 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:21,755 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:21,755 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-13 21:05:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:21,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:21,791 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:21,794 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-10-13 21:05:21,809 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:21,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115346909] [2019-10-13 21:05:21,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:21,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:21,994 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-13 21:05:21,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115346909] [2019-10-13 21:05:21,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:21,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:21,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317802602] [2019-10-13 21:05:22,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,019 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-13 21:05:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,085 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2019-10-13 21:05:22,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,100 INFO L225 Difference]: With dead ends: 81 [2019-10-13 21:05:22,100 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 21:05:22,104 INFO L600 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-13 21:05:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 21:05:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-13 21:05:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:05:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-10-13 21:05:22,149 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-10-13 21:05:22,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,149 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-10-13 21:05:22,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-10-13 21:05:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:22,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,153 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-10-13 21:05:22,154 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001459253] [2019-10-13 21:05:22,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,243 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-13 21:05:22,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001459253] [2019-10-13 21:05:22,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793544930] [2019-10-13 21:05:22,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,248 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-10-13 21:05:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,282 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2019-10-13 21:05:22,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,284 INFO L225 Difference]: With dead ends: 107 [2019-10-13 21:05:22,284 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 21:05:22,286 INFO L600 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-13 21:05:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 21:05:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-13 21:05:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 21:05:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-10-13 21:05:22,298 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-10-13 21:05:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,298 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-10-13 21:05:22,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-10-13 21:05:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:22,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,300 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-10-13 21:05:22,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57311046] [2019-10-13 21:05:22,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,354 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-13 21:05:22,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57311046] [2019-10-13 21:05:22,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123284956] [2019-10-13 21:05:22,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,357 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-10-13 21:05:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,405 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2019-10-13 21:05:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,411 INFO L225 Difference]: With dead ends: 99 [2019-10-13 21:05:22,412 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 21:05:22,415 INFO L600 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-13 21:05:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 21:05:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-13 21:05:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 21:05:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-10-13 21:05:22,437 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-10-13 21:05:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,437 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-10-13 21:05:22,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-10-13 21:05:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:22,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,439 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,440 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-10-13 21:05:22,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492026076] [2019-10-13 21:05:22,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,529 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-13 21:05:22,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492026076] [2019-10-13 21:05:22,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152410525] [2019-10-13 21:05:22,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,533 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-10-13 21:05:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,565 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2019-10-13 21:05:22,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,572 INFO L225 Difference]: With dead ends: 124 [2019-10-13 21:05:22,572 INFO L226 Difference]: Without dead ends: 122 [2019-10-13 21:05:22,574 INFO L600 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-13 21:05:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-13 21:05:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-10-13 21:05:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 21:05:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-10-13 21:05:22,603 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-10-13 21:05:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,603 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-10-13 21:05:22,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-10-13 21:05:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:22,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,605 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,605 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-10-13 21:05:22,606 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141975724] [2019-10-13 21:05:22,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,663 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-13 21:05:22,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141975724] [2019-10-13 21:05:22,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076274115] [2019-10-13 21:05:22,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,666 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-10-13 21:05:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,700 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2019-10-13 21:05:22,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,702 INFO L225 Difference]: With dead ends: 204 [2019-10-13 21:05:22,702 INFO L226 Difference]: Without dead ends: 124 [2019-10-13 21:05:22,704 INFO L600 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-13 21:05:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-13 21:05:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-13 21:05:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-13 21:05:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-10-13 21:05:22,729 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-10-13 21:05:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,729 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-10-13 21:05:22,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-10-13 21:05:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:22,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,733 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,733 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-10-13 21:05:22,734 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318031027] [2019-10-13 21:05:22,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,801 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-13 21:05:22,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318031027] [2019-10-13 21:05:22,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168744933] [2019-10-13 21:05:22,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,804 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-10-13 21:05:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,822 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2019-10-13 21:05:22,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,825 INFO L225 Difference]: With dead ends: 183 [2019-10-13 21:05:22,825 INFO L226 Difference]: Without dead ends: 126 [2019-10-13 21:05:22,826 INFO L600 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-13 21:05:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-13 21:05:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-10-13 21:05:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-13 21:05:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-10-13 21:05:22,844 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-10-13 21:05:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,844 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-10-13 21:05:22,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-10-13 21:05:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:22,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,846 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-10-13 21:05:22,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565659088] [2019-10-13 21:05:22,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:22,888 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-13 21:05:22,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565659088] [2019-10-13 21:05:22,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:22,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:22,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566409073] [2019-10-13 21:05:22,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:22,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:22,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:22,893 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-10-13 21:05:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:22,928 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2019-10-13 21:05:22,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:22,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:22,931 INFO L225 Difference]: With dead ends: 228 [2019-10-13 21:05:22,932 INFO L226 Difference]: Without dead ends: 226 [2019-10-13 21:05:22,932 INFO L600 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-13 21:05:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-13 21:05:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-10-13 21:05:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-13 21:05:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-10-13 21:05:22,966 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-10-13 21:05:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:22,966 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-10-13 21:05:22,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-10-13 21:05:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:22,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:22,970 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:22,970 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:22,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:22,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-10-13 21:05:22,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:22,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674906647] [2019-10-13 21:05:22,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:22,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,032 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-13 21:05:23,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674906647] [2019-10-13 21:05:23,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855436861] [2019-10-13 21:05:23,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,035 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-10-13 21:05:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,070 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2019-10-13 21:05:23,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,072 INFO L225 Difference]: With dead ends: 392 [2019-10-13 21:05:23,072 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 21:05:23,073 INFO L600 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-13 21:05:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 21:05:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-10-13 21:05:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 21:05:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-10-13 21:05:23,085 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-10-13 21:05:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,085 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-10-13 21:05:23,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-10-13 21:05:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:23,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,087 INFO L380 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] [2019-10-13 21:05:23,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-10-13 21:05:23,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825124580] [2019-10-13 21:05:23,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,115 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-13 21:05:23,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825124580] [2019-10-13 21:05:23,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161663049] [2019-10-13 21:05:23,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,121 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-10-13 21:05:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,139 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2019-10-13 21:05:23,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,142 INFO L225 Difference]: With dead ends: 348 [2019-10-13 21:05:23,142 INFO L226 Difference]: Without dead ends: 238 [2019-10-13 21:05:23,143 INFO L600 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-13 21:05:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-13 21:05:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-10-13 21:05:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-13 21:05:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-10-13 21:05:23,153 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-10-13 21:05:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,154 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-10-13 21:05:23,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-10-13 21:05:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:23,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,155 INFO L380 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] [2019-10-13 21:05:23,156 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-10-13 21:05:23,156 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252428026] [2019-10-13 21:05:23,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,187 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-13 21:05:23,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252428026] [2019-10-13 21:05:23,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940298995] [2019-10-13 21:05:23,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,190 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-10-13 21:05:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,217 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2019-10-13 21:05:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,222 INFO L225 Difference]: With dead ends: 428 [2019-10-13 21:05:23,223 INFO L226 Difference]: Without dead ends: 426 [2019-10-13 21:05:23,223 INFO L600 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-13 21:05:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-13 21:05:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-10-13 21:05:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-13 21:05:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-10-13 21:05:23,236 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-10-13 21:05:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,237 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-10-13 21:05:23,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-10-13 21:05:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:05:23,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,238 INFO L380 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] [2019-10-13 21:05:23,239 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-10-13 21:05:23,239 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950368236] [2019-10-13 21:05:23,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,259 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-13 21:05:23,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950368236] [2019-10-13 21:05:23,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337979628] [2019-10-13 21:05:23,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,261 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-10-13 21:05:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,310 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2019-10-13 21:05:23,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:05:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,315 INFO L225 Difference]: With dead ends: 764 [2019-10-13 21:05:23,315 INFO L226 Difference]: Without dead ends: 450 [2019-10-13 21:05:23,317 INFO L600 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-13 21:05:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-13 21:05:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-10-13 21:05:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-13 21:05:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-10-13 21:05:23,341 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-10-13 21:05:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,342 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-10-13 21:05:23,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-10-13 21:05:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:23,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,344 INFO L380 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] [2019-10-13 21:05:23,344 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-10-13 21:05:23,344 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872041715] [2019-10-13 21:05:23,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,378 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-13 21:05:23,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872041715] [2019-10-13 21:05:23,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141597962] [2019-10-13 21:05:23,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,380 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-10-13 21:05:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,402 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2019-10-13 21:05:23,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,407 INFO L225 Difference]: With dead ends: 672 [2019-10-13 21:05:23,407 INFO L226 Difference]: Without dead ends: 458 [2019-10-13 21:05:23,408 INFO L600 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-13 21:05:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-13 21:05:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-10-13 21:05:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 21:05:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-10-13 21:05:23,426 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-10-13 21:05:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,426 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-10-13 21:05:23,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-10-13 21:05:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:23,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,430 INFO L380 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] [2019-10-13 21:05:23,430 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-10-13 21:05:23,431 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863233097] [2019-10-13 21:05:23,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,467 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-13 21:05:23,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863233097] [2019-10-13 21:05:23,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139612250] [2019-10-13 21:05:23,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,470 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-10-13 21:05:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,496 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2019-10-13 21:05:23,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,505 INFO L225 Difference]: With dead ends: 812 [2019-10-13 21:05:23,506 INFO L226 Difference]: Without dead ends: 810 [2019-10-13 21:05:23,507 INFO L600 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-13 21:05:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-10-13 21:05:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-10-13 21:05:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-13 21:05:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-10-13 21:05:23,529 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-10-13 21:05:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,529 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-10-13 21:05:23,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-10-13 21:05:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:05:23,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,531 INFO L380 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] [2019-10-13 21:05:23,531 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-10-13 21:05:23,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843991025] [2019-10-13 21:05:23,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,565 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-13 21:05:23,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843991025] [2019-10-13 21:05:23,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916585815] [2019-10-13 21:05:23,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,567 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-10-13 21:05:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,595 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2019-10-13 21:05:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 21:05:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,600 INFO L225 Difference]: With dead ends: 1500 [2019-10-13 21:05:23,601 INFO L226 Difference]: Without dead ends: 874 [2019-10-13 21:05:23,603 INFO L600 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-13 21:05:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-13 21:05:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-10-13 21:05:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-13 21:05:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-10-13 21:05:23,635 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-10-13 21:05:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,635 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-10-13 21:05:23,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-10-13 21:05:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:23,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,638 INFO L380 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] [2019-10-13 21:05:23,638 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-10-13 21:05:23,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121820837] [2019-10-13 21:05:23,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,667 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-13 21:05:23,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121820837] [2019-10-13 21:05:23,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315221203] [2019-10-13 21:05:23,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,670 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-10-13 21:05:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,703 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2019-10-13 21:05:23,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,709 INFO L225 Difference]: With dead ends: 1308 [2019-10-13 21:05:23,709 INFO L226 Difference]: Without dead ends: 890 [2019-10-13 21:05:23,713 INFO L600 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-13 21:05:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-10-13 21:05:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-10-13 21:05:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-13 21:05:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-10-13 21:05:23,745 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-10-13 21:05:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,745 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-10-13 21:05:23,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-10-13 21:05:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:23,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,747 INFO L380 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] [2019-10-13 21:05:23,748 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-10-13 21:05:23,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727520132] [2019-10-13 21:05:23,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,775 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-13 21:05:23,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727520132] [2019-10-13 21:05:23,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079358228] [2019-10-13 21:05:23,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,780 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-10-13 21:05:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,823 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2019-10-13 21:05:23,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,832 INFO L225 Difference]: With dead ends: 1548 [2019-10-13 21:05:23,832 INFO L226 Difference]: Without dead ends: 1546 [2019-10-13 21:05:23,833 INFO L600 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-13 21:05:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-13 21:05:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-10-13 21:05:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-10-13 21:05:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-10-13 21:05:23,872 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-10-13 21:05:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:23,873 INFO L462 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-10-13 21:05:23,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-10-13 21:05:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:05:23,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:23,876 INFO L380 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] [2019-10-13 21:05:23,876 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-10-13 21:05:23,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:23,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954789311] [2019-10-13 21:05:23,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:23,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:23,910 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-13 21:05:23,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954789311] [2019-10-13 21:05:23,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:23,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:23,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117827736] [2019-10-13 21:05:23,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:23,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:23,914 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-10-13 21:05:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:23,971 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2019-10-13 21:05:23,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:23,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 21:05:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:23,983 INFO L225 Difference]: With dead ends: 2956 [2019-10-13 21:05:23,983 INFO L226 Difference]: Without dead ends: 1706 [2019-10-13 21:05:23,988 INFO L600 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-13 21:05:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-10-13 21:05:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-10-13 21:05:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-10-13 21:05:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-10-13 21:05:24,066 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-10-13 21:05:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:24,067 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-10-13 21:05:24,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-10-13 21:05:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:24,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:24,072 INFO L380 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] [2019-10-13 21:05:24,072 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-10-13 21:05:24,073 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:24,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983227488] [2019-10-13 21:05:24,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:24,095 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-13 21:05:24,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983227488] [2019-10-13 21:05:24,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:24,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:24,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499369719] [2019-10-13 21:05:24,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:24,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:24,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:24,102 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-10-13 21:05:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:24,164 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2019-10-13 21:05:24,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:24,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:24,176 INFO L225 Difference]: With dead ends: 2556 [2019-10-13 21:05:24,177 INFO L226 Difference]: Without dead ends: 1738 [2019-10-13 21:05:24,180 INFO L600 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-13 21:05:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-13 21:05:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-10-13 21:05:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-10-13 21:05:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-10-13 21:05:24,254 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-10-13 21:05:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:24,255 INFO L462 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-10-13 21:05:24,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-10-13 21:05:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:24,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:24,258 INFO L380 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] [2019-10-13 21:05:24,258 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-10-13 21:05:24,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:24,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85774517] [2019-10-13 21:05:24,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:24,282 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-13 21:05:24,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85774517] [2019-10-13 21:05:24,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:24,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:24,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614157123] [2019-10-13 21:05:24,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:24,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:24,285 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-10-13 21:05:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:24,345 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2019-10-13 21:05:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:24,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:24,359 INFO L225 Difference]: With dead ends: 2956 [2019-10-13 21:05:24,359 INFO L226 Difference]: Without dead ends: 2954 [2019-10-13 21:05:24,361 INFO L600 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-13 21:05:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-13 21:05:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-10-13 21:05:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-13 21:05:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-10-13 21:05:24,450 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-10-13 21:05:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:24,450 INFO L462 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-10-13 21:05:24,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-10-13 21:05:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:05:24,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:24,455 INFO L380 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] [2019-10-13 21:05:24,455 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:24,456 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-10-13 21:05:24,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:24,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523543328] [2019-10-13 21:05:24,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:24,478 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-13 21:05:24,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523543328] [2019-10-13 21:05:24,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:24,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:24,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934894337] [2019-10-13 21:05:24,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:24,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:24,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:24,480 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-10-13 21:05:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:24,566 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2019-10-13 21:05:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:24,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:05:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:24,584 INFO L225 Difference]: With dead ends: 5836 [2019-10-13 21:05:24,584 INFO L226 Difference]: Without dead ends: 3338 [2019-10-13 21:05:24,591 INFO L600 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-13 21:05:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-13 21:05:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-10-13 21:05:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-13 21:05:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-10-13 21:05:24,691 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-10-13 21:05:24,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:24,691 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-10-13 21:05:24,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-10-13 21:05:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:24,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:24,697 INFO L380 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] [2019-10-13 21:05:24,697 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-10-13 21:05:24,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:24,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115400710] [2019-10-13 21:05:24,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:24,717 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-13 21:05:24,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115400710] [2019-10-13 21:05:24,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:24,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:24,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166549325] [2019-10-13 21:05:24,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:24,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:24,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:24,719 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-10-13 21:05:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:24,785 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2019-10-13 21:05:24,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:24,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:24,801 INFO L225 Difference]: With dead ends: 5004 [2019-10-13 21:05:24,802 INFO L226 Difference]: Without dead ends: 3402 [2019-10-13 21:05:24,805 INFO L600 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-13 21:05:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-10-13 21:05:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-10-13 21:05:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-10-13 21:05:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-10-13 21:05:24,948 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-10-13 21:05:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:24,949 INFO L462 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-10-13 21:05:24,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-10-13 21:05:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:24,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:24,954 INFO L380 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] [2019-10-13 21:05:24,954 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:24,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:24,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-10-13 21:05:24,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:24,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076566274] [2019-10-13 21:05:24,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:24,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:24,988 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-13 21:05:24,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076566274] [2019-10-13 21:05:24,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:24,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:24,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77810690] [2019-10-13 21:05:24,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:24,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:24,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:24,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:24,991 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-10-13 21:05:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:25,104 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2019-10-13 21:05:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:25,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:25,159 INFO L225 Difference]: With dead ends: 9804 [2019-10-13 21:05:25,159 INFO L226 Difference]: Without dead ends: 6538 [2019-10-13 21:05:25,168 INFO L600 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-13 21:05:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-10-13 21:05:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-10-13 21:05:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-13 21:05:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-10-13 21:05:25,376 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-10-13 21:05:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:25,376 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-10-13 21:05:25,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-10-13 21:05:25,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:05:25,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:25,385 INFO L380 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] [2019-10-13 21:05:25,386 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:25,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-10-13 21:05:25,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:25,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538226000] [2019-10-13 21:05:25,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:25,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:25,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:25,404 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-13 21:05:25,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538226000] [2019-10-13 21:05:25,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:25,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:25,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011221847] [2019-10-13 21:05:25,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:25,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:25,407 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-10-13 21:05:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:25,567 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2019-10-13 21:05:25,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:25,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 21:05:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:25,582 INFO L225 Difference]: With dead ends: 7052 [2019-10-13 21:05:25,582 INFO L226 Difference]: Without dead ends: 7050 [2019-10-13 21:05:25,584 INFO L600 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-13 21:05:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-10-13 21:05:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-10-13 21:05:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-13 21:05:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-10-13 21:05:25,750 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-10-13 21:05:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:25,751 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-10-13 21:05:25,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-10-13 21:05:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:25,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:25,760 INFO L380 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] [2019-10-13 21:05:25,760 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:25,761 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-10-13 21:05:25,761 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:25,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320810365] [2019-10-13 21:05:25,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:25,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:25,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:25,778 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-13 21:05:25,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320810365] [2019-10-13 21:05:25,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:25,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:25,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127924459] [2019-10-13 21:05:25,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:25,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:25,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:25,780 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-10-13 21:05:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:25,925 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2019-10-13 21:05:25,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:25,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:25,945 INFO L225 Difference]: With dead ends: 10634 [2019-10-13 21:05:25,945 INFO L226 Difference]: Without dead ends: 10632 [2019-10-13 21:05:25,950 INFO L600 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-13 21:05:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-10-13 21:05:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-10-13 21:05:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-10-13 21:05:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-10-13 21:05:26,218 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-10-13 21:05:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:26,219 INFO L462 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-10-13 21:05:26,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-10-13 21:05:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:05:26,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:26,239 INFO L380 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] [2019-10-13 21:05:26,239 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-10-13 21:05:26,239 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:26,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958448090] [2019-10-13 21:05:26,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:26,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:26,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:26,260 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-13 21:05:26,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958448090] [2019-10-13 21:05:26,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:26,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:26,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672055287] [2019-10-13 21:05:26,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:26,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:26,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:26,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:26,263 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-10-13 21:05:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:26,449 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2019-10-13 21:05:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:26,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:05:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:26,450 INFO L225 Difference]: With dead ends: 22664 [2019-10-13 21:05:26,450 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:26,484 INFO L600 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-13 21:05:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:26,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-10-13 21:05:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:26,485 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:26,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:26,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:26,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:26,511 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:26,511 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:26,511 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:26,512 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:26,512 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:26,512 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:26,512 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,512 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-10-13 21:05:26,512 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,512 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-13 21:05:26,512 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,512 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-13 21:05:26,513 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,513 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-10-13 21:05:26,513 INFO L443 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,514 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,514 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-13 21:05:26,514 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-10-13 21:05:26,514 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-10-13 21:05:26,514 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,514 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-10-13 21:05:26,515 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,515 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-10-13 21:05:26,515 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-13 21:05:26,515 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-13 21:05:26,515 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,515 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,515 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,515 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-10-13 21:05:26,515 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,516 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,516 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-13 21:05:26,516 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-13 21:05:26,516 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-10-13 21:05:26,516 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,516 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,516 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-13 21:05:26,516 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-10-13 21:05:26,517 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-13 21:05:26,517 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,517 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-10-13 21:05:26,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:26 BoogieIcfgContainer [2019-10-13 21:05:26,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:26,533 INFO L168 Benchmark]: Toolchain (without parser) took 5701.68 ms. Allocated memory was 146.3 MB in the beginning and 326.1 MB in the end (delta: 179.8 MB). Free memory was 104.5 MB in the beginning and 99.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 184.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:26,535 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 21:05:26,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.41 ms. Allocated memory is still 146.3 MB. Free memory was 104.1 MB in the beginning and 93.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:26,541 INFO L168 Benchmark]: Boogie Preprocessor took 119.05 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 93.8 MB in the beginning and 180.7 MB in the end (delta: -86.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:26,545 INFO L168 Benchmark]: RCFGBuilder took 363.64 ms. Allocated memory is still 202.9 MB. Free memory was 180.7 MB in the beginning and 162.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:26,547 INFO L168 Benchmark]: TraceAbstraction took 4846.45 ms. Allocated memory was 202.9 MB in the beginning and 326.1 MB in the end (delta: 123.2 MB). Free memory was 161.7 MB in the beginning and 99.4 MB in the end (delta: 62.3 MB). Peak memory consumption was 185.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:26,551 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 366.41 ms. Allocated memory is still 146.3 MB. Free memory was 104.1 MB in the beginning and 93.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.05 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 93.8 MB in the beginning and 180.7 MB in the end (delta: -86.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.64 ms. Allocated memory is still 202.9 MB. Free memory was 180.7 MB in the beginning and 162.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4846.45 ms. Allocated memory was 202.9 MB in the beginning and 326.1 MB in the end (delta: 123.2 MB). Free memory was 161.7 MB in the beginning and 99.4 MB in the end (delta: 62.3 MB). Peak memory consumption was 185.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...