./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:09:26,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:09:26,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:09:26,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:09:26,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:09:26,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:09:26,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:09:26,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:09:26,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:09:26,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:09:26,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:09:26,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:09:26,763 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:09:26,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:09:26,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:09:26,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:09:26,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:09:26,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:09:26,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:09:26,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:09:26,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:09:26,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:09:26,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:09:26,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:09:26,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:09:26,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:09:26,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:09:26,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:09:26,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:09:26,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:09:26,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:09:26,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:09:26,776 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:09:26,776 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:09:26,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:09:26,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:09:26,777 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:09:26,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:09:26,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:09:26,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:09:26,789 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:09:26,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:09:26,789 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:09:26,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:09:26,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:09:26,791 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:09:26,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:09:26,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:09:26,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:09:26,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:09:26,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:09:26,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:09:26,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:09:26,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:09:26,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:09:26,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:09:26,792 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:09:26,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:09:26,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:09:26,792 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_453a2723-0962-4cca-a802-ca16c2d4672b/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-11-10 07:09:26,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:09:26,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:09:26,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:09:26,825 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:09:26,825 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:09:26,825 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:09:26,864 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/data/7eaf74162/0972a40f21774377bd6cf8e950a0d354/FLAG43ec2a9c2 [2018-11-10 07:09:27,206 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:09:27,206 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:09:27,213 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/data/7eaf74162/0972a40f21774377bd6cf8e950a0d354/FLAG43ec2a9c2 [2018-11-10 07:09:27,224 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/data/7eaf74162/0972a40f21774377bd6cf8e950a0d354 [2018-11-10 07:09:27,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:09:27,228 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:09:27,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:09:27,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:09:27,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:09:27,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10835ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27, skipping insertion in model container [2018-11-10 07:09:27,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:09:27,263 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:09:27,381 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:09:27,384 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:09:27,400 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:09:27,409 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:09:27,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27 WrapperNode [2018-11-10 07:09:27,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:09:27,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:09:27,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:09:27,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:09:27,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... [2018-11-10 07:09:27,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:09:27,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:09:27,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:09:27,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:09:27,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/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:09:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:09:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:09:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:09:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:09:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:09:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:09:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:09:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:09:27,657 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:09:27,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:09:27 BoogieIcfgContainer [2018-11-10 07:09:27,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:09:27,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:09:27,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:09:27,661 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:09:27,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:09:27" (1/3) ... [2018-11-10 07:09:27,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be05ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:09:27, skipping insertion in model container [2018-11-10 07:09:27,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:27" (2/3) ... [2018-11-10 07:09:27,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be05ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:09:27, skipping insertion in model container [2018-11-10 07:09:27,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:09:27" (3/3) ... [2018-11-10 07:09:27,664 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:09:27,672 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:09:27,678 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:09:27,687 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:09:27,704 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:09:27,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:09:27,704 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:09:27,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:09:27,705 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:09:27,705 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:09:27,705 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:09:27,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:09:27,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:09:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-10 07:09:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 07:09:27,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:27,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:09:27,728 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:27,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-11-10 07:09:27,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:27,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:27,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:27,845 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:09:27,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:27,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:27,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:27,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:27,859 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-10 07:09:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:27,892 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-11-10 07:09:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:27,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 07:09:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:27,903 INFO L225 Difference]: With dead ends: 77 [2018-11-10 07:09:27,903 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 07:09:27,905 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:09:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 07:09:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-10 07:09:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 07:09:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-11-10 07:09:27,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-11-10 07:09:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:27,932 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-11-10 07:09:27,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-11-10 07:09:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 07:09:27,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:27,932 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:09:27,933 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:27,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-11-10 07:09:27,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:27,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:27,969 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:09:27,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:27,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:27,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:27,972 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-11-10 07:09:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:27,987 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-11-10 07:09:27,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:27,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 07:09:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:27,989 INFO L225 Difference]: With dead ends: 100 [2018-11-10 07:09:27,989 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 07:09:27,989 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:09:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 07:09:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-10 07:09:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 07:09:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-11-10 07:09:27,994 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-11-10 07:09:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:27,994 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-11-10 07:09:27,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-11-10 07:09:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:09:27,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:27,995 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] [2018-11-10 07:09:27,995 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:27,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:27,995 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-11-10 07:09:27,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:27,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:27,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:27,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,032 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:09:28,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,034 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-11-10 07:09:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,060 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-11-10 07:09:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 07:09:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,061 INFO L225 Difference]: With dead ends: 94 [2018-11-10 07:09:28,061 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 07:09:28,062 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:09:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 07:09:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-10 07:09:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 07:09:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-11-10 07:09:28,068 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-11-10 07:09:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,068 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-11-10 07:09:28,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-11-10 07:09:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:09:28,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,069 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] [2018-11-10 07:09:28,069 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-11-10 07:09:28,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,103 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:09:28,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,104 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-11-10 07:09:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,116 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-11-10 07:09:28,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 07:09:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,117 INFO L225 Difference]: With dead ends: 117 [2018-11-10 07:09:28,117 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 07:09:28,118 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:09:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 07:09:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-11-10 07:09:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 07:09:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-11-10 07:09:28,125 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-11-10 07:09:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,125 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-11-10 07:09:28,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-11-10 07:09:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:09:28,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,126 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] [2018-11-10 07:09:28,126 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-11-10 07:09:28,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,143 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:09:28,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,144 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-11-10 07:09:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,170 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-11-10 07:09:28,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 07:09:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,172 INFO L225 Difference]: With dead ends: 191 [2018-11-10 07:09:28,172 INFO L226 Difference]: Without dead ends: 117 [2018-11-10 07:09:28,172 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:09:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-10 07:09:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-10 07:09:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 07:09:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-11-10 07:09:28,180 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-11-10 07:09:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,180 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-11-10 07:09:28,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-11-10 07:09:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:09:28,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,181 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:09:28,181 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-11-10 07:09:28,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,202 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:09:28,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,203 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-11-10 07:09:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,220 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-11-10 07:09:28,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:09:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,221 INFO L225 Difference]: With dead ends: 172 [2018-11-10 07:09:28,221 INFO L226 Difference]: Without dead ends: 119 [2018-11-10 07:09:28,222 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:09:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-10 07:09:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-10 07:09:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-10 07:09:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-11-10 07:09:28,229 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-11-10 07:09:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,229 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-11-10 07:09:28,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-11-10 07:09:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:09:28,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,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] [2018-11-10 07:09:28,230 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-11-10 07:09:28,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,256 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:09:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,257 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-11-10 07:09:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,267 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-11-10 07:09:28,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:09:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,269 INFO L225 Difference]: With dead ends: 213 [2018-11-10 07:09:28,269 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 07:09:28,269 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:09:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 07:09:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-11-10 07:09:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 07:09:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-11-10 07:09:28,276 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-11-10 07:09:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,276 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-11-10 07:09:28,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-11-10 07:09:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:09:28,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,277 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:09:28,277 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-11-10 07:09:28,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,293 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:09:28,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,295 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-11-10 07:09:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,320 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-11-10 07:09:28,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:09:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,322 INFO L225 Difference]: With dead ends: 365 [2018-11-10 07:09:28,323 INFO L226 Difference]: Without dead ends: 219 [2018-11-10 07:09:28,323 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:09:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-10 07:09:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-11-10 07:09:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 07:09:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-11-10 07:09:28,333 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-11-10 07:09:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,334 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-11-10 07:09:28,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-11-10 07:09:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:09:28,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,335 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:09:28,335 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-11-10 07:09:28,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,365 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:09:28,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,366 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-11-10 07:09:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,392 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-10 07:09:28,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:09:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,394 INFO L225 Difference]: With dead ends: 325 [2018-11-10 07:09:28,394 INFO L226 Difference]: Without dead ends: 223 [2018-11-10 07:09:28,394 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:09:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-10 07:09:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-11-10 07:09:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-10 07:09:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-11-10 07:09:28,404 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-11-10 07:09:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,404 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-11-10 07:09:28,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-11-10 07:09:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:09:28,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,405 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:09:28,406 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-11-10 07:09:28,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,427 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:09:28,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,428 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-11-10 07:09:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,456 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-11-10 07:09:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:09:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,457 INFO L225 Difference]: With dead ends: 397 [2018-11-10 07:09:28,457 INFO L226 Difference]: Without dead ends: 395 [2018-11-10 07:09:28,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:09:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-11-10 07:09:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-11-10 07:09:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-10 07:09:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-11-10 07:09:28,464 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-11-10 07:09:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,464 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-11-10 07:09:28,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-11-10 07:09:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:09:28,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,466 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:09:28,466 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-11-10 07:09:28,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,484 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:09:28,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,485 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-11-10 07:09:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,508 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-11-10 07:09:28,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:09:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,510 INFO L225 Difference]: With dead ends: 709 [2018-11-10 07:09:28,510 INFO L226 Difference]: Without dead ends: 419 [2018-11-10 07:09:28,510 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:09:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-10 07:09:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-11-10 07:09:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-10 07:09:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-11-10 07:09:28,520 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-11-10 07:09:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,520 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-11-10 07:09:28,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-11-10 07:09:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:09:28,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,521 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:09:28,522 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-11-10 07:09:28,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,546 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:09:28,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,547 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-11-10 07:09:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,564 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-11-10 07:09:28,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:09:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,567 INFO L225 Difference]: With dead ends: 625 [2018-11-10 07:09:28,567 INFO L226 Difference]: Without dead ends: 427 [2018-11-10 07:09:28,568 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:09:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-10 07:09:28,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-11-10 07:09:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-10 07:09:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-11-10 07:09:28,580 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-11-10 07:09:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,580 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-11-10 07:09:28,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-11-10 07:09:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:09:28,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,581 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:09:28,582 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-11-10 07:09:28,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,600 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:09:28,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,602 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-11-10 07:09:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,639 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-11-10 07:09:28,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:09:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,642 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 07:09:28,642 INFO L226 Difference]: Without dead ends: 811 [2018-11-10 07:09:28,643 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:09:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-11-10 07:09:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-11-10 07:09:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-10 07:09:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-11-10 07:09:28,667 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-11-10 07:09:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,668 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-11-10 07:09:28,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-11-10 07:09:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:09:28,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,669 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:09:28,669 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-11-10 07:09:28,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,689 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:09:28,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,690 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-11-10 07:09:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,725 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-11-10 07:09:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:09:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,728 INFO L225 Difference]: With dead ends: 957 [2018-11-10 07:09:28,728 INFO L226 Difference]: Without dead ends: 955 [2018-11-10 07:09:28,729 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:09:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-10 07:09:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-11-10 07:09:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-10 07:09:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-11-10 07:09:28,755 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-11-10 07:09:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,755 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-11-10 07:09:28,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-11-10 07:09:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:09:28,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,757 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:09:28,757 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-11-10 07:09:28,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,781 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:09:28,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,782 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-11-10 07:09:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,827 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-11-10 07:09:28,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:09:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,831 INFO L225 Difference]: With dead ends: 1405 [2018-11-10 07:09:28,832 INFO L226 Difference]: Without dead ends: 1403 [2018-11-10 07:09:28,832 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:09:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-11-10 07:09:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-11-10 07:09:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 07:09:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-11-10 07:09:28,869 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-11-10 07:09:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:28,869 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-11-10 07:09:28,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-11-10 07:09:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:09:28,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:28,871 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:09:28,872 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:28,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:28,872 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-11-10 07:09:28,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:28,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:28,897 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:09:28,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:28,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:28,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:28,898 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-11-10 07:09:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:28,943 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-11-10 07:09:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:28,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:09:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:28,947 INFO L225 Difference]: With dead ends: 2717 [2018-11-10 07:09:28,948 INFO L226 Difference]: Without dead ends: 1563 [2018-11-10 07:09:28,950 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:09:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-11-10 07:09:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-11-10 07:09:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-10 07:09:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-11-10 07:09:29,000 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-11-10 07:09:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:29,000 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-11-10 07:09:29,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-11-10 07:09:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:09:29,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:29,003 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:09:29,003 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:29,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-11-10 07:09:29,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:29,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:29,033 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:09:29,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:29,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:29,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:29,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:29,034 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-11-10 07:09:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:29,084 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-11-10 07:09:29,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:29,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:09:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:29,089 INFO L225 Difference]: With dead ends: 2365 [2018-11-10 07:09:29,089 INFO L226 Difference]: Without dead ends: 1611 [2018-11-10 07:09:29,091 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:09:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-10 07:09:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-11-10 07:09:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-11-10 07:09:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-11-10 07:09:29,137 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-11-10 07:09:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:29,137 INFO L481 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-11-10 07:09:29,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-11-10 07:09:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:09:29,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:29,139 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:09:29,139 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:29,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-11-10 07:09:29,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:29,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:29,153 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:09:29,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:29,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:29,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:29,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:29,154 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-11-10 07:09:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:29,213 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-11-10 07:09:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:29,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:09:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:29,220 INFO L225 Difference]: With dead ends: 2701 [2018-11-10 07:09:29,220 INFO L226 Difference]: Without dead ends: 2699 [2018-11-10 07:09:29,221 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:09:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-11-10 07:09:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-11-10 07:09:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-10 07:09:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-11-10 07:09:29,293 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-11-10 07:09:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:29,294 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-11-10 07:09:29,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-11-10 07:09:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:09:29,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:29,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:09:29,298 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:29,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:29,298 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-11-10 07:09:29,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:29,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:29,312 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:09:29,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:29,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:29,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:29,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:29,314 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-11-10 07:09:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:29,417 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-11-10 07:09:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:29,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:09:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:29,424 INFO L225 Difference]: With dead ends: 5389 [2018-11-10 07:09:29,425 INFO L226 Difference]: Without dead ends: 3083 [2018-11-10 07:09:29,428 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:09:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-10 07:09:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-11-10 07:09:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-11-10 07:09:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-11-10 07:09:29,518 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-11-10 07:09:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:29,518 INFO L481 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-11-10 07:09:29,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-11-10 07:09:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:09:29,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:29,522 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:09:29,522 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:29,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:29,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-11-10 07:09:29,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:29,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:29,538 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:09:29,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:29,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:29,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:29,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:29,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:29,539 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-11-10 07:09:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:29,606 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-11-10 07:09:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:29,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:09:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:29,614 INFO L225 Difference]: With dead ends: 4621 [2018-11-10 07:09:29,614 INFO L226 Difference]: Without dead ends: 3147 [2018-11-10 07:09:29,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:09:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-11-10 07:09:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-11-10 07:09:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-10 07:09:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-11-10 07:09:29,704 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-11-10 07:09:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:29,704 INFO L481 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-11-10 07:09:29,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-11-10 07:09:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:09:29,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:29,707 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:09:29,707 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:29,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:29,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-11-10 07:09:29,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:29,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:29,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:29,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:29,730 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:09:29,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:29,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:29,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:29,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:29,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:29,731 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-11-10 07:09:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:29,828 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-11-10 07:09:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:29,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:09:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:29,840 INFO L225 Difference]: With dead ends: 5131 [2018-11-10 07:09:29,841 INFO L226 Difference]: Without dead ends: 5129 [2018-11-10 07:09:29,842 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:09:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-11-10 07:09:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-11-10 07:09:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-11-10 07:09:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-11-10 07:09:29,951 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-11-10 07:09:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:29,951 INFO L481 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-11-10 07:09:29,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-11-10 07:09:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:09:29,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:09:29,957 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:09:29,957 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:09:29,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-11-10 07:09:29,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:29,972 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:09:29,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:09:29,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:09:29,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:09:29,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:09:29,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:09:29,973 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-11-10 07:09:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:09:30,087 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-11-10 07:09:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:09:30,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:09:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:09:30,088 INFO L225 Difference]: With dead ends: 10633 [2018-11-10 07:09:30,088 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:09:30,098 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:09:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:09:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:09:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:09:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:09:30,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-10 07:09:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:09:30,099 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:09:30,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:09:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:09:30,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:09:30,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:09:30,126 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:09:30,126 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:09:30,126 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:09:30,126 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:09:30,126 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-10 07:09:30,127 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-10 07:09:30,128 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 07:09:30,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:09:30 BoogieIcfgContainer [2018-11-10 07:09:30,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:09:30,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:09:30,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:09:30,133 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:09:30,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:09:27" (3/4) ... [2018-11-10 07:09:30,136 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:09:30,140 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:09:30,141 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:09:30,144 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 07:09:30,145 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:09:30,145 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:09:30,182 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_453a2723-0962-4cca-a802-ca16c2d4672b/bin-2019/uautomizer/witness.graphml [2018-11-10 07:09:30,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:09:30,183 INFO L168 Benchmark]: Toolchain (without parser) took 2955.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 960.2 MB in the beginning and 942.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:30,184 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:09:30,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.89 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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:09:30,184 INFO L168 Benchmark]: Boogie Preprocessor took 18.41 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 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:09:30,185 INFO L168 Benchmark]: RCFGBuilder took 229.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:30,185 INFO L168 Benchmark]: TraceAbstraction took 2474.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 948.3 MB in the end (delta: 179.3 MB). Peak memory consumption was 260.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:30,185 INFO L168 Benchmark]: Witness Printer took 49.86 ms. Allocated memory is still 1.3 GB. Free memory was 948.3 MB in the beginning and 942.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:30,186 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.89 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.41 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 229.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2474.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 948.3 MB in the end (delta: 179.3 MB). Peak memory consumption was 260.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.86 ms. Allocated memory is still 1.3 GB. Free memory was 948.3 MB in the beginning and 942.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 39 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4745occurred in iteration=21, 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: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 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.3s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...