./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer --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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:28,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:28,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:28,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:28,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:28,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:28,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:28,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:28,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:28,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:28,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:28,728 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:28,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:28,729 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:28,730 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:28,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:28,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:28,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:28,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:28,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:28,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:28,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:28,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:28,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:28,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:28,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:28,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:28,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:28,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:28,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:28,740 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:28,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:28,741 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:28,741 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:28,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:28,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:28,742 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 08:34:28,749 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:28,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:28,750 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:34:28,750 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 08:34:28,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:28,750 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:28,751 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:28,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:28,751 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:28,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:28,751 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:28,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:28,751 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:34:28,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:34:28,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:34:28,752 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:28,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:28,752 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:28,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:34:28,752 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:28,752 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:28,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:34:28,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:34:28,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:34:28,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:28,753 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:34:28,753 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:34:28,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:28,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:34:28,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:34:28,754 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer 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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-11-18 08:34:28,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:28,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:28,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:28,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:28,790 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:28,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 08:34:28,834 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/data/33729ff96/807e32de32ca449e855204a043209b99/FLAG0ddf4171e [2018-11-18 08:34:29,245 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:29,246 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 08:34:29,251 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/data/33729ff96/807e32de32ca449e855204a043209b99/FLAG0ddf4171e [2018-11-18 08:34:29,261 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/data/33729ff96/807e32de32ca449e855204a043209b99 [2018-11-18 08:34:29,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:29,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:34:29,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:29,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:29,267 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:29,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:29,291 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:29,413 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:29,415 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:29,436 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:29,445 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:29,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29 WrapperNode [2018-11-18 08:34:29,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:29,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:29,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:29,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:29,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:29,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:29,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:29,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:29,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/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-18 08:34:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:34:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:34:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:34:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 08:34:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:34:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:34:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:29,766 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:29,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29 BoogieIcfgContainer [2018-11-18 08:34:29,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:29,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:34:29,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:34:29,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:34:29,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:29" (1/3) ... [2018-11-18 08:34:29,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae98b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29" (2/3) ... [2018-11-18 08:34:29,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae98b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29" (3/3) ... [2018-11-18 08:34:29,773 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 08:34:29,780 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:34:29,786 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:34:29,795 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:34:29,817 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:29,817 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:34:29,817 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:34:29,818 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:34:29,818 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:29,818 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:29,818 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:34:29,818 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:29,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:34:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-18 08:34:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 08:34:29,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:29,840 INFO L375 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-18 08:34:29,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:29,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-11-18 08:34:29,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:29,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:29,977 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-18 08:34:29,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:29,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:29,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:29,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:29,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:29,992 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-11-18 08:34:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,032 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-11-18 08:34:30,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 08:34:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,041 INFO L225 Difference]: With dead ends: 107 [2018-11-18 08:34:30,041 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 08:34:30,043 INFO L604 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-18 08:34:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 08:34:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-11-18 08:34:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 08:34:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-11-18 08:34:30,072 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-11-18 08:34:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,072 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-11-18 08:34:30,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-11-18 08:34:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 08:34:30,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,073 INFO L375 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-18 08:34:30,073 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-11-18 08:34:30,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,118 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-18 08:34:30,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,120 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-11-18 08:34:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,149 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-11-18 08:34:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 08:34:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,151 INFO L225 Difference]: With dead ends: 150 [2018-11-18 08:34:30,151 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 08:34:30,152 INFO L604 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-18 08:34:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 08:34:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-18 08:34:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 08:34:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-11-18 08:34:30,158 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-11-18 08:34:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,159 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-11-18 08:34:30,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-11-18 08:34:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 08:34:30,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,159 INFO L375 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-18 08:34:30,160 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-11-18 08:34:30,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,191 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-18 08:34:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,192 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-11-18 08:34:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,214 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-11-18 08:34:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 08:34:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,216 INFO L225 Difference]: With dead ends: 139 [2018-11-18 08:34:30,216 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 08:34:30,216 INFO L604 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-18 08:34:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 08:34:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-18 08:34:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 08:34:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-11-18 08:34:30,222 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-11-18 08:34:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,222 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-11-18 08:34:30,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-11-18 08:34:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 08:34:30,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,223 INFO L375 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-18 08:34:30,223 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-11-18 08:34:30,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,253 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-18 08:34:30,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,254 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-11-18 08:34:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,275 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-11-18 08:34:30,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 08:34:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,277 INFO L225 Difference]: With dead ends: 177 [2018-11-18 08:34:30,277 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 08:34:30,277 INFO L604 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-18 08:34:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 08:34:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-11-18 08:34:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 08:34:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-11-18 08:34:30,286 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-11-18 08:34:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,286 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-11-18 08:34:30,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-11-18 08:34:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 08:34:30,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,287 INFO L375 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-18 08:34:30,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-11-18 08:34:30,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,315 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-18 08:34:30,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,316 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-11-18 08:34:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,334 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-11-18 08:34:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 08:34:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,335 INFO L225 Difference]: With dead ends: 291 [2018-11-18 08:34:30,335 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 08:34:30,336 INFO L604 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-18 08:34:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 08:34:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-18 08:34:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 08:34:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-11-18 08:34:30,342 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-11-18 08:34:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,342 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-11-18 08:34:30,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-11-18 08:34:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:34:30,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,343 INFO L375 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-18 08:34:30,343 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,344 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-11-18 08:34:30,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,385 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-18 08:34:30,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,386 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-11-18 08:34:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,399 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-11-18 08:34:30,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 08:34:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,400 INFO L225 Difference]: With dead ends: 262 [2018-11-18 08:34:30,400 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 08:34:30,401 INFO L604 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-18 08:34:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 08:34:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-18 08:34:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 08:34:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-11-18 08:34:30,407 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-11-18 08:34:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,408 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-11-18 08:34:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-18 08:34:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:34:30,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,409 INFO L375 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-18 08:34:30,409 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-11-18 08:34:30,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,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-18 08:34:30,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,436 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-11-18 08:34:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,461 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-11-18 08:34:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 08:34:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,463 INFO L225 Difference]: With dead ends: 333 [2018-11-18 08:34:30,463 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 08:34:30,464 INFO L604 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-18 08:34:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 08:34:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-11-18 08:34:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-18 08:34:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-11-18 08:34:30,474 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-11-18 08:34:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,475 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-11-18 08:34:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-11-18 08:34:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:34:30,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,476 INFO L375 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-18 08:34:30,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-11-18 08:34:30,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,497 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-18 08:34:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,499 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-11-18 08:34:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,537 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-11-18 08:34:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 08:34:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,539 INFO L225 Difference]: With dead ends: 565 [2018-11-18 08:34:30,539 INFO L226 Difference]: Without dead ends: 339 [2018-11-18 08:34:30,540 INFO L604 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-18 08:34:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-18 08:34:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-11-18 08:34:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 08:34:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-11-18 08:34:30,551 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-11-18 08:34:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,551 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-11-18 08:34:30,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-11-18 08:34:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:34:30,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,553 INFO L375 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-18 08:34:30,553 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-11-18 08:34:30,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,570 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-18 08:34:30,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,571 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-11-18 08:34:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,593 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-11-18 08:34:30,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 08:34:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,595 INFO L225 Difference]: With dead ends: 505 [2018-11-18 08:34:30,595 INFO L226 Difference]: Without dead ends: 343 [2018-11-18 08:34:30,596 INFO L604 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-18 08:34:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-18 08:34:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-11-18 08:34:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-18 08:34:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-11-18 08:34:30,605 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-11-18 08:34:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,605 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-11-18 08:34:30,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-11-18 08:34:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:34:30,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,606 INFO L375 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-18 08:34:30,606 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-11-18 08:34:30,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,642 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-18 08:34:30,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,643 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-11-18 08:34:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,667 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-11-18 08:34:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 08:34:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,669 INFO L225 Difference]: With dead ends: 637 [2018-11-18 08:34:30,669 INFO L226 Difference]: Without dead ends: 635 [2018-11-18 08:34:30,670 INFO L604 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-18 08:34:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-18 08:34:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-11-18 08:34:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-18 08:34:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-11-18 08:34:30,685 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-11-18 08:34:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,685 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-11-18 08:34:30,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-11-18 08:34:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:34:30,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,686 INFO L375 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-18 08:34:30,687 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-11-18 08:34:30,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,703 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-18 08:34:30,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,705 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-11-18 08:34:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,730 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-11-18 08:34:30,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 08:34:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,733 INFO L225 Difference]: With dead ends: 1109 [2018-11-18 08:34:30,733 INFO L226 Difference]: Without dead ends: 659 [2018-11-18 08:34:30,734 INFO L604 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-18 08:34:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-18 08:34:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-11-18 08:34:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-18 08:34:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-11-18 08:34:30,754 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-11-18 08:34:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,754 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-11-18 08:34:30,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-11-18 08:34:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:34:30,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,756 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-11-18 08:34:30,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,786 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-18 08:34:30,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,788 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-11-18 08:34:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,808 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-11-18 08:34:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 08:34:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,810 INFO L225 Difference]: With dead ends: 985 [2018-11-18 08:34:30,810 INFO L226 Difference]: Without dead ends: 667 [2018-11-18 08:34:30,811 INFO L604 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-18 08:34:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-18 08:34:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-11-18 08:34:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-18 08:34:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-11-18 08:34:30,830 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-11-18 08:34:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,830 INFO L480 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-11-18 08:34:30,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-11-18 08:34:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:34:30,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,831 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-11-18 08:34:30,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,854 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-18 08:34:30,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,855 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-11-18 08:34:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,885 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-11-18 08:34:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 08:34:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,890 INFO L225 Difference]: With dead ends: 1933 [2018-11-18 08:34:30,890 INFO L226 Difference]: Without dead ends: 1291 [2018-11-18 08:34:30,891 INFO L604 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-18 08:34:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-18 08:34:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-11-18 08:34:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-18 08:34:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-11-18 08:34:30,928 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-11-18 08:34:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:30,929 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-11-18 08:34:30,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-11-18 08:34:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:34:30,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:30,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,931 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:30,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-11-18 08:34:30,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:30,950 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-18 08:34:30,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:30,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:30,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:30,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:30,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:30,951 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-11-18 08:34:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:30,979 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-11-18 08:34:30,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:30,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 08:34:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:30,984 INFO L225 Difference]: With dead ends: 1597 [2018-11-18 08:34:30,984 INFO L226 Difference]: Without dead ends: 1595 [2018-11-18 08:34:30,985 INFO L604 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-18 08:34:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-18 08:34:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-11-18 08:34:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-18 08:34:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-11-18 08:34:31,023 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-11-18 08:34:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:31,023 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-11-18 08:34:31,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-11-18 08:34:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 08:34:31,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:31,025 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,025 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:31,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-11-18 08:34:31,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,050 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-18 08:34:31,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:31,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:31,051 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-11-18 08:34:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,089 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-11-18 08:34:31,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:31,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 08:34:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:31,097 INFO L225 Difference]: With dead ends: 2365 [2018-11-18 08:34:31,097 INFO L226 Difference]: Without dead ends: 2363 [2018-11-18 08:34:31,099 INFO L604 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-18 08:34:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-11-18 08:34:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-11-18 08:34:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-11-18 08:34:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-11-18 08:34:31,152 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-11-18 08:34:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:31,152 INFO L480 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-11-18 08:34:31,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-11-18 08:34:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 08:34:31,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:31,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,155 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:31,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-11-18 08:34:31,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,209 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-18 08:34:31,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:31,210 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-11-18 08:34:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,270 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-11-18 08:34:31,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:31,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 08:34:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:31,277 INFO L225 Difference]: With dead ends: 4317 [2018-11-18 08:34:31,277 INFO L226 Difference]: Without dead ends: 2523 [2018-11-18 08:34:31,280 INFO L604 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-18 08:34:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-11-18 08:34:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-11-18 08:34:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-11-18 08:34:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-11-18 08:34:31,340 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-11-18 08:34:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:31,341 INFO L480 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-11-18 08:34:31,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-11-18 08:34:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 08:34:31,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:31,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,343 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:31,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-11-18 08:34:31,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,357 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-18 08:34:31,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:31,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:31,358 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-11-18 08:34:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,409 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-11-18 08:34:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:31,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 08:34:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:31,417 INFO L225 Difference]: With dead ends: 3805 [2018-11-18 08:34:31,417 INFO L226 Difference]: Without dead ends: 2571 [2018-11-18 08:34:31,420 INFO L604 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-18 08:34:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-11-18 08:34:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-11-18 08:34:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-11-18 08:34:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-11-18 08:34:31,484 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-11-18 08:34:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:31,484 INFO L480 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-11-18 08:34:31,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-11-18 08:34:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 08:34:31,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:31,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,487 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:31,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-11-18 08:34:31,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,501 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-18 08:34:31,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:31,502 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-11-18 08:34:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,559 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-11-18 08:34:31,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:31,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 08:34:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:31,572 INFO L225 Difference]: With dead ends: 4621 [2018-11-18 08:34:31,573 INFO L226 Difference]: Without dead ends: 4619 [2018-11-18 08:34:31,574 INFO L604 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-18 08:34:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-18 08:34:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-11-18 08:34:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-18 08:34:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-11-18 08:34:31,661 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-11-18 08:34:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:31,661 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-11-18 08:34:31,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-11-18 08:34:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 08:34:31,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:31,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,666 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:31,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-11-18 08:34:31,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,686 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-18 08:34:31,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:31,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:31,687 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-11-18 08:34:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:31,773 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-11-18 08:34:31,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:31,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 08:34:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:31,787 INFO L225 Difference]: With dead ends: 8589 [2018-11-18 08:34:31,788 INFO L226 Difference]: Without dead ends: 5003 [2018-11-18 08:34:31,793 INFO L604 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-18 08:34:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-18 08:34:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-11-18 08:34:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-11-18 08:34:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-11-18 08:34:31,911 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-11-18 08:34:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:31,911 INFO L480 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-11-18 08:34:31,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-11-18 08:34:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:34:31,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:31,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,915 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:31,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-11-18 08:34:31,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,933 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-18 08:34:31,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:31,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:31,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:31,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:31,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:31,934 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-11-18 08:34:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,039 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-11-18 08:34:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:32,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:34:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:32,048 INFO L225 Difference]: With dead ends: 7501 [2018-11-18 08:34:32,048 INFO L226 Difference]: Without dead ends: 5067 [2018-11-18 08:34:32,051 INFO L604 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-18 08:34:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-18 08:34:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-11-18 08:34:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-11-18 08:34:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-11-18 08:34:32,161 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-11-18 08:34:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:32,161 INFO L480 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-11-18 08:34:32,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-11-18 08:34:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:34:32,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:32,166 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,166 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:32,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-11-18 08:34:32,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,185 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-18 08:34:32,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:32,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:32,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:32,186 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-11-18 08:34:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,303 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-11-18 08:34:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:32,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:34:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:32,319 INFO L225 Difference]: With dead ends: 8973 [2018-11-18 08:34:32,319 INFO L226 Difference]: Without dead ends: 8971 [2018-11-18 08:34:32,322 INFO L604 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-18 08:34:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-18 08:34:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-11-18 08:34:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-11-18 08:34:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-11-18 08:34:32,483 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-11-18 08:34:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:32,484 INFO L480 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-11-18 08:34:32,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-11-18 08:34:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:34:32,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:32,491 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,491 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:32,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,491 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-11-18 08:34:32,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,506 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-18 08:34:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:32,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:32,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:32,507 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states. [2018-11-18 08:34:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,643 INFO L93 Difference]: Finished difference Result 17037 states and 25033 transitions. [2018-11-18 08:34:32,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:32,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:34:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:32,659 INFO L225 Difference]: With dead ends: 17037 [2018-11-18 08:34:32,659 INFO L226 Difference]: Without dead ends: 9867 [2018-11-18 08:34:32,670 INFO L604 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-18 08:34:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2018-11-18 08:34:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9865. [2018-11-18 08:34:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2018-11-18 08:34:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 14343 transitions. [2018-11-18 08:34:32,984 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 14343 transitions. Word has length 31 [2018-11-18 08:34:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:32,984 INFO L480 AbstractCegarLoop]: Abstraction has 9865 states and 14343 transitions. [2018-11-18 08:34:32,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 14343 transitions. [2018-11-18 08:34:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 08:34:32,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:32,992 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,992 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:32,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2139393499, now seen corresponding path program 1 times [2018-11-18 08:34:32,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,005 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-18 08:34:33,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:33,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:33,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:33,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:33,006 INFO L87 Difference]: Start difference. First operand 9865 states and 14343 transitions. Second operand 3 states. [2018-11-18 08:34:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:33,144 INFO L93 Difference]: Finished difference Result 14797 states and 21449 transitions. [2018-11-18 08:34:33,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:33,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 08:34:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:33,159 INFO L225 Difference]: With dead ends: 14797 [2018-11-18 08:34:33,159 INFO L226 Difference]: Without dead ends: 9995 [2018-11-18 08:34:33,167 INFO L604 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-18 08:34:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2018-11-18 08:34:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9993. [2018-11-18 08:34:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9993 states. [2018-11-18 08:34:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9993 states to 9993 states and 14343 transitions. [2018-11-18 08:34:33,369 INFO L78 Accepts]: Start accepts. Automaton has 9993 states and 14343 transitions. Word has length 32 [2018-11-18 08:34:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:33,369 INFO L480 AbstractCegarLoop]: Abstraction has 9993 states and 14343 transitions. [2018-11-18 08:34:33,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9993 states and 14343 transitions. [2018-11-18 08:34:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 08:34:33,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:33,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,377 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:33,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 551045597, now seen corresponding path program 1 times [2018-11-18 08:34:33,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,395 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-18 08:34:33,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:33,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:33,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:33,396 INFO L87 Difference]: Start difference. First operand 9993 states and 14343 transitions. Second operand 3 states. [2018-11-18 08:34:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:33,599 INFO L93 Difference]: Finished difference Result 17421 states and 25481 transitions. [2018-11-18 08:34:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:33,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 08:34:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:33,626 INFO L225 Difference]: With dead ends: 17421 [2018-11-18 08:34:33,626 INFO L226 Difference]: Without dead ends: 17419 [2018-11-18 08:34:33,632 INFO L604 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-18 08:34:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2018-11-18 08:34:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 14601. [2018-11-18 08:34:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2018-11-18 08:34:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20359 transitions. [2018-11-18 08:34:33,902 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20359 transitions. Word has length 32 [2018-11-18 08:34:33,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:33,903 INFO L480 AbstractCegarLoop]: Abstraction has 14601 states and 20359 transitions. [2018-11-18 08:34:33,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20359 transitions. [2018-11-18 08:34:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 08:34:33,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:33,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,919 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:33,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,919 INFO L82 PathProgramCache]: Analyzing trace with hash -470022757, now seen corresponding path program 1 times [2018-11-18 08:34:33,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,949 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-18 08:34:33,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:33,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:33,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:33,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:33,950 INFO L87 Difference]: Start difference. First operand 14601 states and 20359 transitions. Second operand 3 states. [2018-11-18 08:34:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:34,187 INFO L93 Difference]: Finished difference Result 33805 states and 47241 transitions. [2018-11-18 08:34:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 08:34:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:34,219 INFO L225 Difference]: With dead ends: 33805 [2018-11-18 08:34:34,219 INFO L226 Difference]: Without dead ends: 19467 [2018-11-18 08:34:34,239 INFO L604 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-18 08:34:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2018-11-18 08:34:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 19465. [2018-11-18 08:34:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19465 states. [2018-11-18 08:34:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19465 states to 19465 states and 26887 transitions. [2018-11-18 08:34:34,581 INFO L78 Accepts]: Start accepts. Automaton has 19465 states and 26887 transitions. Word has length 32 [2018-11-18 08:34:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:34,582 INFO L480 AbstractCegarLoop]: Abstraction has 19465 states and 26887 transitions. [2018-11-18 08:34:34,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19465 states and 26887 transitions. [2018-11-18 08:34:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:34:34,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:34,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:34,593 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:34,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -97240540, now seen corresponding path program 1 times [2018-11-18 08:34:34,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:34,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:34,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:34,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:34,610 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-18 08:34:34,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:34,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:34,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:34,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:34,611 INFO L87 Difference]: Start difference. First operand 19465 states and 26887 transitions. Second operand 3 states. [2018-11-18 08:34:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:34,839 INFO L93 Difference]: Finished difference Result 29197 states and 40201 transitions. [2018-11-18 08:34:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:34,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 08:34:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:34,863 INFO L225 Difference]: With dead ends: 29197 [2018-11-18 08:34:34,863 INFO L226 Difference]: Without dead ends: 19723 [2018-11-18 08:34:34,876 INFO L604 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-18 08:34:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2018-11-18 08:34:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19721. [2018-11-18 08:34:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19721 states. [2018-11-18 08:34:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19721 states to 19721 states and 26887 transitions. [2018-11-18 08:34:35,220 INFO L78 Accepts]: Start accepts. Automaton has 19721 states and 26887 transitions. Word has length 33 [2018-11-18 08:34:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:35,220 INFO L480 AbstractCegarLoop]: Abstraction has 19721 states and 26887 transitions. [2018-11-18 08:34:35,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19721 states and 26887 transitions. [2018-11-18 08:34:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:34:35,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:35,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:35,230 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:35,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1685588442, now seen corresponding path program 1 times [2018-11-18 08:34:35,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,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-18 08:34:35,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:35,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:35,247 INFO L87 Difference]: Start difference. First operand 19721 states and 26887 transitions. Second operand 3 states. [2018-11-18 08:34:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:35,485 INFO L93 Difference]: Finished difference Result 33805 states and 46857 transitions. [2018-11-18 08:34:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:35,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 08:34:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:35,510 INFO L225 Difference]: With dead ends: 33805 [2018-11-18 08:34:35,510 INFO L226 Difference]: Without dead ends: 33803 [2018-11-18 08:34:35,520 INFO L604 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-18 08:34:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33803 states. [2018-11-18 08:34:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33803 to 29193. [2018-11-18 08:34:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29193 states. [2018-11-18 08:34:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29193 states to 29193 states and 38663 transitions. [2018-11-18 08:34:35,944 INFO L78 Accepts]: Start accepts. Automaton has 29193 states and 38663 transitions. Word has length 33 [2018-11-18 08:34:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:35,944 INFO L480 AbstractCegarLoop]: Abstraction has 29193 states and 38663 transitions. [2018-11-18 08:34:35,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 29193 states and 38663 transitions. [2018-11-18 08:34:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:34:35,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:35,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:35,956 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:35,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1588310500, now seen corresponding path program 1 times [2018-11-18 08:34:35,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,993 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-18 08:34:35,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:35,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:35,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:35,994 INFO L87 Difference]: Start difference. First operand 29193 states and 38663 transitions. Second operand 3 states. [2018-11-18 08:34:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:36,287 INFO L93 Difference]: Finished difference Result 67085 states and 88841 transitions. [2018-11-18 08:34:36,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:36,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 08:34:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:36,319 INFO L225 Difference]: With dead ends: 67085 [2018-11-18 08:34:36,319 INFO L226 Difference]: Without dead ends: 38411 [2018-11-18 08:34:36,350 INFO L604 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-18 08:34:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38411 states. [2018-11-18 08:34:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38411 to 38409. [2018-11-18 08:34:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38409 states. [2018-11-18 08:34:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38409 states to 38409 states and 50183 transitions. [2018-11-18 08:34:36,957 INFO L78 Accepts]: Start accepts. Automaton has 38409 states and 50183 transitions. Word has length 33 [2018-11-18 08:34:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:36,958 INFO L480 AbstractCegarLoop]: Abstraction has 38409 states and 50183 transitions. [2018-11-18 08:34:36,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38409 states and 50183 transitions. [2018-11-18 08:34:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:34:36,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:36,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,969 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:36,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash -713418672, now seen corresponding path program 1 times [2018-11-18 08:34:36,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,994 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-18 08:34:36,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:36,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:36,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:36,995 INFO L87 Difference]: Start difference. First operand 38409 states and 50183 transitions. Second operand 3 states. [2018-11-18 08:34:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:37,302 INFO L93 Difference]: Finished difference Result 57613 states and 75017 transitions. [2018-11-18 08:34:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:37,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 08:34:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:37,332 INFO L225 Difference]: With dead ends: 57613 [2018-11-18 08:34:37,332 INFO L226 Difference]: Without dead ends: 38923 [2018-11-18 08:34:37,350 INFO L604 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-18 08:34:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38923 states. [2018-11-18 08:34:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38923 to 38921. [2018-11-18 08:34:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38921 states. [2018-11-18 08:34:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38921 states to 38921 states and 50183 transitions. [2018-11-18 08:34:37,937 INFO L78 Accepts]: Start accepts. Automaton has 38921 states and 50183 transitions. Word has length 34 [2018-11-18 08:34:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:37,937 INFO L480 AbstractCegarLoop]: Abstraction has 38921 states and 50183 transitions. [2018-11-18 08:34:37,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 38921 states and 50183 transitions. [2018-11-18 08:34:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:34:37,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:37,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:37,951 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:37,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:37,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1993200722, now seen corresponding path program 1 times [2018-11-18 08:34:37,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:37,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:37,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:37,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:37,985 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-18 08:34:37,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:37,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:37,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:37,986 INFO L87 Difference]: Start difference. First operand 38921 states and 50183 transitions. Second operand 3 states. [2018-11-18 08:34:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:38,473 INFO L93 Difference]: Finished difference Result 65549 states and 85513 transitions. [2018-11-18 08:34:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:38,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 08:34:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:38,521 INFO L225 Difference]: With dead ends: 65549 [2018-11-18 08:34:38,521 INFO L226 Difference]: Without dead ends: 65547 [2018-11-18 08:34:38,533 INFO L604 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-18 08:34:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65547 states. [2018-11-18 08:34:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65547 to 58377. [2018-11-18 08:34:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58377 states. [2018-11-18 08:34:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58377 states to 58377 states and 73223 transitions. [2018-11-18 08:34:39,341 INFO L78 Accepts]: Start accepts. Automaton has 58377 states and 73223 transitions. Word has length 34 [2018-11-18 08:34:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:39,341 INFO L480 AbstractCegarLoop]: Abstraction has 58377 states and 73223 transitions. [2018-11-18 08:34:39,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 58377 states and 73223 transitions. [2018-11-18 08:34:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:34:39,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:39,372 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:39,372 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:39,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash 972132368, now seen corresponding path program 1 times [2018-11-18 08:34:39,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:39,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:39,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:39,389 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-18 08:34:39,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:39,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:39,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:39,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:39,390 INFO L87 Difference]: Start difference. First operand 58377 states and 73223 transitions. Second operand 3 states. [2018-11-18 08:34:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:40,030 INFO L93 Difference]: Finished difference Result 133133 states and 166409 transitions. [2018-11-18 08:34:40,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:40,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 08:34:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:40,087 INFO L225 Difference]: With dead ends: 133133 [2018-11-18 08:34:40,087 INFO L226 Difference]: Without dead ends: 75787 [2018-11-18 08:34:40,125 INFO L604 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-18 08:34:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2018-11-18 08:34:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 75785. [2018-11-18 08:34:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75785 states. [2018-11-18 08:34:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75785 states to 75785 states and 93191 transitions. [2018-11-18 08:34:41,310 INFO L78 Accepts]: Start accepts. Automaton has 75785 states and 93191 transitions. Word has length 34 [2018-11-18 08:34:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:41,311 INFO L480 AbstractCegarLoop]: Abstraction has 75785 states and 93191 transitions. [2018-11-18 08:34:41,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75785 states and 93191 transitions. [2018-11-18 08:34:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 08:34:41,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:41,336 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:41,336 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:41,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:41,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1659896057, now seen corresponding path program 1 times [2018-11-18 08:34:41,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:41,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:41,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:41,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:41,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:41,370 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-18 08:34:41,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:41,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:41,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:41,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:41,371 INFO L87 Difference]: Start difference. First operand 75785 states and 93191 transitions. Second operand 3 states. [2018-11-18 08:34:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:42,006 INFO L93 Difference]: Finished difference Result 113677 states and 139273 transitions. [2018-11-18 08:34:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:42,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 08:34:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:42,067 INFO L225 Difference]: With dead ends: 113677 [2018-11-18 08:34:42,067 INFO L226 Difference]: Without dead ends: 76811 [2018-11-18 08:34:42,094 INFO L604 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-18 08:34:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76811 states. [2018-11-18 08:34:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76811 to 76809. [2018-11-18 08:34:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76809 states. [2018-11-18 08:34:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76809 states to 76809 states and 93191 transitions. [2018-11-18 08:34:43,368 INFO L78 Accepts]: Start accepts. Automaton has 76809 states and 93191 transitions. Word has length 35 [2018-11-18 08:34:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:43,369 INFO L480 AbstractCegarLoop]: Abstraction has 76809 states and 93191 transitions. [2018-11-18 08:34:43,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 76809 states and 93191 transitions. [2018-11-18 08:34:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 08:34:43,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:43,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:43,396 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:43,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:43,396 INFO L82 PathProgramCache]: Analyzing trace with hash 71548155, now seen corresponding path program 1 times [2018-11-18 08:34:43,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:43,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:43,422 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-18 08:34:43,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:43,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:43,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:43,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:43,423 INFO L87 Difference]: Start difference. First operand 76809 states and 93191 transitions. Second operand 3 states. [2018-11-18 08:34:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:44,586 INFO L93 Difference]: Finished difference Result 126989 states and 154633 transitions. [2018-11-18 08:34:44,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:44,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 08:34:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:44,685 INFO L225 Difference]: With dead ends: 126989 [2018-11-18 08:34:44,685 INFO L226 Difference]: Without dead ends: 126987 [2018-11-18 08:34:44,698 INFO L604 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-18 08:34:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126987 states. [2018-11-18 08:34:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126987 to 116745. [2018-11-18 08:34:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116745 states. [2018-11-18 08:34:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116745 states to 116745 states and 138247 transitions. [2018-11-18 08:34:45,931 INFO L78 Accepts]: Start accepts. Automaton has 116745 states and 138247 transitions. Word has length 35 [2018-11-18 08:34:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:45,931 INFO L480 AbstractCegarLoop]: Abstraction has 116745 states and 138247 transitions. [2018-11-18 08:34:45,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 116745 states and 138247 transitions. [2018-11-18 08:34:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 08:34:45,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:45,990 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:45,990 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:45,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash -949520199, now seen corresponding path program 1 times [2018-11-18 08:34:45,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:45,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:45,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:45,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:45,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:46,006 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-18 08:34:46,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:46,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:46,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:46,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:46,007 INFO L87 Difference]: Start difference. First operand 116745 states and 138247 transitions. Second operand 3 states. [2018-11-18 08:34:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:47,545 INFO L93 Difference]: Finished difference Result 264205 states and 310281 transitions. [2018-11-18 08:34:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:47,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 08:34:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:47,655 INFO L225 Difference]: With dead ends: 264205 [2018-11-18 08:34:47,655 INFO L226 Difference]: Without dead ends: 149515 [2018-11-18 08:34:47,717 INFO L604 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-18 08:34:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149515 states. [2018-11-18 08:34:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149515 to 149513. [2018-11-18 08:34:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149513 states. [2018-11-18 08:34:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149513 states to 149513 states and 172039 transitions. [2018-11-18 08:34:51,483 INFO L78 Accepts]: Start accepts. Automaton has 149513 states and 172039 transitions. Word has length 35 [2018-11-18 08:34:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:51,483 INFO L480 AbstractCegarLoop]: Abstraction has 149513 states and 172039 transitions. [2018-11-18 08:34:51,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 149513 states and 172039 transitions. [2018-11-18 08:34:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:34:51,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:51,537 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:51,537 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:51,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2076758331, now seen corresponding path program 1 times [2018-11-18 08:34:51,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:51,566 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-18 08:34:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:51,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:51,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:51,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:51,567 INFO L87 Difference]: Start difference. First operand 149513 states and 172039 transitions. Second operand 3 states. [2018-11-18 08:34:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:52,871 INFO L93 Difference]: Finished difference Result 224269 states and 257033 transitions. [2018-11-18 08:34:52,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:52,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 08:34:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:52,997 INFO L225 Difference]: With dead ends: 224269 [2018-11-18 08:34:52,997 INFO L226 Difference]: Without dead ends: 151563 [2018-11-18 08:34:53,051 INFO L604 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-18 08:34:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-18 08:34:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 151561. [2018-11-18 08:34:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-18 08:34:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 172039 transitions. [2018-11-18 08:34:55,430 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 172039 transitions. Word has length 36 [2018-11-18 08:34:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:55,430 INFO L480 AbstractCegarLoop]: Abstraction has 151561 states and 172039 transitions. [2018-11-18 08:34:55,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 172039 transitions. [2018-11-18 08:34:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:34:55,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:55,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:55,485 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:55,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 629861063, now seen corresponding path program 1 times [2018-11-18 08:34:55,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,510 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-18 08:34:55,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:55,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:55,511 INFO L87 Difference]: Start difference. First operand 151561 states and 172039 transitions. Second operand 3 states. [2018-11-18 08:34:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:58,537 INFO L93 Difference]: Finished difference Result 442379 states and 491528 transitions. [2018-11-18 08:34:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:58,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 08:34:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:58,672 INFO L225 Difference]: With dead ends: 442379 [2018-11-18 08:34:58,672 INFO L226 Difference]: Without dead ends: 151561 [2018-11-18 08:34:58,754 INFO L604 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-18 08:34:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151561 states. [2018-11-18 08:35:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151561 to 151561. [2018-11-18 08:35:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-18 08:35:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 163847 transitions. [2018-11-18 08:35:00,772 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 163847 transitions. Word has length 36 [2018-11-18 08:35:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,772 INFO L480 AbstractCegarLoop]: Abstraction has 151561 states and 163847 transitions. [2018-11-18 08:35:00,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 163847 transitions. [2018-11-18 08:35:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:35:00,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,829 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1650929417, now seen corresponding path program 1 times [2018-11-18 08:35:00,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,849 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-18 08:35:00,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,850 INFO L87 Difference]: Start difference. First operand 151561 states and 163847 transitions. Second operand 3 states. [2018-11-18 08:35:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:02,022 INFO L93 Difference]: Finished difference Result 151561 states and 163847 transitions. [2018-11-18 08:35:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:02,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 08:35:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:02,023 INFO L225 Difference]: With dead ends: 151561 [2018-11-18 08:35:02,023 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 08:35:02,101 INFO L604 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-18 08:35:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 08:35:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 08:35:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 08:35:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 08:35:02,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-18 08:35:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:02,102 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:35:02,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:35:02,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 08:35:02,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 08:35:02,132 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 08:35:02,132 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 08:35:02,133 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L428 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-18 08:35:02,133 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,134 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L428 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,135 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-11-18 08:35:02,135 INFO L425 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L421 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,136 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,137 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-11-18 08:35:02,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:35:02 BoogieIcfgContainer [2018-11-18 08:35:02,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:35:02,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:35:02,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:35:02,143 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:35:02,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:29" (3/4) ... [2018-11-18 08:35:02,147 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 08:35:02,152 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 08:35:02,152 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 08:35:02,157 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 08:35:02,157 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 08:35:02,157 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 08:35:02,205 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2e56debc-92db-457d-a47d-f5f842e775b1/bin-2019/uautomizer/witness.graphml [2018-11-18 08:35:02,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:35:02,206 INFO L168 Benchmark]: Toolchain (without parser) took 32941.84 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -274.4 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 08:35:02,207 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:02,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:02,207 INFO L168 Benchmark]: Boogie Preprocessor took 68.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:02,208 INFO L168 Benchmark]: RCFGBuilder took 251.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:02,208 INFO L168 Benchmark]: TraceAbstraction took 32375.34 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.5 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 08:35:02,208 INFO L168 Benchmark]: Witness Printer took 62.46 ms. Allocated memory is still 5.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 699.0 kB). Peak memory consumption was 699.0 kB. Max. memory is 11.5 GB. [2018-11-18 08:35:02,211 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 251.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32375.34 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.5 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 62.46 ms. Allocated memory is still 5.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 699.0 kB). Peak memory consumption was 699.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. SAFE Result, 32.3s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4036 SDtfs, 2016 SDslu, 2748 SDs, 0 SdLazy, 195 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151561occurred in iteration=35, 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: 16.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 28711 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 65104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...