/usr/bin/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:32:42,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:32:42,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:32:42,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:32:42,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:32:42,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:32:42,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:32:42,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:32:42,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:32:42,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:32:42,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:32:42,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:32:42,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:32:42,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:32:42,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:32:42,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:32:42,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:32:42,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:32:42,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:32:42,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:32:42,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:32:42,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:32:42,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:32:42,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:32:42,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:32:42,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:32:42,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:32:42,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:32:42,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:32:42,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:32:42,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:32:42,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:32:42,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:32:42,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:32:42,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:32:42,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:32:42,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:32:42,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:32:42,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:32:42,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:32:42,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:32:42,636 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-11-07 00:32:42,658 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:32:42,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:32:42,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:32:42,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:32:42,661 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:32:42,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:32:42,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:32:42,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:32:42,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:32:42,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:32:42,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:32:42,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:32:42,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:32:42,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:32:42,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:32:42,664 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:32:42,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:32:42,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:32:42,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:32:42,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:32:42,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:32:42,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:42,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:32:42,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:32:42,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:32:42,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:32:42,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:32:42,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:32:42,666 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-11-07 00:32:42,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:32:42,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:32:42,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:32:42,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:32:42,998 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:32:42,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-11-07 00:32:43,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e30fa77/4c1745773dc6430d9d56d9af530e2e4e/FLAG78010d983 [2019-11-07 00:32:43,538 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:32:43,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-11-07 00:32:43,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e30fa77/4c1745773dc6430d9d56d9af530e2e4e/FLAG78010d983 [2019-11-07 00:32:43,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e30fa77/4c1745773dc6430d9d56d9af530e2e4e [2019-11-07 00:32:43,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:32:43,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:32:43,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:43,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:32:43,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:32:43,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:43" (1/1) ... [2019-11-07 00:32:44,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cb1940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:43, skipping insertion in model container [2019-11-07 00:32:44,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:43" (1/1) ... [2019-11-07 00:32:44,026 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:32:44,064 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:32:44,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:44,273 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:32:44,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:44,328 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:32:44,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44 WrapperNode [2019-11-07 00:32:44,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:44,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:32:44,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:32:44,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:32:44,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:32:44,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:32:44,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:32:44,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:32:44,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (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-11-07 00:32:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:32:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:32:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:32:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:32:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:32:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:32:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:32:44,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:32:44,871 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:32:44,871 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:32:44,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:44 BoogieIcfgContainer [2019-11-07 00:32:44,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:32:44,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:32:44,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:32:44,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:32:44,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:32:43" (1/3) ... [2019-11-07 00:32:44,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f9140f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:44, skipping insertion in model container [2019-11-07 00:32:44,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44" (2/3) ... [2019-11-07 00:32:44,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f9140f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:44, skipping insertion in model container [2019-11-07 00:32:44,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:44" (3/3) ... [2019-11-07 00:32:44,892 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-11-07 00:32:44,902 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:32:44,911 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:32:44,921 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:32:44,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:32:44,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:32:44,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:32:44,951 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:32:44,951 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:32:44,951 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:32:44,951 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:32:44,951 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:32:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-07 00:32:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:32:44,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:44,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:44,980 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-11-07 00:32:44,997 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:44,997 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132814483] [2019-11-07 00:32:44,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,157 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132814483] [2019-11-07 00:32:45,158 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,158 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291609198] [2019-11-07 00:32:45,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,167 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,185 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-11-07 00:32:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,244 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-11-07 00:32:45,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-07 00:32:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,261 INFO L225 Difference]: With dead ends: 57 [2019-11-07 00:32:45,262 INFO L226 Difference]: Without dead ends: 42 [2019-11-07 00:32:45,267 INFO L630 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-11-07 00:32:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-07 00:32:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-11-07 00:32:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-07 00:32:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-11-07 00:32:45,310 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-11-07 00:32:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,311 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-11-07 00:32:45,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-11-07 00:32:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:32:45,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,313 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-11-07 00:32:45,314 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,314 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850723623] [2019-11-07 00:32:45,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,354 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850723623] [2019-11-07 00:32:45,354 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,354 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135661674] [2019-11-07 00:32:45,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,357 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,357 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-11-07 00:32:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,400 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-11-07 00:32:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-07 00:32:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,402 INFO L225 Difference]: With dead ends: 67 [2019-11-07 00:32:45,402 INFO L226 Difference]: Without dead ends: 42 [2019-11-07 00:32:45,403 INFO L630 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-11-07 00:32:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-07 00:32:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-07 00:32:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-07 00:32:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-11-07 00:32:45,412 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-11-07 00:32:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,412 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-11-07 00:32:45,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-11-07 00:32:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:32:45,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,414 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-11-07 00:32:45,415 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,415 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200564344] [2019-11-07 00:32:45,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,456 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200564344] [2019-11-07 00:32:45,456 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,457 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714614475] [2019-11-07 00:32:45,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,460 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,460 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-11-07 00:32:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,488 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-11-07 00:32:45,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-07 00:32:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,490 INFO L225 Difference]: With dead ends: 63 [2019-11-07 00:32:45,490 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 00:32:45,491 INFO L630 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-11-07 00:32:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 00:32:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-11-07 00:32:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-07 00:32:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-11-07 00:32:45,499 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-11-07 00:32:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,499 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-11-07 00:32:45,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-11-07 00:32:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:32:45,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,501 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-11-07 00:32:45,502 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,502 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712879295] [2019-11-07 00:32:45,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,547 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712879295] [2019-11-07 00:32:45,547 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,547 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329165647] [2019-11-07 00:32:45,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,548 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,549 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-11-07 00:32:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,567 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-11-07 00:32:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-07 00:32:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,569 INFO L225 Difference]: With dead ends: 76 [2019-11-07 00:32:45,570 INFO L226 Difference]: Without dead ends: 74 [2019-11-07 00:32:45,570 INFO L630 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-11-07 00:32:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-07 00:32:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-11-07 00:32:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-07 00:32:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-11-07 00:32:45,580 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-11-07 00:32:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,580 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-11-07 00:32:45,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-11-07 00:32:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:32:45,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,582 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-11-07 00:32:45,583 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,583 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517929927] [2019-11-07 00:32:45,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517929927] [2019-11-07 00:32:45,628 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,628 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225914299] [2019-11-07 00:32:45,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,629 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,630 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-11-07 00:32:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,653 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-11-07 00:32:45,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-07 00:32:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,655 INFO L225 Difference]: With dead ends: 124 [2019-11-07 00:32:45,655 INFO L226 Difference]: Without dead ends: 76 [2019-11-07 00:32:45,656 INFO L630 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-11-07 00:32:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-07 00:32:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-07 00:32:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-07 00:32:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-11-07 00:32:45,667 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-11-07 00:32:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,667 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-11-07 00:32:45,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-11-07 00:32:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:45,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,671 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-11-07 00:32:45,672 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,673 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417011195] [2019-11-07 00:32:45,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,715 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417011195] [2019-11-07 00:32:45,715 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,715 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526136892] [2019-11-07 00:32:45,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,716 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,720 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-11-07 00:32:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,748 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-11-07 00:32:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,750 INFO L225 Difference]: With dead ends: 111 [2019-11-07 00:32:45,750 INFO L226 Difference]: Without dead ends: 78 [2019-11-07 00:32:45,751 INFO L630 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-11-07 00:32:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-07 00:32:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-07 00:32:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-07 00:32:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-11-07 00:32:45,760 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-11-07 00:32:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,761 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-11-07 00:32:45,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-11-07 00:32:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:45,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,762 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-11-07 00:32:45,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034225932] [2019-11-07 00:32:45,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,815 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034225932] [2019-11-07 00:32:45,815 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677475371] [2019-11-07 00:32:45,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,817 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,826 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-11-07 00:32:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,863 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-11-07 00:32:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,866 INFO L225 Difference]: With dead ends: 132 [2019-11-07 00:32:45,867 INFO L226 Difference]: Without dead ends: 130 [2019-11-07 00:32:45,867 INFO L630 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-11-07 00:32:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-07 00:32:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-11-07 00:32:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-07 00:32:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-11-07 00:32:45,883 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-11-07 00:32:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,883 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-11-07 00:32:45,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-11-07 00:32:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:45,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,889 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-11-07 00:32:45,890 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,890 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737883753] [2019-11-07 00:32:45,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737883753] [2019-11-07 00:32:45,918 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,918 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129656773] [2019-11-07 00:32:45,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,919 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,920 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-11-07 00:32:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,946 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-11-07 00:32:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,949 INFO L225 Difference]: With dead ends: 232 [2019-11-07 00:32:45,949 INFO L226 Difference]: Without dead ends: 138 [2019-11-07 00:32:45,950 INFO L630 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-11-07 00:32:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-07 00:32:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-11-07 00:32:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-07 00:32:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-11-07 00:32:45,965 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-11-07 00:32:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:45,965 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-11-07 00:32:45,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-11-07 00:32:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:45,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-11-07 00:32:45,968 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,968 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779086048] [2019-11-07 00:32:45,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,000 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779086048] [2019-11-07 00:32:46,001 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,001 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237864666] [2019-11-07 00:32:46,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,002 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,003 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-11-07 00:32:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,027 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-11-07 00:32:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,029 INFO L225 Difference]: With dead ends: 204 [2019-11-07 00:32:46,029 INFO L226 Difference]: Without dead ends: 142 [2019-11-07 00:32:46,030 INFO L630 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-11-07 00:32:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-07 00:32:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-11-07 00:32:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-07 00:32:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-11-07 00:32:46,054 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-11-07 00:32:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,054 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-11-07 00:32:46,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-11-07 00:32:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:46,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,061 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-11-07 00:32:46,061 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,061 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173378988] [2019-11-07 00:32:46,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173378988] [2019-11-07 00:32:46,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,112 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004195226] [2019-11-07 00:32:46,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,113 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,114 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-11-07 00:32:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,148 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-11-07 00:32:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,151 INFO L225 Difference]: With dead ends: 236 [2019-11-07 00:32:46,151 INFO L226 Difference]: Without dead ends: 234 [2019-11-07 00:32:46,152 INFO L630 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-11-07 00:32:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-07 00:32:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-11-07 00:32:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-07 00:32:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-11-07 00:32:46,168 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-11-07 00:32:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,168 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-11-07 00:32:46,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-11-07 00:32:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:46,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,171 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-11-07 00:32:46,171 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,171 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489626340] [2019-11-07 00:32:46,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,198 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489626340] [2019-11-07 00:32:46,198 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,199 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569137870] [2019-11-07 00:32:46,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,199 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,200 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-11-07 00:32:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,226 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-11-07 00:32:46,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,229 INFO L225 Difference]: With dead ends: 444 [2019-11-07 00:32:46,229 INFO L226 Difference]: Without dead ends: 258 [2019-11-07 00:32:46,231 INFO L630 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-11-07 00:32:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-07 00:32:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-07 00:32:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-07 00:32:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-11-07 00:32:46,243 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-11-07 00:32:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,243 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-11-07 00:32:46,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-11-07 00:32:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:46,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,245 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,246 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-11-07 00:32:46,246 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,246 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674383828] [2019-11-07 00:32:46,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,276 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674383828] [2019-11-07 00:32:46,277 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,277 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184726682] [2019-11-07 00:32:46,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,277 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,278 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-11-07 00:32:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,294 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-11-07 00:32:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,297 INFO L225 Difference]: With dead ends: 384 [2019-11-07 00:32:46,297 INFO L226 Difference]: Without dead ends: 266 [2019-11-07 00:32:46,298 INFO L630 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-11-07 00:32:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-07 00:32:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-11-07 00:32:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-07 00:32:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-11-07 00:32:46,308 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-11-07 00:32:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,309 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-11-07 00:32:46,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-11-07 00:32:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:46,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,311 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-11-07 00:32:46,311 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,311 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306634350] [2019-11-07 00:32:46,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,335 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306634350] [2019-11-07 00:32:46,336 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,336 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540401277] [2019-11-07 00:32:46,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,337 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,337 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-11-07 00:32:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,370 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-11-07 00:32:46,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,376 INFO L225 Difference]: With dead ends: 426 [2019-11-07 00:32:46,376 INFO L226 Difference]: Without dead ends: 424 [2019-11-07 00:32:46,377 INFO L630 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-11-07 00:32:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-07 00:32:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-11-07 00:32:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-07 00:32:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-11-07 00:32:46,391 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-11-07 00:32:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,391 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-11-07 00:32:46,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-11-07 00:32:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:46,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,393 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-11-07 00:32:46,394 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,394 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320187365] [2019-11-07 00:32:46,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,412 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320187365] [2019-11-07 00:32:46,412 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,412 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714565915] [2019-11-07 00:32:46,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,413 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,414 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-11-07 00:32:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,443 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-11-07 00:32:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,444 INFO L225 Difference]: With dead ends: 856 [2019-11-07 00:32:46,444 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:32:46,446 INFO L630 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-11-07 00:32:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:32:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:32:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:32:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:32:46,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-07 00:32:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,447 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:32:46,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:32:46,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:32:46,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:32:46,486 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:32:46,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:46,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:46,486 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:32:46,486 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:32:46,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:32:46,487 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-07 00:32:46,487 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-11-07 00:32:46,487 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-11-07 00:32:46,487 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,487 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-07 00:32:46,487 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,487 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,488 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,489 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,489 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,489 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-07 00:32:46,489 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-07 00:32:46,489 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,490 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-11-07 00:32:46,490 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-07 00:32:46,490 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-11-07 00:32:46,490 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-11-07 00:32:46,490 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,490 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-11-07 00:32:46,490 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-07 00:32:46,490 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-07 00:32:46,491 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-11-07 00:32:46,491 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-11-07 00:32:46,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:32:46 BoogieIcfgContainer [2019-11-07 00:32:46,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:32:46,506 INFO L168 Benchmark]: Toolchain (without parser) took 2526.53 ms. Allocated memory was 136.3 MB in the beginning and 232.8 MB in the end (delta: 96.5 MB). Free memory was 101.2 MB in the beginning and 156.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:46,511 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-07 00:32:46,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.63 ms. Allocated memory is still 136.3 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:46,513 INFO L168 Benchmark]: Boogie Preprocessor took 190.72 ms. Allocated memory was 136.3 MB in the beginning and 203.4 MB in the end (delta: 67.1 MB). Free memory was 91.1 MB in the beginning and 181.6 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:46,514 INFO L168 Benchmark]: RCFGBuilder took 352.50 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 166.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:46,517 INFO L168 Benchmark]: TraceAbstraction took 1619.84 ms. Allocated memory was 203.4 MB in the beginning and 232.8 MB in the end (delta: 29.4 MB). Free memory was 166.9 MB in the beginning and 156.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:46,527 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.24 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 345.63 ms. Allocated memory is still 136.3 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 190.72 ms. Allocated memory was 136.3 MB in the beginning and 203.4 MB in the end (delta: 67.1 MB). Free memory was 91.1 MB in the beginning and 181.6 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 352.50 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 166.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1619.84 ms. Allocated memory was 203.4 MB in the beginning and 232.8 MB in the end (delta: 29.4 MB). Free memory was 166.9 MB in the beginning and 156.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...