./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/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_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/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-1dbac8b [2018-11-10 07:21:44,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:21:44,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:21:44,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:21:44,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:21:44,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:21:44,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:21:44,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:21:44,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:21:44,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:21:44,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:21:44,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:21:44,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:21:44,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:21:44,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:21:44,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:21:44,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:21:44,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:21:44,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:21:44,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:21:44,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:21:44,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:21:44,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:21:44,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:21:44,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:21:44,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:21:44,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:21:44,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:21:44,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:21:44,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:21:44,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:21:44,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:21:44,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:21:44,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:21:44,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:21:44,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:21:44,609 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:21:44,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:21:44,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:21:44,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:21:44,620 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:21:44,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:21:44,621 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:21:44,621 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:21:44,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:21:44,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:21:44,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:21:44,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:21:44,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:21:44,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:21:44,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:21:44,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:21:44,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:21:44,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:21:44,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:21:44,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:21:44,623 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:21:44,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:21:44,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:21:44,624 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_d8c52e40-0ade-4f09-af63-b82c040d0208/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-10 07:21:44,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:21:44,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:21:44,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:21:44,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:21:44,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:21:44,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:21:44,693 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/data/13599e78d/2422bf43a75c4dc7b0eaaa0d64bab5ec/FLAGcedc03c6d [2018-11-10 07:21:45,087 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:21:45,088 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:21:45,094 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/data/13599e78d/2422bf43a75c4dc7b0eaaa0d64bab5ec/FLAGcedc03c6d [2018-11-10 07:21:45,101 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/data/13599e78d/2422bf43a75c4dc7b0eaaa0d64bab5ec [2018-11-10 07:21:45,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:21:45,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:21:45,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:21:45,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:21:45,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:21:45,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45, skipping insertion in model container [2018-11-10 07:21:45,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:21:45,128 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:21:45,254 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:21:45,256 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:21:45,274 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:21:45,285 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:21:45,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45 WrapperNode [2018-11-10 07:21:45,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:21:45,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:21:45,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:21:45,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:21:45,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... [2018-11-10 07:21:45,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:21:45,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:21:45,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:21:45,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:21:45,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/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-10 07:21:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:21:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:21:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:21:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:21:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:21:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:21:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:21:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:21:45,568 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:21:45,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:21:45 BoogieIcfgContainer [2018-11-10 07:21:45,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:21:45,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:21:45,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:21:45,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:21:45,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:21:45" (1/3) ... [2018-11-10 07:21:45,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518984cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:21:45, skipping insertion in model container [2018-11-10 07:21:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:45" (2/3) ... [2018-11-10 07:21:45,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518984cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:21:45, skipping insertion in model container [2018-11-10 07:21:45,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:21:45" (3/3) ... [2018-11-10 07:21:45,575 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:21:45,581 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:21:45,586 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:21:45,596 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:21:45,614 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:21:45,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:21:45,614 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:21:45,614 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:21:45,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:21:45,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:21:45,615 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:21:45,615 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:21:45,615 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:21:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-10 07:21:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:21:45,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:45,632 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-10 07:21:45,634 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:45,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:45,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1332805667, now seen corresponding path program 1 times [2018-11-10 07:21:45,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:45,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:45,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:45,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:45,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:45,765 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-10 07:21:45,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:45,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:45,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:45,780 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-10 07:21:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:45,813 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2018-11-10 07:21:45,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:45,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:21:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:45,821 INFO L225 Difference]: With dead ends: 89 [2018-11-10 07:21:45,822 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 07:21:45,824 INFO L605 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-10 07:21:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 07:21:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2018-11-10 07:21:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 07:21:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-11-10 07:21:45,855 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2018-11-10 07:21:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:45,855 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2018-11-10 07:21:45,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2018-11-10 07:21:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:21:45,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:45,856 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-10 07:21:45,856 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:45,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1919611681, now seen corresponding path program 1 times [2018-11-10 07:21:45,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:45,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:45,893 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-10 07:21:45,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:45,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:45,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:45,896 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-11-10 07:21:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:45,929 INFO L93 Difference]: Finished difference Result 120 states and 215 transitions. [2018-11-10 07:21:45,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:45,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:21:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:45,931 INFO L225 Difference]: With dead ends: 120 [2018-11-10 07:21:45,931 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 07:21:45,932 INFO L605 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-10 07:21:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 07:21:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-10 07:21:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 07:21:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-11-10 07:21:45,939 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 21 [2018-11-10 07:21:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:45,939 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2018-11-10 07:21:45,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2018-11-10 07:21:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:21:45,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:45,939 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-10 07:21:45,940 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:45,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:45,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1632910664, now seen corresponding path program 1 times [2018-11-10 07:21:45,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:45,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:45,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:45,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:45,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:45,974 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-10 07:21:45,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:45,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:45,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:45,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:45,975 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 3 states. [2018-11-10 07:21:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:45,991 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2018-11-10 07:21:45,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:45,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:21:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:45,992 INFO L225 Difference]: With dead ends: 112 [2018-11-10 07:21:45,993 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 07:21:45,993 INFO L605 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-10 07:21:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 07:21:45,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-10 07:21:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 07:21:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-11-10 07:21:45,999 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 22 [2018-11-10 07:21:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,000 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-11-10 07:21:46,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-11-10 07:21:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:21:46,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,000 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-10 07:21:46,001 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,001 INFO L82 PathProgramCache]: Analyzing trace with hash 621793414, now seen corresponding path program 1 times [2018-11-10 07:21:46,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,036 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-10 07:21:46,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,037 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 3 states. [2018-11-10 07:21:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,049 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2018-11-10 07:21:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:21:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,051 INFO L225 Difference]: With dead ends: 141 [2018-11-10 07:21:46,051 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 07:21:46,051 INFO L605 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-10 07:21:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 07:21:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-11-10 07:21:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 07:21:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-11-10 07:21:46,057 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 22 [2018-11-10 07:21:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,057 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-11-10 07:21:46,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-11-10 07:21:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:21:46,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,058 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-10 07:21:46,059 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 34987400, now seen corresponding path program 1 times [2018-11-10 07:21:46,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,094 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-10 07:21:46,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,095 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 3 states. [2018-11-10 07:21:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,107 INFO L93 Difference]: Finished difference Result 231 states and 405 transitions. [2018-11-10 07:21:46,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:21:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,109 INFO L225 Difference]: With dead ends: 231 [2018-11-10 07:21:46,109 INFO L226 Difference]: Without dead ends: 141 [2018-11-10 07:21:46,110 INFO L605 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-10 07:21:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-10 07:21:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-10 07:21:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 07:21:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 239 transitions. [2018-11-10 07:21:46,117 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 239 transitions. Word has length 22 [2018-11-10 07:21:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,117 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 239 transitions. [2018-11-10 07:21:46,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2018-11-10 07:21:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:21:46,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,118 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-10 07:21:46,118 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940372, now seen corresponding path program 1 times [2018-11-10 07:21:46,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,144 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-10 07:21:46,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,145 INFO L87 Difference]: Start difference. First operand 139 states and 239 transitions. Second operand 3 states. [2018-11-10 07:21:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,155 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2018-11-10 07:21:46,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:21:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,157 INFO L225 Difference]: With dead ends: 208 [2018-11-10 07:21:46,157 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 07:21:46,157 INFO L605 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-10 07:21:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 07:21:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-10 07:21:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 07:21:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 239 transitions. [2018-11-10 07:21:46,164 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 239 transitions. Word has length 23 [2018-11-10 07:21:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,164 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 239 transitions. [2018-11-10 07:21:46,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-11-10 07:21:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:21:46,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,165 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-10 07:21:46,165 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1084823122, now seen corresponding path program 1 times [2018-11-10 07:21:46,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,194 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-10 07:21:46,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,195 INFO L87 Difference]: Start difference. First operand 141 states and 239 transitions. Second operand 3 states. [2018-11-10 07:21:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,217 INFO L93 Difference]: Finished difference Result 261 states and 449 transitions. [2018-11-10 07:21:46,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:21:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,219 INFO L225 Difference]: With dead ends: 261 [2018-11-10 07:21:46,219 INFO L226 Difference]: Without dead ends: 259 [2018-11-10 07:21:46,219 INFO L605 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-10 07:21:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-10 07:21:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 189. [2018-11-10 07:21:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 07:21:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2018-11-10 07:21:46,228 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 23 [2018-11-10 07:21:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,228 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2018-11-10 07:21:46,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2018-11-10 07:21:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:21:46,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,229 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-10 07:21:46,230 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash 498017108, now seen corresponding path program 1 times [2018-11-10 07:21:46,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,258 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-10 07:21:46,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,259 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 3 states. [2018-11-10 07:21:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,286 INFO L93 Difference]: Finished difference Result 445 states and 757 transitions. [2018-11-10 07:21:46,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:21:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,287 INFO L225 Difference]: With dead ends: 445 [2018-11-10 07:21:46,287 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 07:21:46,288 INFO L605 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-10 07:21:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 07:21:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-11-10 07:21:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 07:21:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 443 transitions. [2018-11-10 07:21:46,298 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 443 transitions. Word has length 23 [2018-11-10 07:21:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,298 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 443 transitions. [2018-11-10 07:21:46,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 443 transitions. [2018-11-10 07:21:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:21:46,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,299 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-10 07:21:46,299 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash -730007523, now seen corresponding path program 1 times [2018-11-10 07:21:46,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,322 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-10 07:21:46,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,323 INFO L87 Difference]: Start difference. First operand 265 states and 443 transitions. Second operand 3 states. [2018-11-10 07:21:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,347 INFO L93 Difference]: Finished difference Result 397 states and 661 transitions. [2018-11-10 07:21:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:21:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,349 INFO L225 Difference]: With dead ends: 397 [2018-11-10 07:21:46,349 INFO L226 Difference]: Without dead ends: 271 [2018-11-10 07:21:46,350 INFO L605 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-10 07:21:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-10 07:21:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-11-10 07:21:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-10 07:21:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 443 transitions. [2018-11-10 07:21:46,358 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 443 transitions. Word has length 24 [2018-11-10 07:21:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,358 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 443 transitions. [2018-11-10 07:21:46,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 443 transitions. [2018-11-10 07:21:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:21:46,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,359 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-10 07:21:46,360 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1741124773, now seen corresponding path program 1 times [2018-11-10 07:21:46,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:21:46,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,386 INFO L87 Difference]: Start difference. First operand 269 states and 443 transitions. Second operand 3 states. [2018-11-10 07:21:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,403 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2018-11-10 07:21:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:21:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,405 INFO L225 Difference]: With dead ends: 493 [2018-11-10 07:21:46,405 INFO L226 Difference]: Without dead ends: 491 [2018-11-10 07:21:46,405 INFO L605 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-10 07:21:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-10 07:21:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2018-11-10 07:21:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-10 07:21:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 599 transitions. [2018-11-10 07:21:46,416 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 599 transitions. Word has length 24 [2018-11-10 07:21:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,416 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 599 transitions. [2018-11-10 07:21:46,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 599 transitions. [2018-11-10 07:21:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:21:46,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,418 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-10 07:21:46,418 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1967036509, now seen corresponding path program 1 times [2018-11-10 07:21:46,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,439 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-10 07:21:46,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,440 INFO L87 Difference]: Start difference. First operand 369 states and 599 transitions. Second operand 3 states. [2018-11-10 07:21:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,469 INFO L93 Difference]: Finished difference Result 869 states and 1417 transitions. [2018-11-10 07:21:46,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:21:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,471 INFO L225 Difference]: With dead ends: 869 [2018-11-10 07:21:46,471 INFO L226 Difference]: Without dead ends: 515 [2018-11-10 07:21:46,472 INFO L605 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-10 07:21:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-10 07:21:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2018-11-10 07:21:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-10 07:21:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2018-11-10 07:21:46,487 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 24 [2018-11-10 07:21:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,487 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2018-11-10 07:21:46,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2018-11-10 07:21:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:21:46,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,488 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-10 07:21:46,488 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1859921289, now seen corresponding path program 1 times [2018-11-10 07:21:46,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,505 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-10 07:21:46,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,507 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand 3 states. [2018-11-10 07:21:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,526 INFO L93 Difference]: Finished difference Result 769 states and 1229 transitions. [2018-11-10 07:21:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:21:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,529 INFO L225 Difference]: With dead ends: 769 [2018-11-10 07:21:46,529 INFO L226 Difference]: Without dead ends: 523 [2018-11-10 07:21:46,530 INFO L605 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-10 07:21:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-10 07:21:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2018-11-10 07:21:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-10 07:21:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 823 transitions. [2018-11-10 07:21:46,546 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 823 transitions. Word has length 25 [2018-11-10 07:21:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,546 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 823 transitions. [2018-11-10 07:21:46,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 823 transitions. [2018-11-10 07:21:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:21:46,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,547 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-10 07:21:46,548 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 848804039, now seen corresponding path program 1 times [2018-11-10 07:21:46,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,564 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-10 07:21:46,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,566 INFO L87 Difference]: Start difference. First operand 521 states and 823 transitions. Second operand 3 states. [2018-11-10 07:21:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,595 INFO L93 Difference]: Finished difference Result 1501 states and 2361 transitions. [2018-11-10 07:21:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:21:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,598 INFO L225 Difference]: With dead ends: 1501 [2018-11-10 07:21:46,598 INFO L226 Difference]: Without dead ends: 1003 [2018-11-10 07:21:46,599 INFO L605 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-10 07:21:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-10 07:21:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1001. [2018-11-10 07:21:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-10 07:21:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1543 transitions. [2018-11-10 07:21:46,629 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1543 transitions. Word has length 25 [2018-11-10 07:21:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,629 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1543 transitions. [2018-11-10 07:21:46,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1543 transitions. [2018-11-10 07:21:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:21:46,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,631 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-10 07:21:46,631 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1435610053, now seen corresponding path program 1 times [2018-11-10 07:21:46,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,662 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-10 07:21:46,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,663 INFO L87 Difference]: Start difference. First operand 1001 states and 1543 transitions. Second operand 3 states. [2018-11-10 07:21:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,690 INFO L93 Difference]: Finished difference Result 1213 states and 1913 transitions. [2018-11-10 07:21:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:21:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,693 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 07:21:46,694 INFO L226 Difference]: Without dead ends: 1211 [2018-11-10 07:21:46,694 INFO L605 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-10 07:21:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-10 07:21:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1001. [2018-11-10 07:21:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-10 07:21:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1527 transitions. [2018-11-10 07:21:46,725 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1527 transitions. Word has length 25 [2018-11-10 07:21:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,725 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1527 transitions. [2018-11-10 07:21:46,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1527 transitions. [2018-11-10 07:21:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:21:46,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,727 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-10 07:21:46,728 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,728 INFO L82 PathProgramCache]: Analyzing trace with hash 543336178, now seen corresponding path program 1 times [2018-11-10 07:21:46,728 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,755 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-10 07:21:46,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,756 INFO L87 Difference]: Start difference. First operand 1001 states and 1527 transitions. Second operand 3 states. [2018-11-10 07:21:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,790 INFO L93 Difference]: Finished difference Result 1789 states and 2777 transitions. [2018-11-10 07:21:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:21:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,796 INFO L225 Difference]: With dead ends: 1789 [2018-11-10 07:21:46,796 INFO L226 Difference]: Without dead ends: 1787 [2018-11-10 07:21:46,797 INFO L605 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-10 07:21:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-11-10 07:21:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1433. [2018-11-10 07:21:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-11-10 07:21:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2135 transitions. [2018-11-10 07:21:46,841 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2135 transitions. Word has length 26 [2018-11-10 07:21:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,842 INFO L481 AbstractCegarLoop]: Abstraction has 1433 states and 2135 transitions. [2018-11-10 07:21:46,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2135 transitions. [2018-11-10 07:21:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:21:46,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,844 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-10 07:21:46,844 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -43469836, now seen corresponding path program 1 times [2018-11-10 07:21:46,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:46,862 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-10 07:21:46,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:46,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:46,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:46,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:46,863 INFO L87 Difference]: Start difference. First operand 1433 states and 2135 transitions. Second operand 3 states. [2018-11-10 07:21:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:46,923 INFO L93 Difference]: Finished difference Result 3357 states and 5017 transitions. [2018-11-10 07:21:46,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:46,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:21:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:46,928 INFO L225 Difference]: With dead ends: 3357 [2018-11-10 07:21:46,928 INFO L226 Difference]: Without dead ends: 1947 [2018-11-10 07:21:46,931 INFO L605 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-10 07:21:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2018-11-10 07:21:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1945. [2018-11-10 07:21:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-10 07:21:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2855 transitions. [2018-11-10 07:21:46,985 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2855 transitions. Word has length 26 [2018-11-10 07:21:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:46,985 INFO L481 AbstractCegarLoop]: Abstraction has 1945 states and 2855 transitions. [2018-11-10 07:21:46,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2855 transitions. [2018-11-10 07:21:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:21:46,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:46,988 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-10 07:21:46,988 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:46,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -336232580, now seen corresponding path program 1 times [2018-11-10 07:21:46,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:46,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:47,002 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-10 07:21:47,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:47,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:47,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:47,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:47,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:47,003 INFO L87 Difference]: Start difference. First operand 1945 states and 2855 transitions. Second operand 3 states. [2018-11-10 07:21:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:47,044 INFO L93 Difference]: Finished difference Result 2941 states and 4313 transitions. [2018-11-10 07:21:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:47,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 07:21:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:47,050 INFO L225 Difference]: With dead ends: 2941 [2018-11-10 07:21:47,050 INFO L226 Difference]: Without dead ends: 1995 [2018-11-10 07:21:47,052 INFO L605 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-10 07:21:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-11-10 07:21:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2018-11-10 07:21:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-11-10 07:21:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2887 transitions. [2018-11-10 07:21:47,112 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2887 transitions. Word has length 27 [2018-11-10 07:21:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:47,112 INFO L481 AbstractCegarLoop]: Abstraction has 1993 states and 2887 transitions. [2018-11-10 07:21:47,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2887 transitions. [2018-11-10 07:21:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:21:47,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:47,114 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-10 07:21:47,115 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:47,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349830, now seen corresponding path program 1 times [2018-11-10 07:21:47,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:47,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:47,138 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-10 07:21:47,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:47,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:47,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:47,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:47,139 INFO L87 Difference]: Start difference. First operand 1993 states and 2887 transitions. Second operand 3 states. [2018-11-10 07:21:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:47,230 INFO L93 Difference]: Finished difference Result 3469 states and 5097 transitions. [2018-11-10 07:21:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 07:21:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:47,238 INFO L225 Difference]: With dead ends: 3469 [2018-11-10 07:21:47,238 INFO L226 Difference]: Without dead ends: 3467 [2018-11-10 07:21:47,239 INFO L605 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-10 07:21:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-10 07:21:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2889. [2018-11-10 07:21:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-11-10 07:21:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4071 transitions. [2018-11-10 07:21:47,312 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4071 transitions. Word has length 27 [2018-11-10 07:21:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:47,312 INFO L481 AbstractCegarLoop]: Abstraction has 2889 states and 4071 transitions. [2018-11-10 07:21:47,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4071 transitions. [2018-11-10 07:21:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:21:47,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:47,316 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-10 07:21:47,316 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:47,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155844, now seen corresponding path program 1 times [2018-11-10 07:21:47,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:47,354 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-10 07:21:47,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:47,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:47,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:47,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:47,355 INFO L87 Difference]: Start difference. First operand 2889 states and 4071 transitions. Second operand 3 states. [2018-11-10 07:21:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:47,443 INFO L93 Difference]: Finished difference Result 6669 states and 9385 transitions. [2018-11-10 07:21:47,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:47,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 07:21:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:47,454 INFO L225 Difference]: With dead ends: 6669 [2018-11-10 07:21:47,454 INFO L226 Difference]: Without dead ends: 3851 [2018-11-10 07:21:47,458 INFO L605 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-10 07:21:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-10 07:21:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3849. [2018-11-10 07:21:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-11-10 07:21:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5319 transitions. [2018-11-10 07:21:47,565 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5319 transitions. Word has length 27 [2018-11-10 07:21:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:47,565 INFO L481 AbstractCegarLoop]: Abstraction has 3849 states and 5319 transitions. [2018-11-10 07:21:47,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5319 transitions. [2018-11-10 07:21:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:21:47,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:47,569 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-10 07:21:47,569 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:47,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1182043657, now seen corresponding path program 1 times [2018-11-10 07:21:47,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:47,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:47,586 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-10 07:21:47,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:47,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:47,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:47,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:47,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:47,587 INFO L87 Difference]: Start difference. First operand 3849 states and 5319 transitions. Second operand 3 states. [2018-11-10 07:21:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:47,667 INFO L93 Difference]: Finished difference Result 5773 states and 7945 transitions. [2018-11-10 07:21:47,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:47,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 07:21:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:47,678 INFO L225 Difference]: With dead ends: 5773 [2018-11-10 07:21:47,678 INFO L226 Difference]: Without dead ends: 3915 [2018-11-10 07:21:47,681 INFO L605 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-10 07:21:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-11-10 07:21:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3913. [2018-11-10 07:21:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-10 07:21:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 5319 transitions. [2018-11-10 07:21:47,784 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 5319 transitions. Word has length 28 [2018-11-10 07:21:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:47,784 INFO L481 AbstractCegarLoop]: Abstraction has 3913 states and 5319 transitions. [2018-11-10 07:21:47,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 5319 transitions. [2018-11-10 07:21:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:21:47,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:47,788 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-10 07:21:47,788 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:47,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:47,788 INFO L82 PathProgramCache]: Analyzing trace with hash 170926407, now seen corresponding path program 1 times [2018-11-10 07:21:47,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:47,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:47,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:47,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:47,802 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-10 07:21:47,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:47,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:47,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:47,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:47,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:47,803 INFO L87 Difference]: Start difference. First operand 3913 states and 5319 transitions. Second operand 3 states. [2018-11-10 07:21:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:47,900 INFO L93 Difference]: Finished difference Result 6669 states and 9161 transitions. [2018-11-10 07:21:47,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:47,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 07:21:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:47,917 INFO L225 Difference]: With dead ends: 6669 [2018-11-10 07:21:47,917 INFO L226 Difference]: Without dead ends: 6667 [2018-11-10 07:21:47,919 INFO L605 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-10 07:21:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-11-10 07:21:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5769. [2018-11-10 07:21:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-10 07:21:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7623 transitions. [2018-11-10 07:21:48,056 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7623 transitions. Word has length 28 [2018-11-10 07:21:48,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:48,056 INFO L481 AbstractCegarLoop]: Abstraction has 5769 states and 7623 transitions. [2018-11-10 07:21:48,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7623 transitions. [2018-11-10 07:21:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:21:48,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:48,062 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-10 07:21:48,062 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:48,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash -415879607, now seen corresponding path program 1 times [2018-11-10 07:21:48,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:48,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:48,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:48,074 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-10 07:21:48,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:48,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:48,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:48,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:48,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:48,075 INFO L87 Difference]: Start difference. First operand 5769 states and 7623 transitions. Second operand 3 states. [2018-11-10 07:21:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:48,189 INFO L93 Difference]: Finished difference Result 13197 states and 17353 transitions. [2018-11-10 07:21:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:48,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 07:21:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:48,202 INFO L225 Difference]: With dead ends: 13197 [2018-11-10 07:21:48,203 INFO L226 Difference]: Without dead ends: 7563 [2018-11-10 07:21:48,212 INFO L605 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-10 07:21:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2018-11-10 07:21:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7561. [2018-11-10 07:21:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-11-10 07:21:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 9735 transitions. [2018-11-10 07:21:48,456 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 9735 transitions. Word has length 28 [2018-11-10 07:21:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:48,457 INFO L481 AbstractCegarLoop]: Abstraction has 7561 states and 9735 transitions. [2018-11-10 07:21:48,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 9735 transitions. [2018-11-10 07:21:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:21:48,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:48,465 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-10 07:21:48,466 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:48,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1003967089, now seen corresponding path program 1 times [2018-11-10 07:21:48,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:48,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:48,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:48,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:48,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:48,490 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-10 07:21:48,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:48,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:48,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:48,491 INFO L87 Difference]: Start difference. First operand 7561 states and 9735 transitions. Second operand 3 states. [2018-11-10 07:21:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:48,598 INFO L93 Difference]: Finished difference Result 11341 states and 14537 transitions. [2018-11-10 07:21:48,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:48,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 07:21:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:48,610 INFO L225 Difference]: With dead ends: 11341 [2018-11-10 07:21:48,610 INFO L226 Difference]: Without dead ends: 7691 [2018-11-10 07:21:48,617 INFO L605 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-10 07:21:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2018-11-10 07:21:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7689. [2018-11-10 07:21:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-11-10 07:21:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 9735 transitions. [2018-11-10 07:21:48,789 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 9735 transitions. Word has length 29 [2018-11-10 07:21:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:48,789 INFO L481 AbstractCegarLoop]: Abstraction has 7689 states and 9735 transitions. [2018-11-10 07:21:48,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 9735 transitions. [2018-11-10 07:21:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:21:48,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:48,796 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-10 07:21:48,796 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:48,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash -7150161, now seen corresponding path program 1 times [2018-11-10 07:21:48,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:48,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:48,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:48,822 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-10 07:21:48,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:48,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:48,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:48,823 INFO L87 Difference]: Start difference. First operand 7689 states and 9735 transitions. Second operand 3 states. [2018-11-10 07:21:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:48,993 INFO L93 Difference]: Finished difference Result 12813 states and 16265 transitions. [2018-11-10 07:21:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:48,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 07:21:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:49,012 INFO L225 Difference]: With dead ends: 12813 [2018-11-10 07:21:49,013 INFO L226 Difference]: Without dead ends: 12811 [2018-11-10 07:21:49,017 INFO L605 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-10 07:21:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12811 states. [2018-11-10 07:21:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12811 to 11529. [2018-11-10 07:21:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-10 07:21:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 14215 transitions. [2018-11-10 07:21:49,218 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 14215 transitions. Word has length 29 [2018-11-10 07:21:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:49,218 INFO L481 AbstractCegarLoop]: Abstraction has 11529 states and 14215 transitions. [2018-11-10 07:21:49,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 14215 transitions. [2018-11-10 07:21:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:21:49,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:49,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:21:49,230 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:49,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:49,230 INFO L82 PathProgramCache]: Analyzing trace with hash -593956175, now seen corresponding path program 1 times [2018-11-10 07:21:49,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:49,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:49,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:21:49,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:49,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:49,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:49,247 INFO L87 Difference]: Start difference. First operand 11529 states and 14215 transitions. Second operand 3 states. [2018-11-10 07:21:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:49,481 INFO L93 Difference]: Finished difference Result 26125 states and 31881 transitions. [2018-11-10 07:21:49,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:49,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 07:21:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:49,505 INFO L225 Difference]: With dead ends: 26125 [2018-11-10 07:21:49,505 INFO L226 Difference]: Without dead ends: 14859 [2018-11-10 07:21:49,521 INFO L605 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-10 07:21:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2018-11-10 07:21:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 14857. [2018-11-10 07:21:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2018-11-10 07:21:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 17671 transitions. [2018-11-10 07:21:49,785 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 17671 transitions. Word has length 29 [2018-11-10 07:21:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:49,785 INFO L481 AbstractCegarLoop]: Abstraction has 14857 states and 17671 transitions. [2018-11-10 07:21:49,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 17671 transitions. [2018-11-10 07:21:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:21:49,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:49,794 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-10 07:21:49,794 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:49,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash -221438882, now seen corresponding path program 1 times [2018-11-10 07:21:49,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:49,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:49,830 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-10 07:21:49,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:49,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:49,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:49,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:49,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:49,831 INFO L87 Difference]: Start difference. First operand 14857 states and 17671 transitions. Second operand 3 states. [2018-11-10 07:21:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:49,982 INFO L93 Difference]: Finished difference Result 22285 states and 26377 transitions. [2018-11-10 07:21:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:49,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 07:21:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:50,000 INFO L225 Difference]: With dead ends: 22285 [2018-11-10 07:21:50,000 INFO L226 Difference]: Without dead ends: 15115 [2018-11-10 07:21:50,011 INFO L605 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-10 07:21:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2018-11-10 07:21:50,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 15113. [2018-11-10 07:21:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15113 states. [2018-11-10 07:21:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15113 states to 15113 states and 17671 transitions. [2018-11-10 07:21:50,283 INFO L78 Accepts]: Start accepts. Automaton has 15113 states and 17671 transitions. Word has length 30 [2018-11-10 07:21:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:50,284 INFO L481 AbstractCegarLoop]: Abstraction has 15113 states and 17671 transitions. [2018-11-10 07:21:50,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15113 states and 17671 transitions. [2018-11-10 07:21:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:21:50,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:50,292 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-10 07:21:50,292 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:50,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:50,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1232556132, now seen corresponding path program 1 times [2018-11-10 07:21:50,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:50,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:50,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:50,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:50,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:50,318 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-10 07:21:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:50,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:50,319 INFO L87 Difference]: Start difference. First operand 15113 states and 17671 transitions. Second operand 3 states. [2018-11-10 07:21:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:50,584 INFO L93 Difference]: Finished difference Result 24587 states and 28424 transitions. [2018-11-10 07:21:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:50,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 07:21:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:50,610 INFO L225 Difference]: With dead ends: 24587 [2018-11-10 07:21:50,610 INFO L226 Difference]: Without dead ends: 24585 [2018-11-10 07:21:50,614 INFO L605 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-10 07:21:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24585 states. [2018-11-10 07:21:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24585 to 23049. [2018-11-10 07:21:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23049 states. [2018-11-10 07:21:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23049 states to 23049 states and 26375 transitions. [2018-11-10 07:21:50,933 INFO L78 Accepts]: Start accepts. Automaton has 23049 states and 26375 transitions. Word has length 30 [2018-11-10 07:21:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:50,933 INFO L481 AbstractCegarLoop]: Abstraction has 23049 states and 26375 transitions. [2018-11-10 07:21:50,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 23049 states and 26375 transitions. [2018-11-10 07:21:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:21:50,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:21:50,942 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-10 07:21:50,942 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:21:50,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:21:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1819362146, now seen corresponding path program 1 times [2018-11-10 07:21:50,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:21:50,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:21:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:50,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:21:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:21:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:21:50,974 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-10 07:21:50,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:21:50,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:21:50,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:21:50,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:21:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:21:50,975 INFO L87 Difference]: Start difference. First operand 23049 states and 26375 transitions. Second operand 3 states. [2018-11-10 07:21:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:21:51,267 INFO L93 Difference]: Finished difference Result 51721 states and 58119 transitions. [2018-11-10 07:21:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:21:51,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 07:21:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:21:51,268 INFO L225 Difference]: With dead ends: 51721 [2018-11-10 07:21:51,268 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:21:51,312 INFO L605 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-10 07:21:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:21:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:21:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:21:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:21:51,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-10 07:21:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:21:51,313 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:21:51,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:21:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:21:51,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:21:51,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:21:51,356 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:21:51,356 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:21:51,356 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:21:51,356 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:21:51,356 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:21:51,356 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:21:51,356 INFO L428 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-10 07:21:51,356 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-10 07:21:51,357 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L428 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L421 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,358 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,359 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 07:21:51,360 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-10 07:21:51,360 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,360 INFO L425 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-10 07:21:51,360 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 07:21:51,360 INFO L425 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-10 07:21:51,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:21:51 BoogieIcfgContainer [2018-11-10 07:21:51,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:21:51,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:21:51,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:21:51,366 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:21:51,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:21:45" (3/4) ... [2018-11-10 07:21:51,370 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:21:51,376 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:21:51,376 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:21:51,381 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 07:21:51,381 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:21:51,381 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:21:51,430 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d8c52e40-0ade-4f09-af63-b82c040d0208/bin-2019/uautomizer/witness.graphml [2018-11-10 07:21:51,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:21:51,431 INFO L168 Benchmark]: Toolchain (without parser) took 6327.43 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 507.0 MB). Free memory was 954.9 MB in the beginning and 864.9 MB in the end (delta: 89.9 MB). Peak memory consumption was 596.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:21:51,433 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:21:51,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.85 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:21:51,434 INFO L168 Benchmark]: Boogie Preprocessor took 20.70 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:21:51,434 INFO L168 Benchmark]: RCFGBuilder took 261.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:21:51,434 INFO L168 Benchmark]: TraceAbstraction took 5796.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 360.2 MB). Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 247.4 MB). Peak memory consumption was 607.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:21:51,434 INFO L168 Benchmark]: Witness Printer took 64.55 ms. Allocated memory is still 1.5 GB. Free memory was 878.8 MB in the beginning and 864.9 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:21:51,436 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.85 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.70 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 261.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5796.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 360.2 MB). Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 247.4 MB). Peak memory consumption was 607.6 MB. Max. memory is 11.5 GB. * Witness Printer took 64.55 ms. Allocated memory is still 1.5 GB. Free memory was 878.8 MB in the beginning and 864.9 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 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, 5.7s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2443 SDtfs, 1178 SDslu, 1649 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s 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: 2.2s 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, 0.5s 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...