./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5107685577f81a5867811396b2c0a05eb5630c95 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:10:37,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:10:37,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:10:37,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:10:37,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:10:37,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:10:37,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:10:37,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:10:37,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:10:37,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:10:37,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:10:37,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:10:37,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:10:37,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:10:37,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:10:37,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:10:37,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:10:37,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:10:37,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:10:37,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:10:37,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:10:37,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:10:37,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:10:37,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:10:37,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:10:37,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:10:37,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:10:37,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:10:37,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:10:37,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:10:37,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:10:37,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:10:37,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:10:37,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:10:37,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:10:37,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:10:37,660 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:10:37,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:10:37,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:10:37,680 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:10:37,680 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:10:37,681 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:10:37,681 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:10:37,681 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:10:37,682 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:10:37,682 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:10:37,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:10:37,682 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:10:37,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:10:37,682 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:10:37,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:10:37,685 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:10:37,685 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:10:37,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:10:37,686 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:10:37,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:10:37,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:10:37,686 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:10:37,686 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:10:37,686 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:10:37,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:37,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:10:37,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:10:37,687 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:10:37,687 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:10:37,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:10:37,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:10:37,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-28 16:10:37,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:10:37,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:10:37,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:10:37,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:10:37,778 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:10:37,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:37,844 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9dc7b5ac/56326f9f4dfb420b836a1eb762c4035b/FLAGc8da5b37e [2018-11-28 16:10:38,309 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:10:38,310 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:38,318 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9dc7b5ac/56326f9f4dfb420b836a1eb762c4035b/FLAGc8da5b37e [2018-11-28 16:10:38,657 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9dc7b5ac/56326f9f4dfb420b836a1eb762c4035b [2018-11-28 16:10:38,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:10:38,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:10:38,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:38,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:10:38,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:10:38,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:38" (1/1) ... [2018-11-28 16:10:38,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e1d79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:38, skipping insertion in model container [2018-11-28 16:10:38,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:38" (1/1) ... [2018-11-28 16:10:38,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:10:38,704 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:10:38,964 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:38,976 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:10:39,016 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:39,051 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:10:39,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39 WrapperNode [2018-11-28 16:10:39,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:39,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:39,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:10:39,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:10:39,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:39,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:10:39,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:10:39,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:10:39,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (1/1) ... [2018-11-28 16:10:39,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:10:39,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:10:39,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:10:39,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:10:39,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (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 [2018-11-28 16:10:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:10:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:10:39,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:10:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:10:39,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:10:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:10:39,989 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:10:39,990 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:10:39,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:39 BoogieIcfgContainer [2018-11-28 16:10:39,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:10:39,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:10:39,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:10:39,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:10:39,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:10:38" (1/3) ... [2018-11-28 16:10:39,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7879c358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:39, skipping insertion in model container [2018-11-28 16:10:39,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:39" (2/3) ... [2018-11-28 16:10:39,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7879c358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:39, skipping insertion in model container [2018-11-28 16:10:39,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:39" (3/3) ... [2018-11-28 16:10:39,999 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:40,010 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:10:40,019 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:10:40,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:10:40,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:10:40,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:10:40,074 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:10:40,074 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:10:40,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:10:40,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:10:40,075 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:10:40,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:10:40,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:10:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-28 16:10:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:40,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:40,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:40,107 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:40,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-11-28 16:10:40,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:40,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:40,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:40,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:40,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:40,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:40,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:40,358 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-11-28 16:10:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:40,446 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-11-28 16:10:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:40,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:40,462 INFO L225 Difference]: With dead ends: 81 [2018-11-28 16:10:40,462 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 16:10:40,466 INFO L631 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 [2018-11-28 16:10:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 16:10:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-28 16:10:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 16:10:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-11-28 16:10:40,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-11-28 16:10:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:40,525 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-11-28 16:10:40,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-11-28 16:10:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:40,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:40,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:40,527 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:40,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-11-28 16:10:40,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:40,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:40,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:40,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:40,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:40,606 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-11-28 16:10:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:40,667 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-11-28 16:10:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:40,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:40,670 INFO L225 Difference]: With dead ends: 107 [2018-11-28 16:10:40,670 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 16:10:40,671 INFO L631 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 [2018-11-28 16:10:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 16:10:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-28 16:10:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 16:10:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-11-28 16:10:40,682 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-11-28 16:10:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:40,682 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-11-28 16:10:40,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-11-28 16:10:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:40,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:40,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:40,684 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:40,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-11-28 16:10:40,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:40,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:40,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:40,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:40,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:40,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:40,758 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-11-28 16:10:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:40,795 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-11-28 16:10:40,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:40,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:40,799 INFO L225 Difference]: With dead ends: 99 [2018-11-28 16:10:40,799 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 16:10:40,800 INFO L631 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 [2018-11-28 16:10:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 16:10:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-28 16:10:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 16:10:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-11-28 16:10:40,811 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-11-28 16:10:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:40,812 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-11-28 16:10:40,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-11-28 16:10:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:40,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:40,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:40,814 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:40,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-11-28 16:10:40,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:40,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:40,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:40,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:40,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:40,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:40,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:40,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:40,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:40,915 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-11-28 16:10:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:40,983 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-11-28 16:10:40,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:40,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:40,987 INFO L225 Difference]: With dead ends: 124 [2018-11-28 16:10:40,987 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 16:10:40,988 INFO L631 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 [2018-11-28 16:10:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 16:10:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-11-28 16:10:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 16:10:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-11-28 16:10:40,999 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-11-28 16:10:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,000 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-11-28 16:10:41,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-11-28 16:10:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:41,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:41,002 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-11-28 16:10:41,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:41,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:41,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:41,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:41,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:41,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:41,049 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-11-28 16:10:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:41,084 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-11-28 16:10:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:41,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:41,087 INFO L225 Difference]: With dead ends: 204 [2018-11-28 16:10:41,087 INFO L226 Difference]: Without dead ends: 124 [2018-11-28 16:10:41,088 INFO L631 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 [2018-11-28 16:10:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-28 16:10:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-28 16:10:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 16:10:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-11-28 16:10:41,100 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-11-28 16:10:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,101 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-11-28 16:10:41,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-11-28 16:10:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:41,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:41,103 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-11-28 16:10:41,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:41,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:41,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:41,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:41,180 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-11-28 16:10:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:41,271 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-11-28 16:10:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:41,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:41,273 INFO L225 Difference]: With dead ends: 183 [2018-11-28 16:10:41,273 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 16:10:41,275 INFO L631 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 [2018-11-28 16:10:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 16:10:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-28 16:10:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 16:10:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-11-28 16:10:41,287 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-11-28 16:10:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,287 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-11-28 16:10:41,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-11-28 16:10:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:41,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:41,289 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-11-28 16:10:41,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:41,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:41,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:41,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:41,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:41,385 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-11-28 16:10:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:41,462 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-11-28 16:10:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:41,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:41,465 INFO L225 Difference]: With dead ends: 228 [2018-11-28 16:10:41,466 INFO L226 Difference]: Without dead ends: 226 [2018-11-28 16:10:41,468 INFO L631 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 [2018-11-28 16:10:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-28 16:10:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-11-28 16:10:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-28 16:10:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-11-28 16:10:41,485 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-11-28 16:10:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,486 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-11-28 16:10:41,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-11-28 16:10:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:41,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:41,489 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-11-28 16:10:41,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:41,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:41,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:41,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:41,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:41,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:41,557 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-11-28 16:10:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:41,620 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-11-28 16:10:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:41,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:41,623 INFO L225 Difference]: With dead ends: 392 [2018-11-28 16:10:41,623 INFO L226 Difference]: Without dead ends: 234 [2018-11-28 16:10:41,625 INFO L631 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 [2018-11-28 16:10:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-28 16:10:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-11-28 16:10:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-28 16:10:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-11-28 16:10:41,639 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-11-28 16:10:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,640 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-11-28 16:10:41,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-11-28 16:10:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:41,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,642 INFO L402 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] [2018-11-28 16:10:41,643 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-11-28 16:10:41,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:41,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:41,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:41,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:41,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:41,718 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-11-28 16:10:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:41,775 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-11-28 16:10:41,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:41,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:41,778 INFO L225 Difference]: With dead ends: 348 [2018-11-28 16:10:41,778 INFO L226 Difference]: Without dead ends: 238 [2018-11-28 16:10:41,779 INFO L631 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 [2018-11-28 16:10:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-28 16:10:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-11-28 16:10:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-28 16:10:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-11-28 16:10:41,793 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-11-28 16:10:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,794 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-11-28 16:10:41,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-11-28 16:10:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:41,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,796 INFO L402 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] [2018-11-28 16:10:41,796 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-11-28 16:10:41,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:41,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:41,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:41,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:41,861 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-11-28 16:10:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:41,936 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-11-28 16:10:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:41,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:41,943 INFO L225 Difference]: With dead ends: 428 [2018-11-28 16:10:41,943 INFO L226 Difference]: Without dead ends: 426 [2018-11-28 16:10:41,944 INFO L631 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 [2018-11-28 16:10:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-28 16:10:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-11-28 16:10:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-28 16:10:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-11-28 16:10:41,969 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-11-28 16:10:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,969 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-11-28 16:10:41,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-11-28 16:10:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:41,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,976 INFO L402 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] [2018-11-28 16:10:41,976 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-11-28 16:10:41,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:42,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:42,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:42,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:42,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:42,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:42,056 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-11-28 16:10:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:42,164 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-11-28 16:10:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:42,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:42,167 INFO L225 Difference]: With dead ends: 764 [2018-11-28 16:10:42,168 INFO L226 Difference]: Without dead ends: 450 [2018-11-28 16:10:42,169 INFO L631 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 [2018-11-28 16:10:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-28 16:10:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-11-28 16:10:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-28 16:10:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-11-28 16:10:42,188 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-11-28 16:10:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:42,189 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-11-28 16:10:42,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-11-28 16:10:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:42,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:42,191 INFO L402 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] [2018-11-28 16:10:42,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:42,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-11-28 16:10:42,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:42,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:42,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:42,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:42,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:42,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:42,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:42,248 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-11-28 16:10:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:42,331 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-11-28 16:10:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:42,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:42,337 INFO L225 Difference]: With dead ends: 672 [2018-11-28 16:10:42,337 INFO L226 Difference]: Without dead ends: 458 [2018-11-28 16:10:42,338 INFO L631 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 [2018-11-28 16:10:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-28 16:10:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-11-28 16:10:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-28 16:10:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-11-28 16:10:42,358 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-11-28 16:10:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:42,359 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-11-28 16:10:42,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-11-28 16:10:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:42,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:42,362 INFO L402 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] [2018-11-28 16:10:42,362 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:42,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-11-28 16:10:42,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:42,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:42,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:42,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:42,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:42,437 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-11-28 16:10:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:42,539 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-11-28 16:10:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:42,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:42,546 INFO L225 Difference]: With dead ends: 812 [2018-11-28 16:10:42,546 INFO L226 Difference]: Without dead ends: 810 [2018-11-28 16:10:42,547 INFO L631 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 [2018-11-28 16:10:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-28 16:10:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-11-28 16:10:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-28 16:10:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-11-28 16:10:42,576 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-11-28 16:10:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:42,577 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-11-28 16:10:42,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-11-28 16:10:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:42,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:42,579 INFO L402 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] [2018-11-28 16:10:42,581 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:42,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-11-28 16:10:42,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:42,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:42,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:42,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:42,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:42,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:42,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:42,657 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-11-28 16:10:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:42,781 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-11-28 16:10:42,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:42,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:42,789 INFO L225 Difference]: With dead ends: 1500 [2018-11-28 16:10:42,789 INFO L226 Difference]: Without dead ends: 874 [2018-11-28 16:10:42,792 INFO L631 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 [2018-11-28 16:10:42,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-28 16:10:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-11-28 16:10:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-28 16:10:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-11-28 16:10:42,835 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-11-28 16:10:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:42,835 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-11-28 16:10:42,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-11-28 16:10:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:42,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:42,840 INFO L402 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] [2018-11-28 16:10:42,840 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:42,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-11-28 16:10:42,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:42,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:42,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:42,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:42,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:42,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:42,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:42,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:42,919 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-11-28 16:10:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:43,035 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-11-28 16:10:43,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:43,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:43,042 INFO L225 Difference]: With dead ends: 1308 [2018-11-28 16:10:43,042 INFO L226 Difference]: Without dead ends: 890 [2018-11-28 16:10:43,045 INFO L631 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 [2018-11-28 16:10:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-11-28 16:10:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-11-28 16:10:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-28 16:10:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-11-28 16:10:43,089 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-11-28 16:10:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:43,089 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-11-28 16:10:43,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-11-28 16:10:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:43,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:43,092 INFO L402 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] [2018-11-28 16:10:43,093 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:43,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-11-28 16:10:43,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:43,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:43,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:43,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:43,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:43,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:43,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:43,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:43,162 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-11-28 16:10:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:43,290 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-11-28 16:10:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:43,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:43,300 INFO L225 Difference]: With dead ends: 1548 [2018-11-28 16:10:43,301 INFO L226 Difference]: Without dead ends: 1546 [2018-11-28 16:10:43,302 INFO L631 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 [2018-11-28 16:10:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-28 16:10:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-11-28 16:10:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-11-28 16:10:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-11-28 16:10:43,360 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-11-28 16:10:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:43,361 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-11-28 16:10:43,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-11-28 16:10:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:43,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:43,368 INFO L402 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] [2018-11-28 16:10:43,368 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:43,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-11-28 16:10:43,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:43,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:43,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:43,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:43,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:43,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:43,441 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-11-28 16:10:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:43,596 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-11-28 16:10:43,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:43,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:43,607 INFO L225 Difference]: With dead ends: 2956 [2018-11-28 16:10:43,608 INFO L226 Difference]: Without dead ends: 1706 [2018-11-28 16:10:43,611 INFO L631 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 [2018-11-28 16:10:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-11-28 16:10:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-11-28 16:10:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-11-28 16:10:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-11-28 16:10:43,681 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-11-28 16:10:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:43,681 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-11-28 16:10:43,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-11-28 16:10:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:43,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:43,687 INFO L402 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] [2018-11-28 16:10:43,687 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:43,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:43,687 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-11-28 16:10:43,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:43,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:43,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:43,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:43,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:43,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:43,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:43,762 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-11-28 16:10:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:43,892 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-11-28 16:10:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:43,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:43,903 INFO L225 Difference]: With dead ends: 2556 [2018-11-28 16:10:43,904 INFO L226 Difference]: Without dead ends: 1738 [2018-11-28 16:10:43,907 INFO L631 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 [2018-11-28 16:10:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-28 16:10:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-11-28 16:10:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-11-28 16:10:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-11-28 16:10:43,987 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-11-28 16:10:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:43,988 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-11-28 16:10:43,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-11-28 16:10:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:43,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:43,993 INFO L402 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] [2018-11-28 16:10:43,993 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:43,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-11-28 16:10:43,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:43,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:43,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:44,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:44,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:44,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:44,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:44,064 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-11-28 16:10:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:44,239 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-11-28 16:10:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:44,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:44,255 INFO L225 Difference]: With dead ends: 2956 [2018-11-28 16:10:44,255 INFO L226 Difference]: Without dead ends: 2954 [2018-11-28 16:10:44,256 INFO L631 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 [2018-11-28 16:10:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-28 16:10:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-11-28 16:10:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-11-28 16:10:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-11-28 16:10:44,346 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-11-28 16:10:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:44,347 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-11-28 16:10:44,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-11-28 16:10:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:44,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:44,353 INFO L402 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] [2018-11-28 16:10:44,353 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:44,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-11-28 16:10:44,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:44,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:44,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:44,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:44,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:44,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:44,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:44,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:44,421 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-11-28 16:10:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:44,605 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-11-28 16:10:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:44,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:44,622 INFO L225 Difference]: With dead ends: 5836 [2018-11-28 16:10:44,623 INFO L226 Difference]: Without dead ends: 3338 [2018-11-28 16:10:44,628 INFO L631 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 [2018-11-28 16:10:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-28 16:10:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-11-28 16:10:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-28 16:10:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-11-28 16:10:44,756 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-11-28 16:10:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:44,757 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-11-28 16:10:44,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-11-28 16:10:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:44,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:44,764 INFO L402 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] [2018-11-28 16:10:44,764 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:44,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-11-28 16:10:44,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:44,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:44,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:44,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:44,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:44,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:44,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:44,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:44,834 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-11-28 16:10:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:44,995 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-11-28 16:10:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:44,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:45,011 INFO L225 Difference]: With dead ends: 5004 [2018-11-28 16:10:45,011 INFO L226 Difference]: Without dead ends: 3402 [2018-11-28 16:10:45,015 INFO L631 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 [2018-11-28 16:10:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-11-28 16:10:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-11-28 16:10:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-11-28 16:10:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-11-28 16:10:45,133 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-11-28 16:10:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:45,133 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-11-28 16:10:45,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-11-28 16:10:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:45,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:45,140 INFO L402 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] [2018-11-28 16:10:45,140 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:45,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-11-28 16:10:45,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:45,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:45,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:45,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:45,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:45,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:45,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:45,208 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-11-28 16:10:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:45,442 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-11-28 16:10:45,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:45,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:45,472 INFO L225 Difference]: With dead ends: 9804 [2018-11-28 16:10:45,472 INFO L226 Difference]: Without dead ends: 6538 [2018-11-28 16:10:45,481 INFO L631 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 [2018-11-28 16:10:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-11-28 16:10:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-11-28 16:10:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-28 16:10:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-11-28 16:10:45,703 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-11-28 16:10:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:45,703 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-11-28 16:10:45,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-11-28 16:10:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:45,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:45,713 INFO L402 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] [2018-11-28 16:10:45,713 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:45,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-11-28 16:10:45,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:45,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:45,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:45,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:45,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:45,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:45,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:45,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:45,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:45,783 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-11-28 16:10:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:46,046 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-11-28 16:10:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:46,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:46,065 INFO L225 Difference]: With dead ends: 7052 [2018-11-28 16:10:46,065 INFO L226 Difference]: Without dead ends: 7050 [2018-11-28 16:10:46,069 INFO L631 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 [2018-11-28 16:10:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-11-28 16:10:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-11-28 16:10:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-28 16:10:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-11-28 16:10:46,331 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-11-28 16:10:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:46,331 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-11-28 16:10:46,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-11-28 16:10:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:46,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:46,342 INFO L402 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] [2018-11-28 16:10:46,342 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:46,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-11-28 16:10:46,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:46,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:46,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:46,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:46,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:46,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:46,409 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-11-28 16:10:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:46,706 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-11-28 16:10:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:46,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:46,726 INFO L225 Difference]: With dead ends: 10634 [2018-11-28 16:10:46,726 INFO L226 Difference]: Without dead ends: 10632 [2018-11-28 16:10:46,732 INFO L631 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 [2018-11-28 16:10:46,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-11-28 16:10:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-11-28 16:10:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-11-28 16:10:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-11-28 16:10:46,971 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-11-28 16:10:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:46,971 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-11-28 16:10:46,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-11-28 16:10:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:46,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:46,989 INFO L402 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] [2018-11-28 16:10:46,989 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:46,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-11-28 16:10:46,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:47,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:47,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:47,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:47,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:47,049 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-11-28 16:10:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:47,405 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-11-28 16:10:47,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:47,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:47,406 INFO L225 Difference]: With dead ends: 22664 [2018-11-28 16:10:47,407 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:47,441 INFO L631 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 [2018-11-28 16:10:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:47,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-28 16:10:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:47,442 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:47,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:47,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:47,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:47,564 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:47,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:47,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:47,564 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:47,564 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:47,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:47,564 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,565 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-28 16:10:47,566 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,567 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,574 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,574 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-28 16:10:47,574 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,574 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,574 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-28 16:10:47,574 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-28 16:10:47,574 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-28 16:10:47,574 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,574 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,575 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-28 16:10:47,575 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-28 16:10:47,575 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,575 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-28 16:10:47,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:47 BoogieIcfgContainer [2018-11-28 16:10:47,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:47,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:47,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:47,588 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:47,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:39" (3/4) ... [2018-11-28 16:10:47,594 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:47,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:47,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:47,609 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 16:10:47,610 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:10:47,610 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:47,687 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:47,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:47,693 INFO L168 Benchmark]: Toolchain (without parser) took 9032.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 952.7 MB in the beginning and 935.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 327.5 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:47,695 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:47,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.54 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:47,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.67 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:47,697 INFO L168 Benchmark]: Boogie Preprocessor took 60.90 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:47,697 INFO L168 Benchmark]: RCFGBuilder took 845.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:47,699 INFO L168 Benchmark]: TraceAbstraction took 7595.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 938.8 MB in the end (delta: 146.7 MB). Peak memory consumption was 340.2 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:47,699 INFO L168 Benchmark]: Witness Printer took 99.93 ms. Allocated memory is still 1.3 GB. Free memory was 938.8 MB in the beginning and 935.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:47,709 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.54 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.67 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.90 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 845.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7595.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 938.8 MB in the end (delta: 146.7 MB). Peak memory consumption was 340.2 MB. Max. memory is 11.5 GB. * Witness Printer took 99.93 ms. Allocated memory is still 1.3 GB. Free memory was 938.8 MB in the beginning and 935.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 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. SAFE Result, 7.5s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s 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: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...