./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_10_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_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/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 0f7b0b589689413087c164ce10eb80c902ee4046 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:15:28,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:15:28,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:15:28,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:15:28,261 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:15:28,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:15:28,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:15:28,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:15:28,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:15:28,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:15:28,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:15:28,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:15:28,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:15:28,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:15:28,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:15:28,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:15:28,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:15:28,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:15:28,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:15:28,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:15:28,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:15:28,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:15:28,285 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:15:28,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:15:28,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:15:28,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:15:28,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:15:28,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:15:28,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:15:28,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:15:28,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:15:28,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:15:28,295 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:15:28,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:15:28,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:15:28,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:15:28,296 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 14:15:28,313 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:15:28,313 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:15:28,314 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:15:28,314 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 14:15:28,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:15:28,315 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:15:28,315 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:15:28,315 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:15:28,315 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:15:28,315 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:15:28,315 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:15:28,316 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:15:28,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:15:28,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:15:28,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:15:28,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:15:28,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:15:28,317 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:15:28,317 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:15:28,317 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:15:28,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:15:28,318 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:15:28,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:15:28,318 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_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-18 14:15:28,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:15:28,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:15:28,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:15:28,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:15:28,357 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:15:28,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:15:28,395 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/data/3bdc97ee1/ea7d2936be91497b9053ab9172e9898e/FLAGf3fbbd509 [2018-11-18 14:15:28,745 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:15:28,747 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:15:28,753 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/data/3bdc97ee1/ea7d2936be91497b9053ab9172e9898e/FLAGf3fbbd509 [2018-11-18 14:15:29,166 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/data/3bdc97ee1/ea7d2936be91497b9053ab9172e9898e [2018-11-18 14:15:29,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:15:29,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 14:15:29,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:15:29,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:15:29,171 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:15:29,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c53f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29, skipping insertion in model container [2018-11-18 14:15:29,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:15:29,193 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:15:29,314 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:15:29,316 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:15:29,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:15:29,344 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:15:29,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29 WrapperNode [2018-11-18 14:15:29,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:15:29,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:15:29,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:15:29,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:15:29,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... [2018-11-18 14:15:29,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:15:29,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:15:29,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:15:29,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:15:29,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/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 14:15:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:15:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:15:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:15:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 14:15:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 14:15:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:15:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:15:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:15:29,793 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:15:29,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:15:29 BoogieIcfgContainer [2018-11-18 14:15:29,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:15:29,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:15:29,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:15:29,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:15:29,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:15:29" (1/3) ... [2018-11-18 14:15:29,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c62c077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:15:29, skipping insertion in model container [2018-11-18 14:15:29,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:15:29" (2/3) ... [2018-11-18 14:15:29,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c62c077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:15:29, skipping insertion in model container [2018-11-18 14:15:29,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:15:29" (3/3) ... [2018-11-18 14:15:29,799 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:15:29,805 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:15:29,810 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:15:29,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:15:29,837 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:15:29,838 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:15:29,838 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:15:29,838 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:15:29,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:15:29,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:15:29,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:15:29,839 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:15:29,839 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:15:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-18 14:15:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:15:29,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:29,863 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] [2018-11-18 14:15:29,865 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:29,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1332805667, now seen corresponding path program 1 times [2018-11-18 14:15:29,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:29,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:29,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:29,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:29,991 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 14:15:29,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:29,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:29,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,011 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-18 14:15:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,050 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2018-11-18 14:15:30,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:15:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,059 INFO L225 Difference]: With dead ends: 89 [2018-11-18 14:15:30,059 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 14:15:30,061 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 14:15:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 14:15:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2018-11-18 14:15:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 14:15:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-11-18 14:15:30,093 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2018-11-18 14:15:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,093 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2018-11-18 14:15:30,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2018-11-18 14:15:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:15:30,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,094 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] [2018-11-18 14:15:30,094 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1919611681, now seen corresponding path program 1 times [2018-11-18 14:15:30,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,148 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 14:15:30,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,150 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-11-18 14:15:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,179 INFO L93 Difference]: Finished difference Result 120 states and 215 transitions. [2018-11-18 14:15:30,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:15:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,181 INFO L225 Difference]: With dead ends: 120 [2018-11-18 14:15:30,181 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 14:15:30,182 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 14:15:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 14:15:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-18 14:15:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 14:15:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-11-18 14:15:30,189 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 21 [2018-11-18 14:15:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,189 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2018-11-18 14:15:30,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2018-11-18 14:15:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:15:30,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,190 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] [2018-11-18 14:15:30,190 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1632910664, now seen corresponding path program 1 times [2018-11-18 14:15:30,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,232 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 14:15:30,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,233 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 3 states. [2018-11-18 14:15:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,286 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2018-11-18 14:15:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:15:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,289 INFO L225 Difference]: With dead ends: 112 [2018-11-18 14:15:30,289 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 14:15:30,289 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 14:15:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 14:15:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-18 14:15:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 14:15:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-11-18 14:15:30,295 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 22 [2018-11-18 14:15:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,296 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-11-18 14:15:30,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-11-18 14:15:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:15:30,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,297 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] [2018-11-18 14:15:30,297 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash 621793414, now seen corresponding path program 1 times [2018-11-18 14:15:30,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,348 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 14:15:30,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,349 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 3 states. [2018-11-18 14:15:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,371 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2018-11-18 14:15:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:15:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,372 INFO L225 Difference]: With dead ends: 141 [2018-11-18 14:15:30,372 INFO L226 Difference]: Without dead ends: 139 [2018-11-18 14:15:30,373 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 14:15:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-18 14:15:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-11-18 14:15:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 14:15:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-11-18 14:15:30,392 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 22 [2018-11-18 14:15:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,392 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-11-18 14:15:30,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-11-18 14:15:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 14:15:30,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,393 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] [2018-11-18 14:15:30,394 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,394 INFO L82 PathProgramCache]: Analyzing trace with hash 34987400, now seen corresponding path program 1 times [2018-11-18 14:15:30,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,452 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 14:15:30,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,453 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 3 states. [2018-11-18 14:15:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,472 INFO L93 Difference]: Finished difference Result 231 states and 405 transitions. [2018-11-18 14:15:30,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 14:15:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,473 INFO L225 Difference]: With dead ends: 231 [2018-11-18 14:15:30,473 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 14:15:30,474 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 14:15:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 14:15:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-18 14:15:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 14:15:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 239 transitions. [2018-11-18 14:15:30,483 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 239 transitions. Word has length 22 [2018-11-18 14:15:30,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,484 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 239 transitions. [2018-11-18 14:15:30,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2018-11-18 14:15:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 14:15:30,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,484 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] [2018-11-18 14:15:30,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940372, now seen corresponding path program 1 times [2018-11-18 14:15:30,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,536 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 14:15:30,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,537 INFO L87 Difference]: Start difference. First operand 139 states and 239 transitions. Second operand 3 states. [2018-11-18 14:15:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,552 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2018-11-18 14:15:30,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 14:15:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,553 INFO L225 Difference]: With dead ends: 208 [2018-11-18 14:15:30,553 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 14:15:30,554 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 14:15:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 14:15:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-18 14:15:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 14:15:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 239 transitions. [2018-11-18 14:15:30,561 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 239 transitions. Word has length 23 [2018-11-18 14:15:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,561 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 239 transitions. [2018-11-18 14:15:30,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-11-18 14:15:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 14:15:30,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,562 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] [2018-11-18 14:15:30,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1084823122, now seen corresponding path program 1 times [2018-11-18 14:15:30,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,591 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 14:15:30,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,592 INFO L87 Difference]: Start difference. First operand 141 states and 239 transitions. Second operand 3 states. [2018-11-18 14:15:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,607 INFO L93 Difference]: Finished difference Result 261 states and 449 transitions. [2018-11-18 14:15:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 14:15:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,609 INFO L225 Difference]: With dead ends: 261 [2018-11-18 14:15:30,609 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 14:15:30,609 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 14:15:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 14:15:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 189. [2018-11-18 14:15:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 14:15:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2018-11-18 14:15:30,618 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 23 [2018-11-18 14:15:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,618 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2018-11-18 14:15:30,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2018-11-18 14:15:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 14:15:30,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,620 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] [2018-11-18 14:15:30,620 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 498017108, now seen corresponding path program 1 times [2018-11-18 14:15:30,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,647 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 14:15:30,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,648 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 3 states. [2018-11-18 14:15:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,666 INFO L93 Difference]: Finished difference Result 445 states and 757 transitions. [2018-11-18 14:15:30,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 14:15:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,667 INFO L225 Difference]: With dead ends: 445 [2018-11-18 14:15:30,667 INFO L226 Difference]: Without dead ends: 267 [2018-11-18 14:15:30,668 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 14:15:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-18 14:15:30,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-11-18 14:15:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-18 14:15:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 443 transitions. [2018-11-18 14:15:30,679 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 443 transitions. Word has length 23 [2018-11-18 14:15:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,679 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 443 transitions. [2018-11-18 14:15:30,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 443 transitions. [2018-11-18 14:15:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 14:15:30,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,680 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 14:15:30,680 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash -730007523, now seen corresponding path program 1 times [2018-11-18 14:15:30,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,739 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 14:15:30,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,740 INFO L87 Difference]: Start difference. First operand 265 states and 443 transitions. Second operand 3 states. [2018-11-18 14:15:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,779 INFO L93 Difference]: Finished difference Result 397 states and 661 transitions. [2018-11-18 14:15:30,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 14:15:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,780 INFO L225 Difference]: With dead ends: 397 [2018-11-18 14:15:30,780 INFO L226 Difference]: Without dead ends: 271 [2018-11-18 14:15:30,781 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 14:15:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-18 14:15:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-11-18 14:15:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-18 14:15:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 443 transitions. [2018-11-18 14:15:30,793 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 443 transitions. Word has length 24 [2018-11-18 14:15:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,793 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 443 transitions. [2018-11-18 14:15:30,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 443 transitions. [2018-11-18 14:15:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 14:15:30,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,799 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 14:15:30,799 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1741124773, now seen corresponding path program 1 times [2018-11-18 14:15:30,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,829 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 14:15:30,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,830 INFO L87 Difference]: Start difference. First operand 269 states and 443 transitions. Second operand 3 states. [2018-11-18 14:15:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,872 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2018-11-18 14:15:30,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 14:15:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,874 INFO L225 Difference]: With dead ends: 493 [2018-11-18 14:15:30,874 INFO L226 Difference]: Without dead ends: 491 [2018-11-18 14:15:30,874 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 14:15:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-18 14:15:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2018-11-18 14:15:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-18 14:15:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 599 transitions. [2018-11-18 14:15:30,885 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 599 transitions. Word has length 24 [2018-11-18 14:15:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,885 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 599 transitions. [2018-11-18 14:15:30,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 599 transitions. [2018-11-18 14:15:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 14:15:30,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,886 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 14:15:30,887 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1967036509, now seen corresponding path program 1 times [2018-11-18 14:15:30,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:30,911 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 14:15:30,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:30,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:30,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:30,912 INFO L87 Difference]: Start difference. First operand 369 states and 599 transitions. Second operand 3 states. [2018-11-18 14:15:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:30,968 INFO L93 Difference]: Finished difference Result 869 states and 1417 transitions. [2018-11-18 14:15:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:30,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 14:15:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:30,970 INFO L225 Difference]: With dead ends: 869 [2018-11-18 14:15:30,970 INFO L226 Difference]: Without dead ends: 515 [2018-11-18 14:15:30,971 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 14:15:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-18 14:15:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2018-11-18 14:15:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-18 14:15:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2018-11-18 14:15:30,988 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 24 [2018-11-18 14:15:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:30,988 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2018-11-18 14:15:30,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2018-11-18 14:15:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 14:15:30,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:30,989 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 14:15:30,989 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:30,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1859921289, now seen corresponding path program 1 times [2018-11-18 14:15:30,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:31,020 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 14:15:31,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:31,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:31,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:31,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:31,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:31,021 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand 3 states. [2018-11-18 14:15:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:31,115 INFO L93 Difference]: Finished difference Result 769 states and 1229 transitions. [2018-11-18 14:15:31,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:31,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 14:15:31,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:31,118 INFO L225 Difference]: With dead ends: 769 [2018-11-18 14:15:31,118 INFO L226 Difference]: Without dead ends: 523 [2018-11-18 14:15:31,118 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 14:15:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-18 14:15:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2018-11-18 14:15:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-18 14:15:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 823 transitions. [2018-11-18 14:15:31,134 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 823 transitions. Word has length 25 [2018-11-18 14:15:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:31,135 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 823 transitions. [2018-11-18 14:15:31,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 823 transitions. [2018-11-18 14:15:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 14:15:31,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:31,136 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 14:15:31,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:31,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash 848804039, now seen corresponding path program 1 times [2018-11-18 14:15:31,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:31,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:31,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:31,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:31,199 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 14:15:31,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:31,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:31,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:31,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:31,201 INFO L87 Difference]: Start difference. First operand 521 states and 823 transitions. Second operand 3 states. [2018-11-18 14:15:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:31,273 INFO L93 Difference]: Finished difference Result 1501 states and 2361 transitions. [2018-11-18 14:15:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:31,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 14:15:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:31,276 INFO L225 Difference]: With dead ends: 1501 [2018-11-18 14:15:31,276 INFO L226 Difference]: Without dead ends: 1003 [2018-11-18 14:15:31,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 14:15:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-18 14:15:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1001. [2018-11-18 14:15:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-18 14:15:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1543 transitions. [2018-11-18 14:15:31,304 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1543 transitions. Word has length 25 [2018-11-18 14:15:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:31,304 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1543 transitions. [2018-11-18 14:15:31,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1543 transitions. [2018-11-18 14:15:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 14:15:31,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:31,306 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 14:15:31,306 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:31,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1435610053, now seen corresponding path program 1 times [2018-11-18 14:15:31,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:15:31,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:31,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:31,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:31,385 INFO L87 Difference]: Start difference. First operand 1001 states and 1543 transitions. Second operand 3 states. [2018-11-18 14:15:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:31,457 INFO L93 Difference]: Finished difference Result 1213 states and 1913 transitions. [2018-11-18 14:15:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:31,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 14:15:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:31,461 INFO L225 Difference]: With dead ends: 1213 [2018-11-18 14:15:31,461 INFO L226 Difference]: Without dead ends: 1211 [2018-11-18 14:15:31,461 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 14:15:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-18 14:15:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1001. [2018-11-18 14:15:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-18 14:15:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1527 transitions. [2018-11-18 14:15:31,490 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1527 transitions. Word has length 25 [2018-11-18 14:15:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:31,490 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1527 transitions. [2018-11-18 14:15:31,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1527 transitions. [2018-11-18 14:15:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 14:15:31,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:31,492 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 14:15:31,492 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:31,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash 543336178, now seen corresponding path program 1 times [2018-11-18 14:15:31,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:31,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:31,559 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 14:15:31,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:31,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:31,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:31,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:31,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:31,560 INFO L87 Difference]: Start difference. First operand 1001 states and 1527 transitions. Second operand 3 states. [2018-11-18 14:15:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:31,667 INFO L93 Difference]: Finished difference Result 1789 states and 2777 transitions. [2018-11-18 14:15:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:31,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 14:15:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:31,672 INFO L225 Difference]: With dead ends: 1789 [2018-11-18 14:15:31,672 INFO L226 Difference]: Without dead ends: 1787 [2018-11-18 14:15:31,673 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 14:15:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-11-18 14:15:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1433. [2018-11-18 14:15:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-11-18 14:15:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2135 transitions. [2018-11-18 14:15:31,717 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2135 transitions. Word has length 26 [2018-11-18 14:15:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:31,717 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2135 transitions. [2018-11-18 14:15:31,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2135 transitions. [2018-11-18 14:15:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 14:15:31,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:31,721 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 14:15:31,721 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:31,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:31,721 INFO L82 PathProgramCache]: Analyzing trace with hash -43469836, now seen corresponding path program 1 times [2018-11-18 14:15:31,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:31,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:31,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:31,797 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 14:15:31,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:31,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:31,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:31,799 INFO L87 Difference]: Start difference. First operand 1433 states and 2135 transitions. Second operand 3 states. [2018-11-18 14:15:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:31,886 INFO L93 Difference]: Finished difference Result 3357 states and 5017 transitions. [2018-11-18 14:15:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:31,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 14:15:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:31,891 INFO L225 Difference]: With dead ends: 3357 [2018-11-18 14:15:31,891 INFO L226 Difference]: Without dead ends: 1947 [2018-11-18 14:15:31,893 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 14:15:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2018-11-18 14:15:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1945. [2018-11-18 14:15:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-18 14:15:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2855 transitions. [2018-11-18 14:15:31,944 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2855 transitions. Word has length 26 [2018-11-18 14:15:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:31,944 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 2855 transitions. [2018-11-18 14:15:31,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2855 transitions. [2018-11-18 14:15:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 14:15:31,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:31,947 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 14:15:31,947 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:31,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -336232580, now seen corresponding path program 1 times [2018-11-18 14:15:31,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:31,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:32,016 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 14:15:32,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:32,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:32,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:32,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:32,017 INFO L87 Difference]: Start difference. First operand 1945 states and 2855 transitions. Second operand 3 states. [2018-11-18 14:15:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:32,124 INFO L93 Difference]: Finished difference Result 2941 states and 4313 transitions. [2018-11-18 14:15:32,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:32,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 14:15:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:32,130 INFO L225 Difference]: With dead ends: 2941 [2018-11-18 14:15:32,131 INFO L226 Difference]: Without dead ends: 1995 [2018-11-18 14:15:32,133 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 14:15:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-11-18 14:15:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2018-11-18 14:15:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-11-18 14:15:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2887 transitions. [2018-11-18 14:15:32,183 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2887 transitions. Word has length 27 [2018-11-18 14:15:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:32,184 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 2887 transitions. [2018-11-18 14:15:32,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2887 transitions. [2018-11-18 14:15:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 14:15:32,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:32,188 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 14:15:32,188 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:32,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349830, now seen corresponding path program 1 times [2018-11-18 14:15:32,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:32,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:32,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:32,271 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 14:15:32,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:32,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:32,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:32,273 INFO L87 Difference]: Start difference. First operand 1993 states and 2887 transitions. Second operand 3 states. [2018-11-18 14:15:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:32,375 INFO L93 Difference]: Finished difference Result 3469 states and 5097 transitions. [2018-11-18 14:15:32,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:32,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 14:15:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:32,384 INFO L225 Difference]: With dead ends: 3469 [2018-11-18 14:15:32,384 INFO L226 Difference]: Without dead ends: 3467 [2018-11-18 14:15:32,385 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 14:15:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-18 14:15:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2889. [2018-11-18 14:15:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-11-18 14:15:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4071 transitions. [2018-11-18 14:15:32,437 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4071 transitions. Word has length 27 [2018-11-18 14:15:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:32,437 INFO L480 AbstractCegarLoop]: Abstraction has 2889 states and 4071 transitions. [2018-11-18 14:15:32,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4071 transitions. [2018-11-18 14:15:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 14:15:32,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:32,442 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 14:15:32,442 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:32,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:32,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155844, now seen corresponding path program 1 times [2018-11-18 14:15:32,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:32,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:32,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:32,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:32,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:32,523 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 14:15:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:32,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:32,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:32,524 INFO L87 Difference]: Start difference. First operand 2889 states and 4071 transitions. Second operand 3 states. [2018-11-18 14:15:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:32,679 INFO L93 Difference]: Finished difference Result 6669 states and 9385 transitions. [2018-11-18 14:15:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:32,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 14:15:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:32,689 INFO L225 Difference]: With dead ends: 6669 [2018-11-18 14:15:32,689 INFO L226 Difference]: Without dead ends: 3851 [2018-11-18 14:15:32,692 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 14:15:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-18 14:15:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3849. [2018-11-18 14:15:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-11-18 14:15:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5319 transitions. [2018-11-18 14:15:32,763 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5319 transitions. Word has length 27 [2018-11-18 14:15:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:32,763 INFO L480 AbstractCegarLoop]: Abstraction has 3849 states and 5319 transitions. [2018-11-18 14:15:32,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5319 transitions. [2018-11-18 14:15:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 14:15:32,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:32,766 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 14:15:32,767 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:32,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:32,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1182043657, now seen corresponding path program 1 times [2018-11-18 14:15:32,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:32,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:32,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:32,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:32,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:32,851 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 14:15:32,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:32,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:32,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:32,852 INFO L87 Difference]: Start difference. First operand 3849 states and 5319 transitions. Second operand 3 states. [2018-11-18 14:15:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:32,993 INFO L93 Difference]: Finished difference Result 5773 states and 7945 transitions. [2018-11-18 14:15:32,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:32,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 14:15:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:33,001 INFO L225 Difference]: With dead ends: 5773 [2018-11-18 14:15:33,001 INFO L226 Difference]: Without dead ends: 3915 [2018-11-18 14:15:33,004 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 14:15:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-11-18 14:15:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3913. [2018-11-18 14:15:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-18 14:15:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 5319 transitions. [2018-11-18 14:15:33,078 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 5319 transitions. Word has length 28 [2018-11-18 14:15:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:33,078 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 5319 transitions. [2018-11-18 14:15:33,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 5319 transitions. [2018-11-18 14:15:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 14:15:33,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:33,082 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 14:15:33,082 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:33,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 170926407, now seen corresponding path program 1 times [2018-11-18 14:15:33,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:33,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:33,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:33,163 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 14:15:33,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:33,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:33,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:33,164 INFO L87 Difference]: Start difference. First operand 3913 states and 5319 transitions. Second operand 3 states. [2018-11-18 14:15:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:33,314 INFO L93 Difference]: Finished difference Result 6669 states and 9161 transitions. [2018-11-18 14:15:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:33,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 14:15:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:33,332 INFO L225 Difference]: With dead ends: 6669 [2018-11-18 14:15:33,332 INFO L226 Difference]: Without dead ends: 6667 [2018-11-18 14:15:33,334 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 14:15:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-11-18 14:15:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5769. [2018-11-18 14:15:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-18 14:15:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7623 transitions. [2018-11-18 14:15:33,430 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7623 transitions. Word has length 28 [2018-11-18 14:15:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:33,430 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 7623 transitions. [2018-11-18 14:15:33,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7623 transitions. [2018-11-18 14:15:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 14:15:33,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:33,436 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 14:15:33,436 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:33,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:33,436 INFO L82 PathProgramCache]: Analyzing trace with hash -415879607, now seen corresponding path program 1 times [2018-11-18 14:15:33,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:33,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:33,527 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 14:15:33,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:33,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:33,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:33,528 INFO L87 Difference]: Start difference. First operand 5769 states and 7623 transitions. Second operand 3 states. [2018-11-18 14:15:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:33,628 INFO L93 Difference]: Finished difference Result 13197 states and 17353 transitions. [2018-11-18 14:15:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:33,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 14:15:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:33,641 INFO L225 Difference]: With dead ends: 13197 [2018-11-18 14:15:33,641 INFO L226 Difference]: Without dead ends: 7563 [2018-11-18 14:15:33,650 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 14:15:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2018-11-18 14:15:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7561. [2018-11-18 14:15:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-11-18 14:15:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 9735 transitions. [2018-11-18 14:15:33,833 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 9735 transitions. Word has length 28 [2018-11-18 14:15:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:33,833 INFO L480 AbstractCegarLoop]: Abstraction has 7561 states and 9735 transitions. [2018-11-18 14:15:33,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 9735 transitions. [2018-11-18 14:15:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 14:15:33,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:33,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, 1, 1, 1, 1, 1] [2018-11-18 14:15:33,840 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:33,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1003967089, now seen corresponding path program 1 times [2018-11-18 14:15:33,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:33,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:33,908 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 14:15:33,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:33,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:33,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:33,909 INFO L87 Difference]: Start difference. First operand 7561 states and 9735 transitions. Second operand 3 states. [2018-11-18 14:15:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:34,025 INFO L93 Difference]: Finished difference Result 11341 states and 14537 transitions. [2018-11-18 14:15:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:34,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 14:15:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:34,035 INFO L225 Difference]: With dead ends: 11341 [2018-11-18 14:15:34,035 INFO L226 Difference]: Without dead ends: 7691 [2018-11-18 14:15:34,041 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 14:15:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2018-11-18 14:15:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7689. [2018-11-18 14:15:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-11-18 14:15:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 9735 transitions. [2018-11-18 14:15:34,185 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 9735 transitions. Word has length 29 [2018-11-18 14:15:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:34,186 INFO L480 AbstractCegarLoop]: Abstraction has 7689 states and 9735 transitions. [2018-11-18 14:15:34,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 9735 transitions. [2018-11-18 14:15:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 14:15:34,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:34,191 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 14:15:34,192 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:34,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash -7150161, now seen corresponding path program 1 times [2018-11-18 14:15:34,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:34,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:34,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:34,255 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 14:15:34,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:34,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:34,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:34,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:34,256 INFO L87 Difference]: Start difference. First operand 7689 states and 9735 transitions. Second operand 3 states. [2018-11-18 14:15:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:34,425 INFO L93 Difference]: Finished difference Result 12813 states and 16265 transitions. [2018-11-18 14:15:34,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:34,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 14:15:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:34,442 INFO L225 Difference]: With dead ends: 12813 [2018-11-18 14:15:34,442 INFO L226 Difference]: Without dead ends: 12811 [2018-11-18 14:15:34,446 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 14:15:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12811 states. [2018-11-18 14:15:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12811 to 11529. [2018-11-18 14:15:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-18 14:15:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 14215 transitions. [2018-11-18 14:15:34,640 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 14215 transitions. Word has length 29 [2018-11-18 14:15:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:34,641 INFO L480 AbstractCegarLoop]: Abstraction has 11529 states and 14215 transitions. [2018-11-18 14:15:34,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 14215 transitions. [2018-11-18 14:15:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 14:15:34,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:34,653 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 14:15:34,653 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:34,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash -593956175, now seen corresponding path program 1 times [2018-11-18 14:15:34,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:34,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:34,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:34,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:34,705 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 14:15:34,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:34,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:34,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:34,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:34,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:34,706 INFO L87 Difference]: Start difference. First operand 11529 states and 14215 transitions. Second operand 3 states. [2018-11-18 14:15:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:34,974 INFO L93 Difference]: Finished difference Result 26125 states and 31881 transitions. [2018-11-18 14:15:34,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:34,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 14:15:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:34,983 INFO L225 Difference]: With dead ends: 26125 [2018-11-18 14:15:34,983 INFO L226 Difference]: Without dead ends: 14859 [2018-11-18 14:15:34,990 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 14:15:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2018-11-18 14:15:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 14857. [2018-11-18 14:15:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2018-11-18 14:15:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 17671 transitions. [2018-11-18 14:15:35,187 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 17671 transitions. Word has length 29 [2018-11-18 14:15:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:35,187 INFO L480 AbstractCegarLoop]: Abstraction has 14857 states and 17671 transitions. [2018-11-18 14:15:35,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 17671 transitions. [2018-11-18 14:15:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 14:15:35,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:35,192 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 14:15:35,193 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:35,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash -221438882, now seen corresponding path program 1 times [2018-11-18 14:15:35,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:35,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:35,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:35,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:35,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:35,248 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 14:15:35,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:35,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:35,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:35,251 INFO L87 Difference]: Start difference. First operand 14857 states and 17671 transitions. Second operand 3 states. [2018-11-18 14:15:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:35,480 INFO L93 Difference]: Finished difference Result 22285 states and 26377 transitions. [2018-11-18 14:15:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:35,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 14:15:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:35,495 INFO L225 Difference]: With dead ends: 22285 [2018-11-18 14:15:35,495 INFO L226 Difference]: Without dead ends: 15115 [2018-11-18 14:15:35,505 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 14:15:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2018-11-18 14:15:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 15113. [2018-11-18 14:15:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15113 states. [2018-11-18 14:15:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15113 states to 15113 states and 17671 transitions. [2018-11-18 14:15:35,712 INFO L78 Accepts]: Start accepts. Automaton has 15113 states and 17671 transitions. Word has length 30 [2018-11-18 14:15:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:35,712 INFO L480 AbstractCegarLoop]: Abstraction has 15113 states and 17671 transitions. [2018-11-18 14:15:35,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 15113 states and 17671 transitions. [2018-11-18 14:15:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 14:15:35,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:35,720 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 14:15:35,720 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:35,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:35,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1232556132, now seen corresponding path program 1 times [2018-11-18 14:15:35,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:35,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:35,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:35,823 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 14:15:35,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:35,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:35,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:35,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:35,824 INFO L87 Difference]: Start difference. First operand 15113 states and 17671 transitions. Second operand 3 states. [2018-11-18 14:15:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:36,197 INFO L93 Difference]: Finished difference Result 24587 states and 28424 transitions. [2018-11-18 14:15:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:36,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 14:15:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:36,217 INFO L225 Difference]: With dead ends: 24587 [2018-11-18 14:15:36,218 INFO L226 Difference]: Without dead ends: 24585 [2018-11-18 14:15:36,225 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 14:15:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24585 states. [2018-11-18 14:15:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24585 to 23049. [2018-11-18 14:15:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23049 states. [2018-11-18 14:15:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23049 states to 23049 states and 26375 transitions. [2018-11-18 14:15:36,524 INFO L78 Accepts]: Start accepts. Automaton has 23049 states and 26375 transitions. Word has length 30 [2018-11-18 14:15:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:36,524 INFO L480 AbstractCegarLoop]: Abstraction has 23049 states and 26375 transitions. [2018-11-18 14:15:36,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23049 states and 26375 transitions. [2018-11-18 14:15:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 14:15:36,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:15:36,535 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 14:15:36,535 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:15:36,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:15:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1819362146, now seen corresponding path program 1 times [2018-11-18 14:15:36,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:15:36,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:15:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:36,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:15:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:15:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:15:36,592 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 14:15:36,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:15:36,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:15:36,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:15:36,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:15:36,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:15:36,593 INFO L87 Difference]: Start difference. First operand 23049 states and 26375 transitions. Second operand 3 states. [2018-11-18 14:15:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:15:36,988 INFO L93 Difference]: Finished difference Result 51721 states and 58119 transitions. [2018-11-18 14:15:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:15:36,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 14:15:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:15:36,989 INFO L225 Difference]: With dead ends: 51721 [2018-11-18 14:15:36,989 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:15:37,021 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 14:15:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:15:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:15:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:15:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:15:37,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-18 14:15:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:15:37,022 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:15:37,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:15:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:15:37,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:15:37,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:15:37,060 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 14:15:37,060 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:15:37,060 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:15:37,060 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 14:15:37,060 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L428 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,061 INFO L425 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,062 INFO L428 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-18 14:15:37,062 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-18 14:15:37,062 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-18 14:15:37,062 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-18 14:15:37,062 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-18 14:15:37,062 INFO L421 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-18 14:15:37,069 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,069 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,069 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,069 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-18 14:15:37,069 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-18 14:15:37,070 INFO L425 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-18 14:15:37,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:15:37 BoogieIcfgContainer [2018-11-18 14:15:37,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:15:37,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:15:37,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:15:37,078 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:15:37,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:15:29" (3/4) ... [2018-11-18 14:15:37,081 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:15:37,087 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:15:37,087 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:15:37,091 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 14:15:37,091 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 14:15:37,092 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 14:15:37,143 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8f0c58e3-4cdf-4021-a0ef-c326cba09acf/bin-2019/uautomizer/witness.graphml [2018-11-18 14:15:37,143 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:15:37,144 INFO L168 Benchmark]: Toolchain (without parser) took 7975.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.7 MB). Free memory was 961.8 MB in the beginning and 1.4 GB in the end (delta: -402.7 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2018-11-18 14:15:37,145 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:15:37,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.96 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 945.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:15:37,146 INFO L168 Benchmark]: Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:15:37,146 INFO L168 Benchmark]: RCFGBuilder took 425.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:15:37,148 INFO L168 Benchmark]: TraceAbstraction took 7283.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -246.2 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:15:37,149 INFO L168 Benchmark]: Witness Printer took 65.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:15:37,151 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 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.96 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 945.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 425.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7283.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -246.2 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 45 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2443 SDtfs, 1178 SDslu, 1649 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23049occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 5147 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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, 1.4s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 33520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...