./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:01:30,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:01:30,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:01:30,546 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:01:30,546 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:01:30,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:01:30,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:01:30,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:01:30,550 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:01:30,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:01:30,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:01:30,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:01:30,552 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:01:30,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:01:30,554 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:01:30,554 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:01:30,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:01:30,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:01:30,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:01:30,558 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:01:30,559 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:01:30,560 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:01:30,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:01:30,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:01:30,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:01:30,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:01:30,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:01:30,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:01:30,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:01:30,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:01:30,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:01:30,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:01:30,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:01:30,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:01:30,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:01:30,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:01:30,566 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 10:01:30,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:01:30,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:01:30,575 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:01:30,575 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 10:01:30,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:01:30,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:01:30,576 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:01:30,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:01:30,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:01:30,577 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:01:30,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:01:30,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:01:30,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:01:30,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:01:30,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:01:30,577 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:01:30,578 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:01:30,578 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:01:30,578 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:01:30,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:01:30,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:01:30,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:01:30,578 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:01:30,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:01:30,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:01:30,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:01:30,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:01:30,579 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:01:30,579 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:01:30,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:01:30,580 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_b135a62e-8551-483c-ba14-11b5dd146131/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2018-11-18 10:01:30,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:01:30,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:01:30,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:01:30,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:01:30,620 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:01:30,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:01:30,669 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/data/143afd36a/7dd1dc6d5801421fbd8b2114e6851a01/FLAG5a58509e8 [2018-11-18 10:01:31,019 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:01:31,019 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:01:31,025 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/data/143afd36a/7dd1dc6d5801421fbd8b2114e6851a01/FLAG5a58509e8 [2018-11-18 10:01:31,443 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/data/143afd36a/7dd1dc6d5801421fbd8b2114e6851a01 [2018-11-18 10:01:31,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:01:31,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 10:01:31,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:01:31,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:01:31,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:01:31,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e32060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31, skipping insertion in model container [2018-11-18 10:01:31,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:01:31,474 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:01:31,587 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:01:31,589 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:01:31,601 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:01:31,609 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:01:31,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31 WrapperNode [2018-11-18 10:01:31,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:01:31,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:01:31,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:01:31,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:01:31,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... [2018-11-18 10:01:31,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:01:31,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:01:31,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:01:31,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:01:31,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:01:31,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:01:31,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:01:31,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:01:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 10:01:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 10:01:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:01:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:01:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:01:31,853 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:01:31,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:01:31 BoogieIcfgContainer [2018-11-18 10:01:31,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:01:31,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:01:31,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:01:31,856 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:01:31,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:01:31" (1/3) ... [2018-11-18 10:01:31,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee25408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:01:31, skipping insertion in model container [2018-11-18 10:01:31,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:31" (2/3) ... [2018-11-18 10:01:31,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee25408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:01:31, skipping insertion in model container [2018-11-18 10:01:31,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:01:31" (3/3) ... [2018-11-18 10:01:31,859 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:01:31,865 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:01:31,872 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:01:31,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:01:31,909 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:01:31,910 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:01:31,910 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:01:31,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:01:31,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:01:31,910 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:01:31,910 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:01:31,910 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:01:31,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:01:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 10:01:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 10:01:31,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:31,933 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:31,935 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:31,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -6959071, now seen corresponding path program 1 times [2018-11-18 10:01:31,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:31,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:31,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:31,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:31,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,077 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-18 10:01:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,113 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2018-11-18 10:01:32,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 10:01:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,123 INFO L225 Difference]: With dead ends: 59 [2018-11-18 10:01:32,124 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 10:01:32,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 10:01:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-11-18 10:01:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 10:01:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2018-11-18 10:01:32,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2018-11-18 10:01:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,152 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2018-11-18 10:01:32,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-18 10:01:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 10:01:32,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,154 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,154 INFO L82 PathProgramCache]: Analyzing trace with hash -816305697, now seen corresponding path program 1 times [2018-11-18 10:01:32,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,195 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 3 states. [2018-11-18 10:01:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,227 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2018-11-18 10:01:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 10:01:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,228 INFO L225 Difference]: With dead ends: 70 [2018-11-18 10:01:32,228 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 10:01:32,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 10:01:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-18 10:01:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 10:01:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2018-11-18 10:01:32,233 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 16 [2018-11-18 10:01:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2018-11-18 10:01:32,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2018-11-18 10:01:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 10:01:32,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,234 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,235 INFO L82 PathProgramCache]: Analyzing trace with hash -215516200, now seen corresponding path program 1 times [2018-11-18 10:01:32,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,264 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 3 states. [2018-11-18 10:01:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,277 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2018-11-18 10:01:32,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 10:01:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,278 INFO L225 Difference]: With dead ends: 67 [2018-11-18 10:01:32,278 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 10:01:32,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 10:01:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 10:01:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 10:01:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2018-11-18 10:01:32,285 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 17 [2018-11-18 10:01:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,285 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2018-11-18 10:01:32,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2018-11-18 10:01:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 10:01:32,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,286 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash 464542170, now seen corresponding path program 1 times [2018-11-18 10:01:32,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,314 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand 3 states. [2018-11-18 10:01:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,334 INFO L93 Difference]: Finished difference Result 81 states and 125 transitions. [2018-11-18 10:01:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 10:01:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,336 INFO L225 Difference]: With dead ends: 81 [2018-11-18 10:01:32,336 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 10:01:32,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 10:01:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-11-18 10:01:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 10:01:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2018-11-18 10:01:32,342 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 17 [2018-11-18 10:01:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,343 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2018-11-18 10:01:32,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2018-11-18 10:01:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 10:01:32,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,344 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash -344804456, now seen corresponding path program 1 times [2018-11-18 10:01:32,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,378 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand 3 states. [2018-11-18 10:01:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,401 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2018-11-18 10:01:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 10:01:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,402 INFO L225 Difference]: With dead ends: 131 [2018-11-18 10:01:32,402 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 10:01:32,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 10:01:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-18 10:01:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 10:01:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2018-11-18 10:01:32,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 17 [2018-11-18 10:01:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,408 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2018-11-18 10:01:32,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,408 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2018-11-18 10:01:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 10:01:32,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,409 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1516120724, now seen corresponding path program 1 times [2018-11-18 10:01:32,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,438 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand 3 states. [2018-11-18 10:01:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,457 INFO L93 Difference]: Finished difference Result 118 states and 176 transitions. [2018-11-18 10:01:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 10:01:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,458 INFO L225 Difference]: With dead ends: 118 [2018-11-18 10:01:32,459 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 10:01:32,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 10:01:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-18 10:01:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 10:01:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2018-11-18 10:01:32,465 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 18 [2018-11-18 10:01:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,465 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2018-11-18 10:01:32,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2018-11-18 10:01:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 10:01:32,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,467 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2098788202, now seen corresponding path program 1 times [2018-11-18 10:01:32,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,486 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand 3 states. [2018-11-18 10:01:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,499 INFO L93 Difference]: Finished difference Result 141 states and 209 transitions. [2018-11-18 10:01:32,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 10:01:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,500 INFO L225 Difference]: With dead ends: 141 [2018-11-18 10:01:32,500 INFO L226 Difference]: Without dead ends: 139 [2018-11-18 10:01:32,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-18 10:01:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-11-18 10:01:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 10:01:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2018-11-18 10:01:32,509 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 18 [2018-11-18 10:01:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,509 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2018-11-18 10:01:32,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2018-11-18 10:01:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 10:01:32,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1386832468, now seen corresponding path program 1 times [2018-11-18 10:01:32,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,529 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2018-11-18 10:01:32,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,549 INFO L93 Difference]: Finished difference Result 245 states and 357 transitions. [2018-11-18 10:01:32,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 10:01:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,550 INFO L225 Difference]: With dead ends: 245 [2018-11-18 10:01:32,550 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 10:01:32,551 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 10:01:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-18 10:01:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 10:01:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-18 10:01:32,561 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 18 [2018-11-18 10:01:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,561 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-18 10:01:32,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-18 10:01:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 10:01:32,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,562 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:01:32,562 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash -637709139, now seen corresponding path program 1 times [2018-11-18 10:01:32,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,598 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 3 states. [2018-11-18 10:01:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,622 INFO L93 Difference]: Finished difference Result 217 states and 301 transitions. [2018-11-18 10:01:32,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 10:01:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,623 INFO L225 Difference]: With dead ends: 217 [2018-11-18 10:01:32,624 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 10:01:32,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 10:01:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-18 10:01:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 10:01:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2018-11-18 10:01:32,631 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 19 [2018-11-18 10:01:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,631 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2018-11-18 10:01:32,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2018-11-18 10:01:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 10:01:32,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,633 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-18 10:01:32,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash 42349231, now seen corresponding path program 1 times [2018-11-18 10:01:32,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,659 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 3 states. [2018-11-18 10:01:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,685 INFO L93 Difference]: Finished difference Result 253 states and 345 transitions. [2018-11-18 10:01:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 10:01:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,686 INFO L225 Difference]: With dead ends: 253 [2018-11-18 10:01:32,686 INFO L226 Difference]: Without dead ends: 251 [2018-11-18 10:01:32,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-18 10:01:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 209. [2018-11-18 10:01:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-18 10:01:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 279 transitions. [2018-11-18 10:01:32,696 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 279 transitions. Word has length 19 [2018-11-18 10:01:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,696 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 279 transitions. [2018-11-18 10:01:32,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 279 transitions. [2018-11-18 10:01:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 10:01:32,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,697 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-18 10:01:32,698 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,698 INFO L82 PathProgramCache]: Analyzing trace with hash -766997395, now seen corresponding path program 1 times [2018-11-18 10:01:32,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,712 INFO L87 Difference]: Start difference. First operand 209 states and 279 transitions. Second operand 3 states. [2018-11-18 10:01:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,730 INFO L93 Difference]: Finished difference Result 469 states and 617 transitions. [2018-11-18 10:01:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 10:01:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,731 INFO L225 Difference]: With dead ends: 469 [2018-11-18 10:01:32,732 INFO L226 Difference]: Without dead ends: 275 [2018-11-18 10:01:32,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-18 10:01:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-11-18 10:01:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-18 10:01:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2018-11-18 10:01:32,740 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 19 [2018-11-18 10:01:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,741 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2018-11-18 10:01:32,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2018-11-18 10:01:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:01:32,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,742 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-18 10:01:32,742 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1313042185, now seen corresponding path program 1 times [2018-11-18 10:01:32,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,770 INFO L87 Difference]: Start difference. First operand 273 states and 343 transitions. Second operand 3 states. [2018-11-18 10:01:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,795 INFO L93 Difference]: Finished difference Result 409 states and 509 transitions. [2018-11-18 10:01:32,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:01:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,796 INFO L225 Difference]: With dead ends: 409 [2018-11-18 10:01:32,796 INFO L226 Difference]: Without dead ends: 283 [2018-11-18 10:01:32,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-18 10:01:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-11-18 10:01:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 10:01:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 343 transitions. [2018-11-18 10:01:32,806 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 343 transitions. Word has length 20 [2018-11-18 10:01:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,806 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 343 transitions. [2018-11-18 10:01:32,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 343 transitions. [2018-11-18 10:01:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:01:32,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,807 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-18 10:01:32,807 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1993100555, now seen corresponding path program 1 times [2018-11-18 10:01:32,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,819 INFO L87 Difference]: Start difference. First operand 281 states and 343 transitions. Second operand 3 states. [2018-11-18 10:01:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,842 INFO L93 Difference]: Finished difference Result 779 states and 920 transitions. [2018-11-18 10:01:32,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:01:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,844 INFO L225 Difference]: With dead ends: 779 [2018-11-18 10:01:32,844 INFO L226 Difference]: Without dead ends: 281 [2018-11-18 10:01:32,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-18 10:01:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-11-18 10:01:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 10:01:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 311 transitions. [2018-11-18 10:01:32,854 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 311 transitions. Word has length 20 [2018-11-18 10:01:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,855 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 311 transitions. [2018-11-18 10:01:32,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-18 10:01:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:01:32,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:01:32,855 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-18 10:01:32,855 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:01:32,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:01:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1492520115, now seen corresponding path program 1 times [2018-11-18 10:01:32,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:01:32,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:01:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:01:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:01:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:01:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:01:32,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:01:32,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:01:32,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:01:32,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:01:32,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,867 INFO L87 Difference]: Start difference. First operand 281 states and 311 transitions. Second operand 3 states. [2018-11-18 10:01:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:01:32,883 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-18 10:01:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:01:32,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:01:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:01:32,884 INFO L225 Difference]: With dead ends: 281 [2018-11-18 10:01:32,884 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:01:32,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:01:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:01:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:01:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:01:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:01:32,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-18 10:01:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:01:32,886 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:01:32,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:01:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:01:32,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:01:32,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:01:32,900 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 10:01:32,901 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:01:32,901 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:01:32,901 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 10:01:32,901 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:01:32,901 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:01:32,901 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-18 10:01:32,901 INFO L428 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-18 10:01:32,901 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-18 10:01:32,901 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,901 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L425 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,902 INFO L428 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-18 10:01:32,903 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-18 10:01:32,903 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-18 10:01:32,903 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-18 10:01:32,903 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,903 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-18 10:01:32,903 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-18 10:01:32,903 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-18 10:01:32,903 INFO L421 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-18 10:01:32,903 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 10:01:32,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:01:32 BoogieIcfgContainer [2018-11-18 10:01:32,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:01:32,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:01:32,908 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:01:32,908 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:01:32,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:01:31" (3/4) ... [2018-11-18 10:01:32,911 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:01:32,915 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:01:32,916 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:01:32,919 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 10:01:32,920 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 10:01:32,920 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 10:01:32,957 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b135a62e-8551-483c-ba14-11b5dd146131/bin-2019/uautomizer/witness.graphml [2018-11-18 10:01:32,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:01:32,958 INFO L168 Benchmark]: Toolchain (without parser) took 1511.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 953.9 MB in the beginning and 982.9 MB in the end (delta: -29.0 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:01:32,959 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:01:32,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 943.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:01:32,960 INFO L168 Benchmark]: Boogie Preprocessor took 23.56 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:01:32,960 INFO L168 Benchmark]: RCFGBuilder took 219.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:01:32,961 INFO L168 Benchmark]: TraceAbstraction took 1053.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 985.6 MB in the end (delta: 135.4 MB). Peak memory consumption was 135.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:01:32,961 INFO L168 Benchmark]: Witness Printer took 49.75 ms. Allocated memory is still 1.2 GB. Free memory was 985.6 MB in the beginning and 982.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:01:32,963 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 943.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.56 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1053.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 985.6 MB in the end (delta: 135.4 MB). Peak memory consumption was 135.4 MB. Max. memory is 11.5 GB. * Witness Printer took 49.75 ms. Allocated memory is still 1.2 GB. Free memory was 985.6 MB in the beginning and 982.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: 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, 30 locations, 1 error locations. SAFE Result, 1.0s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 664 SDtfs, 297 SDslu, 428 SDs, 0 SdLazy, 73 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=12, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 121 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 7060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...